Distance constraints on cyclic networks : a new polynomially solvable class

Simple item page
buir.advisorTansel, Barbaros
dc.contributor.authorEmir, Hülya
dc.date.accessioned2016-01-08T20:14:47Z
dc.date.available2016-01-08T20:14:47Z
dc.date.issued1997
dc.departmentDepartment of Industrial Engineeringen_US
dc.descriptionAnkara : The Department of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent Univ., 1997.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 1997.en_US
dc.descriptionIncludes bibliographical references leaves 100-101en_US
dc.description.abstractDistance Constraints Problem is to locate new facilities on a network so that the distances between new and existing facilities as well as between pairs of now facilities do not exceed given upper bounds, 'rhc ])roblem is N F-Complele on cyclic networks. The oidy known polynornially solvable class of distance constraints on cyclic networks is the case when the linkage network, which is an auxiliary graph induced by the distance bounds between new facility pairs, is a tree. In this thesis, we identify a new polynornially solvable class where each new facilit}'^ is restricted to an a priori specified feasible region which is confined to a single edge and where the linkage network is cj^clic with the restriction that there exists a node whose deletion breaks all cycles. We then extend the above class to a more general class where the linkage network has a cut vertex whose blocks fulfill the above assumptionsen_US
dc.description.degreeM.S.en_US
dc.description.statementofresponsibilityEmir, Hülyaen_US
dc.format.extentxii, 101 leaves, illustrations, tablesen_US
dc.identifier.urihttp://hdl.handle.net/11693/17942
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectDistance constraintsen_US
dc.subjectnetwork locationen_US
dc.subject.lccT57.85 .E45 1997en_US
dc.subject.lcshIndustrial location--Mathematical models.en_US
dc.subject.lcshNetwork analysis (Planning).en_US
dc.subject.lcshPolynomials.en_US
dc.titleDistance constraints on cyclic networks : a new polynomially solvable classen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
B038247.pdf
Size:
3.5 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
Collections
Dept. of Industrial Engineering - Master's degree