Extending the QCR method to general mixed-integer programs
From MaRDI portal
Recommendations
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- An efficient compact quadratic convex reformulation for general integer quadratic programs
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
Cites work
- 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
- Aggregate line capacity design for PWB assembly systems
- An algorithmic framework for convex mixed integer nonlinear programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Constrained 0-1 quadratic programming: basic approaches and extensions
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- CSDP, A C library for semidefinite programming
- Deterministic global optimization in nonlinear optimal control problems
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- Dynamic programming algorithms for the optimal cutting of equal rectangles
- Essays and Surveys in Global Optimization
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization. From theory to implementation.
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3335677 (Why is no real title available?)
- 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
- Partial Lagrangian relaxation for general quadratic programming
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs.
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
Cited in
(52)- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint
- Quadratic convex reformulation for quadratic programming with linear on-off constraints
- Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints
- Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs
- An efficient compact quadratic convex reformulation for general integer quadratic programs
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- Compact mixed-integer programming formulations in quadratic optimization
- Dantzig-Wolfe reformulations for binary quadratic problems
- The p-Lagrangian relaxation for separable nonconvex MIQCQP problems
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- Valid inequalities for quadratic optimisation with domain 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
- A binarisation heuristic for non-convex quadratic programming with box constraints
- Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem
- Parametric convex quadratic relaxation of the quadratic knapsack problem
- On the separation of split inequalities for non-convex quadratic integer programming
- Mathematical optimization ideas for biodiversity conservation
- Linear transformation based solution methods for non-convex mixed integer quadratic programs
- SDP-based branch-and-bound for non-convex quadratic integer optimization
- 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
- A trust-region-based derivative free algorithm for mixed integer programming
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds
- Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming
- Exact solution methods for the k-item quadratic knapsack problem
- Ellipsoid bounds for convex quadratic integer programming
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
- New reformulations for probabilistically constrained quadratic programs
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- Generating cutting planes for the semidefinite relaxation of quadratic programs
- Reconstructing convex matrices by integer programming approaches
- Global solution of non-convex quadratically constrained quadratic programs
- Convex MIQP reformulations for semi-continuous quadratic programming with low price
- The random QUBO
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
- Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
- Quadratic convex reformulations for semicontinuous quadratic programming
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
- Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
- 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
- Using general triangle inequalities within quadratic convex reformulation method
- Nonconvex quadratic reformulations and solvable conditions for mixed integer quadratic programming problems
- A tight compact quadratically constrained convex relaxation of the optimal power flow problem
- Using quadratic cuts to iteratively strengthen convexifications of box quadratic programs
- Quadratic convex reformulations for a class of complex quadratic programming problems
- Quadratic convex reformulations for multiobjective binary quadratic programming
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
- Quadratic convex reformulations for quadratic 0-1 programming
This page was built for publication: Extending the QCR method to general mixed-integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q662304)
