𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A tabu search heuristic for the quay crane scheduling problem

✍ Scribed by Marcello Sammarra; Jean-François Cordeau; Gilbert Laporte; M. Flavia Monaco

Book ID
106429543
Publisher
Springer US
Year
2007
Tongue
English
Weight
330 KB
Volume
10
Category
Article
ISSN
1094-6136

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