A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
From MaRDI portal
Publication:683935
DOI10.1007/s11590-017-1125-xzbMath1392.90087OpenAlexW2592016972MaRDI QIDQ683935
Nan Kong, Zhen Zhu, Wei-An Chen
Publication date: 9 February 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-017-1125-x
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- A hybrid metaheuristic approach to solving the UBQP problem
- An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems
- Pseudo-Boolean optimization
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack 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
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Linear programming for the \(0-1\) quadratic knapsack problem
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- The maximum clique problem
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- A new upper bound for the 0-1 quadratic knapsack problem
- An evolutionary heuristic for quadratic 0-1 programming
- A simple recipe for concise mixed 0-1 linearizations
- A new exact discrete linear reformulation of the quadratic assignment problem
- Parametric Lagrangian dual for the binary quadratic programming problem
- Linear forms of nonlinear expressions: new insights on old ideas
- Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique
- Graph separation techniques for quadratic zero-one programming
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem
- Semidefinite Approximation for Mixed Binary Quadratically Constrained Quadratic Programs
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Quadratic knapsack problems
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Minimum cuts and related problems
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- Construction of test problems in quadratic bivalent programming
- Validation of subgradient optimization
- A Decomposition Method for Quadratic Zero-One Programming
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
This page was built for publication: A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
