Structured linear reformulation of binary quadratically constrained quadratic programs
From MaRDI portal
Publication:2174904
Recommendations
- Linear Reformulations of Integer Quadratic Programs
- Convex reformulation for binary quadratic programming problems via average objective value maximization
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
- Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming
- Dantzig-Wolfe reformulations for binary quadratic problems
Cites work
- A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs
- A new linearization technique for multi-quadratic 0-1 programming problems.
- A simple recipe for concise mixed 0-1 linearizations
- A survey for the quadratic assignment problem
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- An improved linearization strategy for zero-one quadratic programming problems
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Linear forms of nonlinear expressions: new insights on old ideas
- Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes
- On linear conic relaxation of discrete quadratic programs
- Seizure warning algorithm based on optimization and nonlinear dynamics
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The quadratic knapsack problem -- a survey
- The unconstrained binary quadratic programming problem: a survey
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
Cited in
(9)- Compact linearization for binary quadratic problems subject to assignment constraints
- Convex reformulation for binary quadratic programming problems via average objective value maximization
- Dantzig-Wolfe reformulations for binary quadratic problems
- Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming
- Linear Reformulations of Integer Quadratic Programs
- A simplified completely positive reformulation for binary quadratic programs
- Sustainable two stage supply chain management: a quadratic optimization approach with a quadratic constraint
- A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
This page was built for publication: Structured linear reformulation of binary quadratically constrained quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174904)
