Linear Reformulations of Integer Quadratic Programs

DOI10.1007/978-3-540-87477-5_5MaRDI QIDQ3627671zbMATH OpenOpenAlexFDO

Authors Alain Billionnet, Sourour Elloumi, Amélie Lambert

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

quadratic programminginteger programminglinear reformulations

Mathematics Subject Classification ID

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

Recommendations

• Structured linear reformulation of binary quadratically constrained quadratic programs
• ``Miniaturized linearizations for quadratic 0/1 problems
• Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
• A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
• A new linearization technique for multi-quadratic 0-1 programming problems.

Cites work

• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm
• An efficient branch and bound algorithm to solve the quadratic integer programming problem
• 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.

Cited in

(15)

• Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context
• scientific article; zbMATH DE number 5506108 (Why is no real title available?)
• Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
• Structured linear reformulation of binary quadratically constrained quadratic programs
• Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
• Efficient linear reformulations for binary polynomial optimization problems
• An efficient compact quadratic convex reformulation for general integer quadratic programs
• On linear conic relaxation of discrete quadratic programs
• Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
• Global solution of non-convex quadratically constrained quadratic programs
• Reduction of indefinite quadratic programs to bilinear programs
• An integer linear programming approach for a class of bilinear integer programs
• A linearization technique for quadratic integer programming with box constraint
• Compact linearization for binary quadratic problems subject to assignment constraints
• Inductive linearization for binary quadratic programs with linear constraints

Describes a project that uses

Uses Software

• Mosel

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3627671)