✦ LIBER ✦

Local search with perturbations for the prize-collecting Steiner tree problem in graphs

✍ Scribed by S. A. Canuto; M. G. C. Resende; C. C. Ribeiro

Publisher: John Wiley and Sons
Year: 2001
Tongue: English
Weight: 156 KB
Volume: 38
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.1023

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

The pilot method: A strategy for heurist

The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs

✍ Duin, Cees; Vo�, Stefan 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB 👁 2 views

As a metaheuristic to obtain solutions of enhanced quality, we formulate the so-called pilot method. It is a tempered greedy method that is to avoid the greedy trap by looking ahead for each possible choice (memorizing the best result). Repeatedly, a so-called master solution is modified, each time