✦ LIBER ✦

Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems

✍ Scribed by Marek Libura

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 910 KB
Volume: 30
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(91)90044-w

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the relationship of approximation alg

On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem

✍ Frank Korner 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 249 KB

Sensitivity analysis for shortest path p

Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs

✍ Ramkumar Ramaswamy; James B. Orlin; Nilopal Chakravarti 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 211 KB

Simpler analysis of LP extreme points fo

Simpler analysis of LP extreme points for traveling salesman and survivable network design problems

✍ Viswanath Nagarajan; R. Ravi; Mohit Singh 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 290 KB

We consider the Survivable Network Design Problem (SNDP) and the Symmetric Traveling Salesman Problem (STSP). We give simpler proofs of the existence of a 1 2 -edge and 1-edge in any extreme point of the natural LP relaxations for the SNDP and STSP, respectively. We formulate a common generalization

Analysis of Random Restart and Iterated

Analysis of Random Restart and Iterated Improvement for Global Optimization with Application to the Traveling Salesman Problem

✍ F. Mendivil; R. Shonkwiler; M. C. Spruill 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 201 KB