๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Breakout local search for the quadratic assignment problem

โœ Scribed by Una Benlic; Jin-Kao Hao

Book ID
119187071
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
637 KB
Volume
219
Category
Article
ISSN
0096-3003

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the quality of local search for the q
On the quality of local search for the quadratic assignment problem
โœ Eric Angel; Vassilis Zissimopoulos ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 573 KB

Local search is widely used to solve approximately NP-complete combinatorial optimization problems. But, little is known about quality of obtained local minima, for a given neighborhood. We concentrate on one of the most difficult optimization problems. the Quadratic Assignment Problem, and we give

Robust taboo search for the quadratic as
Robust taboo search for the quadratic assignment problem
โœ E. Taillard ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 635 KB

Taillard, E., Robust taboo search for the quadratic assignment problem, Parallel Computing 17 (1991) 443-455. An adaptation of taboo search to the quadratic assignment problem is discussed in this paper This adaptation is efficient and robust, requiring less complexity and fewer parameters than ear