𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finding optimal solutions to the graph partitioning problem with heuristic search

✍ Scribed by Ariel Felner

Publisher
Springer Netherlands
Year
2005
Tongue
English
Weight
369 KB
Volume
45
Category
Article
ISSN
1012-2443

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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