Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5363Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Gavish, Bezalel | - |
| dc.creator | Graves, Stephen C. | - |
| dc.date | 2004-05-28T19:35:47Z | - |
| dc.date | 2004-05-28T19:35:47Z | - |
| dc.date | 1978-07 | - |
| dc.date.accessioned | 2013-10-09T02:39:19Z | - |
| dc.date.available | 2013-10-09T02:39:19Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | http://hdl.handle.net/1721.1/5363 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | New formulations are presented for the Travelling Salesman problem, and their relationship to previous formulations is investigated. The new formulations are extended to include a variety of transportation scheduling problems, such as the Multi-Travelling Salesman problem, the Delivery problem, the School Bus problem and the Dial-a-Bus problem. A Benders decomposition procedure is applied on the new formulations and the resulting computational rocedure is seen to be identical to previous methods for solving the Travelling Salesman problem. Based on the Lagrangean Relaxation method, a new procedure is suggested for generating lagrange multipliers for a subgradient optimization procedure. The effectiveness of the bounds obtained is demonstrated by computational test results. | - |
| dc.description | Research supported, in part, by the Office of Naval Research under Contract N00014-75-C-0556. | - |
| dc.format | 1746 bytes | - |
| dc.format | 1409715 bytes | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.publisher | Massachusetts Institute of Technology, Operations Research Center | - |
| dc.relation | Operations Research Center Working Paper;OR 078-78 | - |
| dc.title | The Travelling Salesman Problem and Related Problems | - |
| dc.type | Working Paper | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.