Structured linear reformulation of binary quadratically constrained quadratic programs
From MaRDI portal
Publication:2174904
DOI10.1007/s11590-018-1361-8zbMath1442.90137OpenAlexW2900680900MaRDI QIDQ2174904
Qi An, Shu-Cherng Fang, Tiantian Nie, Shan Jiang
Publication date: 27 April 2020
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-018-1361-8
quadratically constrained quadratic programbinary program0--1 mixed integer linear programlinear reformulation
Related Items (1)
Uses Software
Cites Work
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- The unconstrained binary quadratic programming problem: a survey
- A new linearization technique for multi-quadratic 0-1 programming problems.
- A survey for the quadratic assignment problem
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- The quadratic knapsack problem -- a survey
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes
- Seizure warning algorithm based on optimization and nonlinear dynamics
- A simple recipe for concise mixed 0-1 linearizations
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs
- Linear forms of nonlinear expressions: new insights on old ideas
- An improved linearization strategy for zero-one quadratic programming problems
- On linear conic relaxation of discrete quadratic programs
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
This page was built for publication: Structured linear reformulation of binary quadratically constrained quadratic programs