𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The comparison between the statistical heuristic search and A

✍ Scribed by Bo Zhang; Ling Zhang

Book ID
112947376
Publisher
Springer
Year
1989
Tongue
English
Weight
355 KB
Volume
4
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Heuristic concentration and Tabu search:
Heuristic concentration and Tabu search: A head to head comparison
✍ K.E. Rosing; C.S. ReVelle; E. Rolland; D.A. Schilling; J.R. Current πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 471 KB

Earlier this year two papers applying the metaheuristics Tabu search (TS) and Heuristic concentration (HC) to the pmedian problem were published in consecutive volumes of this journal. Here we apply the method of HC to some of the data sets which were used for computational experience in the paper o

Heuristic search for the stacking proble
Heuristic search for the stacking problem
✍ Rui Jorge Rei; JoΓ£o Pedro Pedroso πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 758 KB
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