Planar p-center problem with Tchebychev distance
| buir.advisor | Tansel, Barbaros Ç. | |
| dc.contributor.author | Yılmaz, Dilek | |
| dc.date.accessioned | 2016-01-08T20:11:34Z | |
| dc.date.available | 2016-01-08T20:11:34Z | |
| dc.date.issued | 1994 | |
| dc.department | Department of Industrial Engineering | en_US |
| dc.description | Ankara : The Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent Univ., 1994. | en_US |
| dc.description | Thesis (Master's) -- Bilkent University, 1994. | en_US |
| dc.description | Includes bibliographical references leaves 83-85. | en_US |
| dc.description.abstract | The p-center problem is a model for locating p facilities to serve clients so that the distance between a farthest client and its closest facility is minimized. Emergency service facilities such as fire stations, hospitals and police stations are most of the time located in this manner. In this thesis, the planar p-center problem with Tchebychev distance is studied. The problem is known to be NPHard. We identify certain polynomial time solvable cases and give an efficient branching method which makes use of polynomial time methods in subproblem solutions whenever possible. In addition, a dual problem is posed in light of the existing duality theory on tree networks. | en_US |
| dc.description.degree | M.S. | en_US |
| dc.description.provenance | Made available in DSpace on 2016-01-08T20:11:34Z (GMT). No. of bitstreams: 1 1.pdf: 78510 bytes, checksum: d85492f20c2362aa2bcf4aad49380397 (MD5) | en |
| dc.description.statementofresponsibility | Yılmaz, Dilek | en_US |
| dc.format.extent | viii, 85 leaves, illustrations | en_US |
| dc.identifier.uri | http://hdl.handle.net/11693/17578 | |
| dc.language.iso | English | en_US |
| dc.publisher | Bilkent University | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | p-Center | en_US |
| dc.subject | r-Cover | en_US |
| dc.subject | Duality | en_US |
| dc.subject.lcc | T57.85 .Y55 1994 | en_US |
| dc.subject.lcsh | Industrial location--Mathematical models. | en_US |
| dc.subject.lcsh | Network analysis (Planning). | en_US |
| dc.subject.lcsh | Polynomials. | en_US |
| dc.subject.lcsh | Chebyshev polynomials. | en_US |
| dc.title | Planar p-center problem with Tchebychev distance | en_US |
| dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- B023910.pdf
- Size:
- 2.03 MB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version