✦ LIBER ✦

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

✍ Scribed by Igor Averbakh; Oded Berman

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 950 KB
Volume: 75
Category: Article
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)89161-5

No coin nor oath required. For personal study only.

✦ Synopsis

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 polynomial heuristics with worst-case relative error (pl)/(p + 1) are presented

📜 SIMILAR VOLUMES

Convergence with orderh2p-1of a 2p+1-poi

Convergence with orderh2p-1of a 2p+1-point scheme of the method of lines for one boundary-value problem

✍ A. P. Kubanskaya 📂 Article 📅 1982 🏛 Springer US 🌐 English ⚖ 266 KB

Some axisymmetrical boundary element app

Some axisymmetrical boundary element approximations for deep cavity problems : Okabe, M Proc 5th International Conference on Numerical Methods in Geomechanics, Nagoya, 1–5 April 1985V1, P151–157. Publ Rotterdam: A. A. Balkema, 1985

📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 109 KB 👁 1 views

Evaluation of a quasi-dynamic algorithm

Evaluation of a quasi-dynamic algorithm for soil consolidation problems : Kovacic, D; Szavits-Nossan, A Proc 6th International Conference on Numerical Methods in Geomechanics, Innsbruck, 11–15 April 1988V1, P587–591. Publ Rotterdam: A A Balkema, 1988

📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 107 KB 👁 3 views