A binarisation heuristic for non-convex quadratic programming with box constraints
From MaRDI portal
Publication:2294229
DOI10.1016/j.orl.2018.08.005zbMath1476.90255OpenAlexW2889300168MaRDI QIDQ2294229
Adam N. Letchford, Laura Galli
Publication date: 10 February 2020
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/127082/1/qpb_binarise.pdf
Integer programming (90C10) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A direct active set algorithm for large sparse quadratic programs with simple bounds
- Extending the QCR method to general mixed-integer programs
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Some simplified NP-complete graph problems
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- Second-order cone programming
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A polyhedral study of nonconvex quadratic programs with box constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- On convex relaxations for quadratically constrained quadratic programming
- DC programming: overview.
- Computable representations for convex hulls of low-dimensional quadratic forms
- Solving Mixed Integer Bilinear Problems Using MILP Formulations
- A Polytope for a Product of Real Linear Functions in 0/1 Variables
- On Nonconvex Quadratic Programming with Box Constraints
- Matheuristics
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- Geometry of cuts and metrics
