Linear Reformulations of Integer Quadratic Programs

DOI10.1007/978-3-540-87477-5_5zbMath1160.90589OpenAlexW1557938034MaRDI QIDQ3627671

Sourour Elloumi, Amélie Lambert, Alain Billionnet

Publication date: 13 May 2009

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87477-5_5

zbMATH Keywords

integer programmingquadratic programminglinear reformulations

Mathematics Subject Classification ID

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

Related Items (6)

Exact quadratic convex reformulations of mixed-integer quadratically constrained problems ⋮ An efficient compact quadratic convex reformulation for general integer quadratic programs ⋮ Compact linearization for binary quadratic problems subject to assignment constraints ⋮ Global solution of non-convex quadratically constrained quadratic programs ⋮ An integer linear programming approach for a class of bilinear integer programs ⋮ On linear conic relaxation of discrete quadratic programs

Uses Software

• Mosel

Cites Work

• An efficient branch and bound algorithm to solve the quadratic integer programming problem
• 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
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs.

This page was built for publication: Linear Reformulations of Integer Quadratic Programs