Polynomially solvable cases of multifacility distance constraints on cyclic networks

Simple item page
buir.advisorTansel, Barbaros Ç.
dc.contributor.authorYeşilkökçen, Naile Gülcan
dc.date.accessioned2016-01-08T20:10:49Z
dc.date.available2016-01-08T20:10:49Z
dc.date.issued1993
dc.descriptionAnkara : The Department of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent Univ., 1993.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 1993.en_US
dc.descriptionIncludes bibliographical references leaves 79-81en_US
dc.description.abstractDistance Constraints Problem is to locate one or more new facilities on a network so that the distances between new and existing facilities as well as between pairs of new facilities do not exceed given upper bounds. The problem is AfV-Complete on cyclic networks and polynomially solvable on trees. Although theory for tree networks is well-developed, there is virtually no theory for cyclic networks. In this thesis, we identify a special class of instances for which we develop theory and algorithms that are applicable to any metric space defining the location space. We require that the interaction between new facilities has a tree structure. The method is based on successive applications of EXPANSION and INTERSECTION operations defined on subsets of the location space. Application of this method to general networks yields strongly polynomial algorithms. Finally, we give an algorithm that constructs an e-optimal solution to a related minimax problem.en_US
dc.description.provenanceMade available in DSpace on 2016-01-08T20:10:49Z (GMT). No. of bitstreams: 1 1.pdf: 78510 bytes, checksum: d85492f20c2362aa2bcf4aad49380397 (MD5)en
dc.description.statementofresponsibilityYeşilkökçen, Naile Gülcanen_US
dc.format.extentxi, 81 leaves, illustrationsen_US
dc.identifier.urihttp://hdl.handle.net/11693/17495
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectDistance Constraintsen_US
dc.subjectNetwork Locationen_US
dc.subjectMinimax Problem with Mutual Communicationen_US
dc.subject.lccT57.85 .Y47 1993en_US
dc.subject.lcshIndustrial location--Mathematical models.en_US
dc.subject.lcshNetwork analysis (Planning).en_US
dc.subject.lcshPolynomials.en_US
dc.titlePolynomially solvable cases of multifacility distance constraints on cyclic networksen_US
dc.typeThesisen_US
thesis.degree.disciplineIndustrial Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
B014211.pdf
Size:
2.32 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Graduate School of Engineering and Science