Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
From MaRDI portal
Publication:1762145
DOI10.1016/j.cor.2011.09.008zbMath1251.90284OpenAlexW2024573003MaRDI QIDQ1762145
Geraldo Regis Mauri, Luiz Antonio Nogueira Lorena
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.09.008
Related Items (6)
Mathematical Programming Models and Exact Algorithms ⋮ Building an iterative heuristic solver for a quantum annealer ⋮ Multiple graph regularized nonnegative matrix factorization ⋮ The unconstrained binary quadratic programming problem: a survey ⋮ Improved mathematical model and bounds for the crop rotation scheduling problem with adjacency constraints ⋮ Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
Uses Software
Cites Work
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
- Minimization of a quadratic pseudo-Boolean function
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- Linear forms of nonlinear expressions: new insights on old ideas
- Lower bound improvement and forcing rule for quadratic binary programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Lagrangean decompositions for the unconstrained binary quadratic programming problem
- A Decomposition Method for Quadratic Zero-One Programming
This page was built for publication: Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
