Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem

DOI10.1016/j.cor.2011.09.008zbMath1251.90284MaRDI 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

zbMATH Keywords

quadratic programming; column generation; Lagrangian decomposition

Mathematics Subject Classification ID

90C10: Integer programming

90C20: Quadratic programming

Related Items

The unconstrained binary quadratic programming problem: a survey, Multiple graph regularized nonnegative matrix factorization, Building an iterative heuristic solver for a quantum annealer, Improved mathematical model and bounds for the crop rotation scheduling problem with adjacency constraints

Uses Software

• Biq Mac

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