An efficient compact quadratic convex reformulation for general integer quadratic programs

DOI10.1007/s10589-012-9474-yzbMath1267.90092OpenAlexW2039313577MaRDI QIDQ1938903

Sourour Elloumi, Alain Billionnet, Amélie Lambert

Publication date: 25 February 2013

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-012-9474-y

zbMATH Keywords

integer programmingquadratic programmingcomputational experimentsexact convex reformulation

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20)

Related Items (6)

Ellipsoid Bounds for Convex Quadratic Integer Programming ⋮ Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs ⋮ Quadratic convex reformulation for quadratic programming with linear on-off constraints ⋮ QPLIB: a library of quadratic programming instances ⋮ Decision Diagram Decomposition for Quadratically Constrained Binary Optimization ⋮ SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs

Uses Software

• BARON
• CSDP
• CPLEX

Cites Work

• Unnamed Item
• Extending the QCR method to general mixed-integer programs
• GRASP with path-relinking for the generalized quadratic assignment problem
• Global optimization. From theory to implementation.
• An algorithm for the generalized quadratic assignment problem
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
• A probabilistic heuristic for a computationally difficult set covering problem
• Links between linear bilevel and mixed 0-1 programming problems
• A polyhedral branch-and-cut approach to global optimization
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Perspective cuts for a class of convex 0-1 mixed integer programs
• Dynamic programming algorithms for the optimal cutting of equal rectangles
• Linear Reformulations of Integer Quadratic Programs
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• CSDP, A C library for semidefinite programming
• Aggregate line capacity design for PWB assembly systems
• 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: An efficient compact quadratic convex reformulation for general integer quadratic programs