Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem

European Journal of Operational Research

Volumn 134, Issue 1, 2001, Pages 103-119

  Katayama, Kengo ^a   Narihisa, Hiroyuki ^a  

^a OKAYAMA UNIVERSITY OF SCIENCE   (Japan)

Author keywords

Heuristics; Large size problems; Local search; Simulated annealing; Unconstrained binary quadratic programming

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION MAKING; DECISION THEORY; GENETIC ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; SIMULATED ANNEALING;

BINARY QUADRATIC PROGRAMMING (BQP);

OPERATIONS RESEARCH;

EID: 0035480453     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(00)00242-3     Document Type: Article

References (25)

1. Simulated annealing
2. 0-1 Quadratic programming approach for the optimal solution of two scheduling problems
3. A simulated annealing for the unconstrained quadratic pseudo-Boolean function
4. Experiments in quadratic 0-1 programming
5. OR-Library: Distributing test problems by electronic mail
6. Minimization of a quadratic pseudo-Boolean function
7. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
8. Quadratic knapsack programs
9. Adaptive memory tabu search for binary quadratic programs
10. Solving quadratic (0,1)-problem by semidefinite programs and cutting planes
11. Some network flow problems solved with pseudo-Boolean programming
12. Solving large binary quadratic programming problems by effective genetic local search algorithm
13. An efficient heuristic procedure for partitioning graphs
14. Optimization by simulated annealing
15. Computer aided layout design
16. An effective heuristic algorithm for the traveling salesman problem
17. An evolutionary heuristic for quadratic 0-1 programming
18. An implicit enumeration algorithm for quadratic integer programming
19. Genetic algorithms for binary quadratic programming
20. Greedy and local search heuristics for unconstrained binary quadratic programming
21. Computational aspects of a branch and bound algorithm for quadratic zero-one programming
22. A branch and bound algorithm for the maximum clique problem
23. The maximum clique problem
24. A quadratic assignment formulation of the molecular conformation problem