A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
From MaRDI portal
Recommendations
- Lagrangean decompositions for the unconstrained binary quadratic programming problem
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
- Lagrangean methods for 0-1 quadratic problems
- Decomposition and linearization for 0-1 quadratic programming
- Parametric Lagrangian dual for the binary quadratic programming problem
Cites work
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- A Decomposition Method for Quadratic Zero-One Programming
- A hybrid metaheuristic approach to solving the UBQP problem
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- A new exact discrete linear reformulation of the quadratic assignment problem
- A new upper bound for the 0-1 quadratic knapsack problem
- A simple recipe for concise mixed 0-1 linearizations
- Adaptive memory tabu search for binary quadratic programs
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems
- An evolutionary heuristic for quadratic 0-1 programming
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Construction of test problems in quadratic bivalent programming
- Graph separation techniques for quadratic zero-one programming
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 4112385 (Why is no real title available?)
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Linear forms of nonlinear expressions: new insights on old ideas
- Linear programming for the \(0-1\) quadratic knapsack problem
- Minimum cuts and related problems
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- Parametric Lagrangian dual for the binary quadratic programming problem
- Pseudo-Boolean optimization
- Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
- Quadratic binary programming models in computational biology
- Quadratic knapsack problems
- Semidefinite approximation for mixed binary quadratically constrained quadratic programs
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- The maximum clique problem
- Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Validation of subgradient optimization
- Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique
Cited in
(4)- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
- Parametric Lagrangian dual for the binary quadratic programming problem
- Lagrangean decompositions for the unconstrained binary quadratic programming problem
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem
This page was built for publication: A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683935)
