𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A tabu search heuristic for the concentrator location problem

✍ Scribed by V.J.M.F Filho; R.D Galvão

Book ID
119579046
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
1006 KB
Volume
6
Category
Article
ISSN
0966-8349

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tabu search heuristic for the Steiner
A tabu search heuristic for the Steiner Tree Problem
✍ Gendreau, Michel; Larochelle, Jean-Francois; Sans�, Brunilde 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB 👁 2 views

The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has regained attention due to the introduction of new telecommunication technologies, such as ATM, since it appears as the inherent mathematical structure behind multicast communications. In this paper, we present a tabu se

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