An efficient compact quadratic convex reformulation for general integer quadratic programs
From MaRDI portal
Recommendations
- Extending the QCR method to general mixed-integer programs
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- 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
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A polyhedral branch-and-cut approach to global optimization
- A probabilistic heuristic for a computationally difficult set covering problem
- Aggregate line capacity design for PWB assembly systems
- An algorithm for the generalized quadratic assignment problem
- CSDP, A C library for semidefinite programming
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Deterministic global optimization in nonlinear optimal control problems
- Dynamic programming algorithms for the optimal cutting of equal rectangles
- Essays and Surveys in Global Optimization
- Extending the QCR method to general mixed-integer programs
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- GRASP with path-relinking for the generalized quadratic assignment problem
- Global optimization. From theory to implementation.
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Linear Reformulations of Integer Quadratic Programs
- Links between linear bilevel and mixed 0-1 programming problems
- 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.
Cited in
(10)- Extending the QCR method to general mixed-integer programs
- Ellipsoid bounds for convex quadratic integer programming
- Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
- QPLIB: a library of quadratic programming instances
- Quadratic convex reformulation for quadratic programming with linear on-off constraints
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
This page was built for publication: An efficient compact quadratic convex reformulation for general integer quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1938903)
