✦ LIBER ✦

Worst-case analysis of two travelling salesman heuristics

✍ Scribed by Hoon Liong Ong; J.B. Moore

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 463 KB
Volume: 2
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(84)90078-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A worst-case analysis of two approximate

A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem

✍ Giovanni Righini; Marco Trubian 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 251 KB

Quantizers and the worst-case Euclidean

Quantizers and the worst-case Euclidean traveling salesman problem

✍ Luis A. Goddyn 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 888 KB

A heuristic with worst-case analysis for

A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree

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

Worst-case analysis of scheduling heuris

Worst-case analysis of scheduling heuristics of parallel systems

✍ Zhen Liu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 374 KB

It is well-known that most scheduling problems arising from parallel systems are N N P P-hard, even under very special assumptions. Thus, various suboptimal algorithms, in particular heuristics, were proposed in the literature. Worst-case error bounds are established in this paper for heuristics of

Worst case analysis of a class of set co

Worst case analysis of a class of set covering heuristics

✍ Andrew C. Ho 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 366 KB

On the worst-case performance of some al

On the worst-case performance of some algorithms for the asymmetric traveling salesman problem

✍ A. M. Frieze; G. Galbiati; F. Maffioli 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 657 KB