✦ LIBER ✦

An Improved Branching Rule for the Symmetric Travelling Salesman Problem

✍ Scribed by P. M. E. Shutler

Book ID: 123725624
Publisher: Palgrave Publishers Ltd.
Year: 2001
Tongue: English
Weight: 317 KB
Volume: 52
Category: Article
ISSN: 0160-5682
DOI: 10.2307/254144

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Accelerated branch exchange heuristics f

Accelerated branch exchange heuristics for symmetric traveling salesman problems

✍ William R. Stewart Jr. 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 682 KB

An Improved Transformation of the Symmet

An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem

✍ Roy Jonker and Ton Volgenant 📂 Article 📅 1988 🏛 INFORMS 🌐 English ⚖ 221 KB

A Branch-And-Cut Algorithm for the Symme

A Branch-And-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem

✍ Matteo Fischetti, Juan José Salazar González and Paolo Toth 📂 Article 📅 1997 🏛 INFORMS 🌐 English ⚖ 855 KB

Improvements of the Held—Karp algorithm

Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem

✍ Keld Helbig Hansen; Jakob Krarup 📂 Article 📅 1974 🏛 Springer-Verlag 🌐 English ⚖ 485 KB

Nonoptimal Edges for the Symmetric Trave

Nonoptimal Edges for the Symmetric Traveling Salesman Problem

✍ Roy Jonker and Ton Volgenant 📂 Article 📅 1984 🏛 INFORMS 🌐 English ⚖ 232 KB

An efficient composite heuristic for the

An efficient composite heuristic for the symmetric generalized traveling salesman problem

✍ Jacques Renaud; Fayez F. Boctor 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 1014 KB

The main purpose of this paper is to introduce a new composite heuristic for solving the generalized traveling salesman problem. The proposed heuristic is composed of three phases: the construction of an initial partial solution, the insertion of a node from each non-visited node-subset, and a solut