A column generation approach for the unconstrained binary quadratic programming problem
From MaRDI portal
Publication:439327
DOI10.1016/j.ejor.2011.09.016zbMath1244.90178OpenAlexW2157261731MaRDI QIDQ439327
Geraldo Regis Mauri, Luiz Antonio Nogueira Lorena
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.09.016
Related Items (5)
Building an iterative heuristic solver for a quantum annealer ⋮ Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems ⋮ The unconstrained binary quadratic programming problem: a survey ⋮ Improved mathematical model and bounds for the crop rotation scheduling problem with adjacency constraints ⋮ A branch and price algorithm for single-machine completion time variance
Cites Work
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Complexity of uniqueness and local search in quadratic 0-1 programming
- On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- A new upper bound for the 0-1 quadratic knapsack problem
- Lagrangean/surrogate relaxation for generalized assignment problems
- Lagrangean relaxation with clusters for point-feature cartographic label placement problems
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem
- Decomposition and linearization for 0-1 quadratic programming
This page was built for publication: A column generation approach for the unconstrained binary quadratic programming problem
