Approximation algorithms for some routing problems

Several polynomial time approximation algorithms for some NP-complete routing problems are presented, and the worst-case ratios of the cost of the obtained route to that of an optimal are determined. A mixed-strategy heuristic with a bound of 9/5 is presented for the Stacker-Crane problem (a modifie...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annual Symposium on Foundations of Computer Science s. 216 - 227
Hlavní autoři: Frederickson, Greg N., Hecht, Matthew S., Kim, Chul E.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.10.1976
Témata:
Approximation algorithms
Cities and towns
Computer science
Cost function
Cranes
Educational institutions
Minimax techniques
Polynomials
Routing
Traveling salesman problems
ISSN:0272-5428
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Several polynomial time approximation algorithms for some NP-complete routing problems are presented, and the worst-case ratios of the cost of the obtained route to that of an optimal are determined. A mixed-strategy heuristic with a bound of 9/5 is presented for the Stacker-Crane problem (a modified Traveling Salesman problem). A tour-splitting heuristic is given for k-person variants of the Traveling Salesman problem, the Chinese Postman problem, and the Stacker-Crane problem, for which a minimax solution is sought. This heuristic has a bound of e + 1 - 1/k, where e is the bound for the corresponding 1-person algorithm.
ISSN:0272-5428
DOI:10.1109/SFCS.1976.6