On the supermodular knapsack problem
Mathematical Programming: Series A and B
A branch and bound algorithm for the maximum clique problem
Computers and Operations Research
A decomposition method for quadratic zero-one programming
Management Science
Computers and Operations Research
Adaptive Memory Tabu Search for Binary Quadratic Programs
Management Science
A scatter search approach to unconstrained quadratic binary programs
New ideas in optimization
Tabu search and finite convergence
Discrete Applied Mathematics
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Tabu Search
Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming
Journal of Heuristics
Discrete Applied Mathematics
Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)
Journal of Heuristics
Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
Discrete Applied Mathematics
Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
International Journal of Metaheuristics
Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
Discrete Optimization
| Hi-index | 0.00 |
The unconstrained binary quadratic minimization problem is known to be NP-hard and due to its computational challenge and application capability, it becomes more and more considered and involved by the recent research studies, including both exact and heuristic solution approaches. Our work is in line with what was suggested by Glover et al. (in Eur. J. Oper. Res. 137, 272---287, 2002) who proposed one pass heuristics as alternatives to the well-known Devour Digest Tidy-up procedure (DDT) of Boros et al. (in RRR 39-89, 1989). The "devour" step sets a term of the current representation to 0 or 1, and the "tidy-up" step substitutes the logical consequences derived from the "digest" step into the current quadratic function. We propose several versions of the DDT constructive heuristic based on the alternative representation of the quadratic function. We also present an efficient implementation of local search using one-flip and two-flip moves that simultaneously change the values of one or two binary variables. Computational experiments performed on instances up to 7000 variables show the efficiency of our implementation in terms of quality improvement and CPU use enhancement.