Greedy Randomized Adaptive Search Procedures For The Steiner Problem In Graphs (1999)
Cached
Download Links
| Venue: | QUADRATIC ASSIGNMENT AND RELATED PROBLEMS, VOLUME 16 OF DIMACS SERIES ON DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE |
| Citations: | 90 - 29 self |
BibTeX
@INPROCEEDINGS{Martins99greedyrandomized,
author = {Simone L. Martins and Panos M. Pardalos and Mauricio G. C. Resende and Celso C. Ribeiro},
title = {Greedy Randomized Adaptive Search Procedures For The Steiner Problem In Graphs},
booktitle = {QUADRATIC ASSIGNMENT AND RELATED PROBLEMS, VOLUME 16 OF DIMACS SERIES ON DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE},
year = {1999},
pages = {237--261},
publisher = {American Mathematical Society}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe four versions of a Greedy Randomized Adaptive Search Procedure (GRASP) for finding approximate solutions of general instances of the Steiner Problem in Graphs. Di#erent construction and local search algorithms are presented. Preliminary computational results with one of the versions on a variety of test problems are reported. On the majority of instances from the OR-Library, a set of standard test problems, the GRASP produced optimal solutions. On those that optimal solutions were not found, the GRASP found good quality approximate solutions.
