Composite regions of feasibility for certain classes of distance constrained network location problems

Simple item page
dc.citation.epage159en_US
dc.citation.issueNumber2en_US
dc.citation.spage148en_US
dc.citation.volumeNumber30en_US
dc.contributor.authorTansel, B. Ç.en_US
dc.contributor.authorYeşilkökçen, G. N.en_US
dc.date.accessioned2016-02-08T10:50:42Z
dc.date.available2016-02-08T10:50:42Z
dc.date.issued1996en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractDistance constrained network location involves locating m new facilities on a transport network G so as to satisfy upper bounds on distances between pairs of new facilities and pairs of new and existing facilities. The problem is script N sign℘-complete in general, but polynomially solvable for certain classes. While it is possible to give a consistency characterization for these classes, it does not seem possible to give a global description of the feasible set. However, substantial geometrical insights can be obtained on the feasible set by studying its projections onto the network. The j-th projection defines the j-th composite region which is the set of all points in G at which new facility j can be feasibly placed without violating consistency. We give efficient methods to construct these regions for solvable classes without having to know the feasible set and discuss implications on consistency characterization, what if analysis, and recursive solution constructions.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:50:42Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1996en
dc.identifier.doi10.1287/trsc.30.2.148en_US
dc.identifier.issn0041-1655
dc.identifier.urihttp://hdl.handle.net/11693/25810
dc.language.isoEnglishen_US
dc.publisherINFORMSen_US
dc.relation.isversionofhttps://doi.org/10.1287/trsc.30.2.148en_US
dc.source.titleTransportation Scienceen_US
dc.subjectComputational complexityen_US
dc.subjectOptimizationen_US
dc.subjectPolynomialsen_US
dc.subjectProblem solvingen_US
dc.subjectRecursive functionsen_US
dc.subjectComposite regionsen_US
dc.subjectDistance constrained network locationen_US
dc.subjectFeasible seten_US
dc.subjectTransportation routesen_US
dc.titleComposite regions of feasibility for certain classes of distance constrained network location problemsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Composite regions of feasibility for certain classes of distance constrained network location problems.pdf
Size:
2.38 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Industrial Engineering