Decomposition and linearization for 0-1 quadratic programming

DOI10.1023/A:1019236832495zbMath0990.90073OpenAlexW118871189MaRDI QIDQ5933830

Sourour Elloumi, Alain Faye, Eric Soutif

Publication date: 14 June 2001

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019236832495

zbMATH Keywords

linearizationmixed integer programmingLagrangian decompositionquadratic 0-1 programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Boolean programming (90C09)

Related Items (7)

Mathematical Programming Models and Exact Algorithms ⋮ A column generation approach for the unconstrained binary quadratic programming problem ⋮ An improved linearization technique for a class of quadratic 0-1 programming problems ⋮ Continuity of the optimal value function and optimal solutions of parametric mixed-integer quadratic programs ⋮ On the Quadratic Programming Approach for Hub Location Problems ⋮ Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 ⋮ A linearization framework for unconstrained quadratic (0-1) problems

This page was built for publication: Decomposition and linearization for 0-1 quadratic programming