Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem

@article{Palubeckis2004MultistartTS,
  title={Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem},
  author={Gintaras Palubeckis},
  journal={Annals OR},
  year={2004},
  volume={131},
  pages={259-282}
}
This paper describes and experimentally compares five rather different multistart tabu search strategies for the unconstrained binary quadratic optimization problem: a random restart procedure, an application of a deterministic heuristic to specially constructed subproblems, an application of a randomized procedure to the full problem, a constructive procedure using tabu search adaptive memory, and an approach based on solving perturbed problems. In the solution improvement phase a modification… CONTINUE READING
50 Citations
42 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 50 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 42 references

Genetic Algorithms for Binary Quadratic Programming.

  • B. Freisleben
  • gramming.” Management Science
  • 1999
Highly Influential
4 Excerpts

Binary Quadratic Problems.

  • F. Glover, G. A. Kochenberger, B. Alidaee
  • European Journal of Operational Research
  • 1998
Highly Influential
5 Excerpts

The Quadratic Assignment Problem: Theory and Algorithms

  • E. Çela
  • 1998
Highly Influential
4 Excerpts

Quadratic Programs.

  • F. Glover, M. Laguna
  • Management Science
  • 1997
Highly Influential
3 Excerpts

Boolean Methods in Operations Research

  • P. 330–332. Hammer, S. Rudeanu
  • Annals of Discrete Mathematics
  • 1968
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…