Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints

DOI10.1007/s10479-011-0969-1zbMath1269.90062OpenAlexW1977277162MaRDI QIDQ1761747

Mustafa Esen, Aykut Ahlatçıoğu, Michael R. Bussieck

Publication date: 15 November 2012

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

Full work available at URL: https://doi.org/10.1007/s10479-011-0969-1

zbMATH Keywords

nonlinear integer programmingrelaxationboundsconvex hullSDPCHRGQAPQCR

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30)

Related Items

Dantzig-Wolfe reformulations for binary quadratic problems, Quadratic Convex Reformulations for Semicontinuous Quadratic Programming, Quadratic convex reformulation for quadratic programming with linear on-off constraints

Cites Work

• Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
• Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
• Lagrangean decomposition for integer nonlinear programming with linear constraints
• Lagrangean relaxation. (With comments and rejoinder).
• Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
• Restricted simplicial decomposition: Computation and extensions
• Simplicial decomposition in nonlinear programming algorithms
• Unnamed Item
• Unnamed Item