𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

✍ Scribed by Sanjeev Arora; Alan Frieze; Haim Kaplan


Publisher
Springer-Verlag
Year
2002
Tongue
English
Weight
308 KB
Volume
92
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


The pilot method: A strategy for heurist
✍ 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