One-pass heuristics for large-scale unconstrained binary quadratic problems
From MaRDI portal
Publication:1600836
DOI10.1016/S0377-2217(01)00209-0zbMath1030.90074OpenAlexW2009260807MaRDI QIDQ1600836
César Rego, Fred Glover, Bahram Alidaee, Gary A. Kochenberger
Publication date: 16 June 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00209-0
Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Metaheuristic Algorithms, A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference, Carousel greedy: a generalized greedy algorithm with applications in optimization, A hybrid metaheuristic approach to solving the UBQP problem, The unconstrained binary quadratic programming problem: a survey, A column generation approach for the unconstrained binary quadratic programming problem, Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY, A new approach for modeling and solving set packing problems, A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO), A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs, Quadratic reformulations of nonlinear binary optimization problems, Efficient branch-and-bound algorithms for weighted MAX-2-SAT, Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem, Pseudo-Boolean optimization, Using \(xQx\) to model and solve the uncapacitated task allocation problem, Generalized roof duality, Global equilibrium search applied to the unconstrained binary quadratic optimization problem, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models, A global continuation algorithm for solving binary quadratic programming problems, An unconstrained quadratic binary programming approach to the vertex coloring problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function
- The maximum clique problem
- A quadratic assignment formulation of the molecular conformation problem
- An evolutionary heuristic for quadratic 0-1 programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- On the notion of balance of a signed graph
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- Quadratic knapsack problems
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- A Decomposition Method for Quadratic Zero-One Programming
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- A branch and bound algorithm for the maximum clique problem
