Greedy and local search heuristics for unconstrained binary quadratic programming

Journal of Heuristics

Volumn 8, Issue 2, 2002, Pages 197-213

  Merz, Peter ^a   Freisleben, Bernd ^a  

^a UNIVERSITY OF SIEGEN   (Germany)

Author keywords

Greedy heuristics; Local search; Unconstrained quadratic binary programming

Indexed keywords

COMPUTATIONAL COMPLEXITY; EVOLUTIONARY ALGORITHMS; MATRIX ALGEBRA; PROBLEM SOLVING; QUADRATIC PROGRAMMING; VECTORS;

COMBINATORIAL OPTIMIZATION; GREEDY HEURISTICS; LOCAL SEARCH ALGORITHMS; LOCAL SEARCH HEURISTIC; META HEURISTICS; UNCONSTRAINED BINARY QUADRATIC PROGRAMMING;

HEURISTIC METHODS;

EID: 0036496382     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1017912624016     Document Type: Article

References (33)

1. 0-1 quadratic programming approach for the optimal solution of two scheduling problems
2. A scatter search approach to unconstrained quadratic binary programs
3. Experiments in quadratic 0-1 programming
4. Differential greedy for the 0-1 equicut problem
5. OR-library: Distributing test problems by electronic mail
6. Heuristic algorithms for the unconstrained binary quadratic programming problem
7. Minimization of a quadratic pseudo-Boolean function
8. Quadratic knapsack problems
9. Adaptive memory tabu search for binary quadratic programs
10. Tabu search with critical event memory: An enhanced application for binary quadratic programs
11. Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
12. Some network flow problems solved with pseudo-Boolean programming
13. Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
14. Solving large binary quadratic programming problems by effective genetic local search algorithm
15. Towards a general theory of adaptive walks on rugged landscapes
16. An efficient heuristic procedure for partitioning graphs
17. Computer-aided layout design
18. Quadratic binary programming
19. An effective heuristic algorithm for the traveling salesman problem
20. An evolutionary heuristic for quadratic 0-1 programming
21. An implicit enumeration algorithm for quadratic integer programming
22. Memetic algorithms for combinatorial optimization problems: Fitness landscapes and effective search strategies
23. Genetic algorithms for binary quadratic programming
24. Fitness landscapes and memetic algorithm design
25. Fitness landscapes, memetic algorithms and greedy operators for graph bi-partitioning
26. On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms
27. Memetic algorithms: A short introduction
28. Computational aspects of a branch and bound algorithm for unconstrained quadratic zero-one programming
29. A branch and bound algorithm for the maximum clique problem
30. The maximum clique problem
31. A quadratic assignment formulation for the molecular conformation problem