An algorithm for quadratic zero-one programs

DOI<527::AID-NAV3220370407>3.0.CO;2-P 10.1002/1520-6750(199008)37:4<527::AID-NAV3220370407>3.0.CO;2-PzbMath0709.90079OpenAlexW2054501360MaRDI QIDQ3494380

Ansuman Bagchi, Bahman Kalantani

Publication date: 1990

Full work available at URL: https://doi.org/10.1002/1520-6750(199008)37:4<527::aid-nav3220370407>3.0.co;2-p

zbMATH Keywords

branch-and-boundconvex envelopeequivalent convex problemquadratic 0-1 programs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (8)

Provable randomized rounding for minimum-similarity diversification ⋮ Mathematical Programming Models and Exact Algorithms ⋮ A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming ⋮ The unconstrained binary quadratic programming problem: a survey ⋮ An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach ⋮ Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method ⋮ Ranking in quadratic integer programming problems ⋮ Solving quadratic (0,1)-problems by semidefinite programs and cutting planes

This page was built for publication: An algorithm for quadratic zero-one programs