✦ LIBER ✦

Exact and approximation algorithms for the min–max k-traveling salesmen problem on a tree

✍ Scribed by Xu, Liang; Xu, Zhou; Xu, Dongsheng

Book ID: 122053281
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 565 KB
Volume: 227
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2012.12.023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved Approximation Algorithms for th

Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems

✍ M. Reza Khani, Mohammad R. Salavatipour 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 671 KB

(p − 1)(p + 1)-approximate algorithms fo

(p − 1)(p + 1)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective

✍ Igor Averbakh; Oded Berman 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 950 KB

Suppose p traveling salesmen must visit together all points/nodes of a tree, and the objective is to minimize the maximum of lengths of their tours. For location allocation problems (where both optimal home locations of the salesmen and their tours must be found), which are NP-complete, fast polynom

A branch and bound algorithm for the sym

A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation

✍ Ton Volgenant; Roy Jonker 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 538 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 2906 || A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact

✍ Ibaraki, Toshihide; Katoh, Naoki; Ono, Hirotaka 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 173 KB

This volume contains the proceedings of the 14th Annual International S- posium on Algorithms and Computation (ISAAC 2003), held in Kyoto, Japan, 15–17 December 2003. In the past, it was held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996)