𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Restricted neighborhood in the tabu search for the flowshop problem

✍ Scribed by Belarmino Adenso-Díaz

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
582 KB
Volume
62
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tabu search for the Steiner problem in g
Tabu search for the Steiner problem in graphs
✍ Celso C. Ribeiro; Maurício C. De Souza 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB 👁 2 views

Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum-weighted subgraph spanning a given subset of nodes (terminals) of the original graph. In this paper, we describe a tabu search algorithm for the Steiner problem in graphs, based o

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