✦ LIBER ✦

Heuristic approaches to the asymmetric travelling salesman problem with replenishment arcs

✍ Scribed by V. Mak; N. Boland

Book ID: 111205714
Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 194 KB
Volume: 7
Category: Article
ISSN: 0969-6016
DOI: 10.1111/j.1475-3995.2000.tb00209.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heuristic approaches to the asymmetric t

Heuristic approaches to the asymmetric travelling salesman problem with replenishment arcs

✍ Vicky Mak; Natashia Boland 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB

Facets of the polytope of the asymmetric

Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs

✍ Vicky Mak; Natashia Boland 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 771 KB

Polyhedral results and exact algorithms

Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs

✍ Vicky Mak; Natashia Boland 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Heuristic for the Asymmetric Travelling

Heuristic for the Asymmetric Travelling Salesman Problem

✍ P. van der Cruyssen and M. J. Rijckaert 📂 Article 📅 1978 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 150 KB

Integer programming approaches to the tr

Integer programming approaches to the travelling salesman problem

✍ P. Miliotis 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 494 KB

A heuristic circulation-network approach

A heuristic circulation-network approach to solve the multi-traveling salesman problem

✍ Alberto Garcia-Diaz 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 561 KB

The overall methodology developed in this paper can be organized into two major parts. The first part consists of a representation of the Multi-Traveling Salesman Problem as a network circulation model. The second part is a subtour elimination procedure. The circulation-network representation of the