✦ LIBER ✦

Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut

✍ Scribed by Norbert Ascheuer; Matteo Fischetti; Martin Grötschel

Publisher: Springer-Verlag
Year: 2001
Tongue: English
Weight: 290 KB
Volume: 90
Category: Article
ISSN: 0025-5610
DOI: 10.1007/pl00011432

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A modified ant colony system for solving

A modified ant colony system for solving the travelling salesman problem with time windows

✍ Chi-Bin Cheng; Chun-Pin Mao 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 265 KB

A polyhedral study of the asymmetric tra

A polyhedral study of the asymmetric traveling salesman problem with time windows

✍ Norbert Ascheuer; Matteo Fischetti; Martin Grötschel 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB

Solving the asymmetric traveling salesma

Solving the asymmetric traveling salesman problem with periodic constraints

✍ Giuseppe Paletta; Chefi Triki 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB

Solving the Traveling Circus Problem by

Solving the Traveling Circus Problem by Branch & Cut

✍ Mark Hartmann; Özgur Özlük 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 88 KB

A parallel branch and bound algorithm fo

A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems

✍ J. F. Pekny; D. L. Miller 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 902 KB

A branch-and-cut algorithm for the undir

A branch-and-cut algorithm for the undirected selective traveling salesman problem

✍ Gendreau, Michel; Laporte, Gilbert; Semet, Fr�d�ric 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB 👁 2 views

The Selective Traveling Salesman Problem (STSP) is defined on a graph in which profits are associated with vertices and costs are associated with edges. Some vertices are compulsory. The aim is to construct a tour of maximal profit including all compulsory vertices and whose cost does not exceed a p