A polyhedral approach to delivery man problem
| buir.advisor | Akgül, Mustafa | |
| dc.contributor.author | Keskinocak, Pınar | |
| dc.date.accessioned | 2016-01-08T20:10:14Z | |
| dc.date.available | 2016-01-08T20:10:14Z | |
| dc.date.issued | 1992 | |
| dc.department | Department of Industrial Engineering | en_US |
| dc.description | Ankara : Department of Industrial Engineering and the Institute of Engineering of Bilkent University, 1992. | en_US |
| dc.description | Thesis (Master's) -- Bilkent University, 1992. | en_US |
| dc.description | Includes bibliographical references leaves 42-44 | en_US |
| dc.description.abstract | In this thesis we discuss some polyhedral approaches to the Delivery Man Problem(DMP),which is a special case of the Traveling .Scvlesman Problem(TSP). First, we look at two formulations of the problem and describe a combinatorial solution procedure for the linear programming relaxation.Then we give some valid inequalities and discuss a Lagrangean Relaxation procedure and a cutting plane procedure. Finally, we propose heuristics for tree graphs and general graphs and give computational results. | en_US |
| dc.description.degree | M.S. | en_US |
| dc.description.provenance | Made available in DSpace on 2016-01-08T20:10:14Z (GMT). No. of bitstreams: 1 1.pdf: 78510 bytes, checksum: d85492f20c2362aa2bcf4aad49380397 (MD5) | en |
| dc.description.statementofresponsibility | Keskinocak, Pınar | en_US |
| dc.format.extent | viii, 44 leaves | en_US |
| dc.identifier.uri | http://hdl.handle.net/11693/17429 | |
| dc.language.iso | English | en_US |
| dc.publisher | Bilkent University | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Delivery Man Problem | en_US |
| dc.subject | Polyhedral Approach | en_US |
| dc.subject | Cutting Plane | en_US |
| dc.subject.lcc | QA402.5 .K47 1992 | en_US |
| dc.subject.lcsh | Traveling-salesman problem. | en_US |
| dc.subject.lcsh | Heuristic programming. | en_US |
| dc.subject.lcsh | Mathematical optimization. | en_US |
| dc.subject.lcsh | Polyhedra. | en_US |
| dc.subject.lcsh | Quadratic programming. | en_US |
| dc.title | A polyhedral approach to delivery man problem | en_US |
| dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- B001988.pdf
- Size:
- 1.11 MB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version