A spanning tree approach to solving the absolute p-center problem

Simple item page
buir.advisorTansel, Barbaros Ç.
dc.contributor.authorBozkaya, Burçin
dc.date.accessioned2016-01-08T20:12:38Z
dc.date.available2016-01-08T20:12:38Z
dc.date.issued1995
dc.departmentDepartment of Industrial Engineeringen_US
dc.descriptionAnkara : The Department of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent Univ., 1995.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 1995.en_US
dc.descriptionIncludes bibliographical references leaves 78-81en_US
dc.description.abstractThe p-center problem on a network is a model to locate p new facilities that will serve n existing demand points on that network. The objective is to minimize the maximum of the weighted distances between each demand point and its nearest new facility. This type of problem usually arises in the location of emergency facilities like hospitals, police and fire stations. The problem is known to be VP-Hard on a cyclic network, but polynomial-time solvable on a tree network. In this study, a spanning tree approach to solving the problem on a cyclic network is discussed. First, the existence of an optimal spanning tree that gives the network optimal solution, is proved. Then, two specific types of spanning trees are introduced and experimentally tested whether they contain the optimal tree or not. Also, some properties of such an optimal tree are discussed and some special cases for which the optimal tree can be determined in polynomial time, are identified.en_US
dc.description.degreeM.S.en_US
dc.description.provenanceMade available in DSpace on 2016-01-08T20:12:38Z (GMT). No. of bitstreams: 1 1.pdf: 78510 bytes, checksum: d85492f20c2362aa2bcf4aad49380397 (MD5)en
dc.description.statementofresponsibilityBozkaya, Burçinen_US
dc.format.extentxi, 81 leaves, illustrations, tablesen_US
dc.identifier.urihttp://hdl.handle.net/11693/17694
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectp-centeren_US
dc.subjectcovering.en_US
dc.subject.lccT57.85 .B69 1995en_US
dc.subject.lcshIndustrial location--Mathematical models.en_US
dc.subject.lcshNetwork analysis (Planning).en_US
dc.titleA spanning tree approach to solving the absolute p-center problemen_US
dc.typeThesisen_US

Files

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

Collections

Dept. of Industrial Engineering - Master's degree