✦ LIBER ✦

Diversification-driven tabu search for unconstrained binary quadratic problems

✍ Scribed by Fred Glover; Zhipeng Lü; Jin-Kao Hao

Publisher: Springer
Year: 2010
Tongue: English
Weight: 254 KB
Volume: 8
Category: Article
ISSN: 1619-4500
DOI: 10.1007/s10288-009-0115-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tabu search heuristic using genetic di

A tabu search heuristic using genetic diversification for the clustered traveling salesman problem

✍ Gilbert Laporte; Jean-Yves Potvin; Florence Quilleret 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 736 KB

The clustered traveling salesman problem is an extension of the classical traveling salesman problem where the set of vertices is partitioned into clusters. The objective is to find a least cost Hamiltonian Cycle such that the vertices of each cluster are visited contiguously and the clusters are vi

Comparative performance of tabu search a

Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem

✍ Gerald Paul 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 294 KB