✦ LIBER ✦

A heuristic approach for the Travelling Purchaser Problem

✍ Scribed by Jorge Riera-Ledesma; Juan José Salazar-González

Book ID: 108116745
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 413 KB
Volume: 162
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2003.10.032

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximate algorithms for the travellin

Approximate algorithms for the travelling purchaser problem

✍ Hoon Liong Ong 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 463 KB

A heuristic approach to commodity purcha

A heuristic approach to commodity purchasing

✍ Santi B. Lahiri 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 626 KB

A hybrid heuristic for the traveling sal

A hybrid heuristic for the traveling salesman problem

✍ Baraglia, R.; Hidalgo, J.I.; Perego, R. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 204 KB

The optimum assignments and a new heuris

The optimum assignments and a new heuristic approach for the traveling salesman problem

✍ Kabekode V.S. Bhat 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 774 KB

A heuristic algorithm for traveling sale

A heuristic algorithm for traveling salesman problems

✍ Said Ashour; J.F. Vega; R.G. Parker 📂 Article 📅 1972 🏛 Elsevier Science ⚖ 685 KB

A tabu search heuristic for the undirect

A tabu search heuristic for the undirected selective travelling salesman problem

✍ Michel Gendreau; Gilbert Laporte; Frédéric Semet 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 677 KB

The undirected Selective Travelling Salesman Problem (STSP) is defined on a graph G= ( V, E) with positive profits associated with vertices, and distances associated with edges. The STSP consists of determining a maximal profit Hamiltonian cycle over a subset of V whose length does not exceed a pres