Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem

E-ISSN： 1572-9338|131|1-4|259-282

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.131, Iss.1-4, 2004-10, pp. : 259-282

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Path Relinking with Multi-Start Tabu Search for the Quadratic Assignment Problem

International Journal of Swarm Intelligence Research (IJSIR), Vol. 2, Iss. 2, 2011-04 ,pp. : 52-70

IGI Global_journal

Access to resources Recommend Favorite

Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)

By Boros Endre Hammer Peter Tavares Gabriel

Journal of Heuristics, Vol. 13, Iss. 2, 2007-04 ,pp. : 99-132

Springer Publishing Company

Access to resources Recommend Favorite

Hybrid scatter tabu search for unconstrained global optimization

By Duarte Abraham

Annals of Operations Research, Vol. 183, Iss. 1, 2011-03 ,pp. : 95-123

Springer Publishing Company

Access to resources Recommend Favorite

A multi-start tabu search method for a single-machine scheduling problem with periodic maintenance and sequence-dependent set-up times

By Pacheco Joaquín Ángel-Bello Francisco Álvarez Ada

Journal of Scheduling, Vol. 16, Iss. 6, 2013-12 ,pp. : 661-673

Springer Publishing Company

Access to resources Recommend Favorite

An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem

By Kochenberger Gary Glover Fred Alidaee Bahram Rego Cesar

Annals of Operations Research, Vol. 139, Iss. 1, 2005-10 ,pp. : 229-241

Springer Publishing Company

Access to resources Recommend Favorite