Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- 1 October 2001
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 134 (1) , 103-119
- https://doi.org/10.1016/s0377-2217(00)00242-3
Abstract
No abstract availableKeywords
Funding Information
- Yazaki Memorial Foundation for Science and Technology
- Ministry of Education, Culture, Sports, Science and Technology (12780247)
This publication has 19 references indexed in Scilit:
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planesMathematical Programming, 1998
- Simulated annealing for the unconstrained quadratic pseudo-Boolean functionEuropean Journal of Operational Research, 1998
- Adaptive Memory Tabu Search for Binary Quadratic ProgramsManagement Science, 1998
- Minimization of a quadratic pseudo-Boolean functionEuropean Journal of Operational Research, 1994
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problemsInternational Journal of Systems Science, 1994
- OR-Library: Distributing Test Problems by Electronic MailJournal of the Operational Research Society, 1990
- Experiments in quadratic 0–1 programmingMathematical Programming, 1989
- Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithmJournal of Optimization Theory and Applications, 1985
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970
- Some Network Flow Problems Solved with Pseudo-Boolean ProgrammingOperations Research, 1965