Extending the QCR method to general mixed-integer programs
From MaRDI portal
Publication:662304
DOI10.1007/s10107-010-0381-7zbMath1235.90100OpenAlexW2142097077MaRDI QIDQ662304
Amélie Lambert, Alain Billionnet, Sourour Elloumi
Publication date: 22 February 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0381-7
quadratic programmingsemi-definite programmingexperimentsmixed-integer programmingconvex reformulationgeneral integer programming
Semidefinite programming (90C22) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (39)
Linear transformation based solution methods for non-convex mixed integer quadratic programs ⋮ Dantzig-Wolfe reformulations for binary quadratic problems ⋮ The Random QUBO ⋮ Exact quadratic convex reformulations of mixed-integer quadratically constrained problems ⋮ Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds ⋮ A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX ⋮ Generating cutting planes for the semidefinite relaxation of quadratic programs ⋮ The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems ⋮ Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming ⋮ Reconstructing convex matrices by integer programming approaches ⋮ SDP-based branch-and-bound for non-convex quadratic integer optimization ⋮ Quadratic Convex Reformulations for Semicontinuous Quadratic Programming ⋮ Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods ⋮ Ellipsoid Bounds for Convex Quadratic Integer Programming ⋮ An efficient compact quadratic convex reformulation for general integer quadratic programs ⋮ Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs ⋮ Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem ⋮ Using general triangle inequalities within quadratic convex reformulation method ⋮ Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints ⋮ A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs ⋮ Valid inequalities for quadratic optimisation with domain constraints ⋮ Global solution of non-convex quadratically constrained quadratic programs ⋮ Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint ⋮ Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization ⋮ Quadratic convex reformulation for quadratic programming with linear on-off constraints ⋮ A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation ⋮ A note on convex reformulation schemes for mixed integer quadratic programs ⋮ Intersection cuts for nonlinear integer programming: convexification techniques for structured sets ⋮ Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach ⋮ A trust-region-based derivative free algorithm for mixed integer programming ⋮ A binarisation heuristic for non-convex quadratic programming with box constraints ⋮ Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation ⋮ Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem ⋮ Exact Solution Methods for the k-Item Quadratic Knapsack Problem ⋮ Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners ⋮ Parametric convex quadratic relaxation of the quadratic knapsack problem ⋮ Compact mixed-integer programming formulations in quadratic optimization ⋮ On the separation of split inequalities for non-convex quadratic integer programming ⋮ Mathematical optimization ideas for biodiversity conservation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Global optimization. From theory to implementation.
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- An algorithmic framework for convex mixed integer nonlinear programs
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Constrained 0-1 quadratic programming: basic approaches and extensions
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Dynamic programming algorithms for the optimal cutting of equal rectangles
- Partial Lagrangian relaxation for general quadratic programming
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- CSDP, A C library for semidefinite programming
- Aggregate line capacity design for PWB assembly systems
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Essays and Surveys in Global Optimization
- Deterministic global optimization in nonlinear optimal control problems
- Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs.
This page was built for publication: Extending the QCR method to general mixed-integer programs
