An algorithm for quadratic zero-one programs

DOI10.1002/1520-6750(199008)37:4%3C527::AID-NAV3220370407%3E3.0.CO;2-PMaRDI QIDQ3494380zbMATH OpenOpenAlexFDO

Authors Bahman Kalantani, Ansuman Bagchi

Publication date 1990

Full work available at URL https://doi.org/10.1002/1520-6750(199008)37:4%3C527::aid-nav3220370407%3E3.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) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Boolean programming (90C09)

Recommendations

• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
• Bivalent quadratic programming problem - A computational study
• QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm
• A Decomposition Method for Quadratic Zero-One Programming

Cited in

(20)

• scientific article; zbMATH DE number 4116303 (Why is no real title available?)
• Mathematical programming models and exact algorithms
• An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• The unconstrained binary quadratic programming problem: a survey
• A large population island framework for the unconstrained binary quadratic problem
• Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
• Complexity of uniqueness and local search in quadratic 0-1 programming
• Provable randomized rounding for minimum-similarity diversification
• A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
• scientific article; zbMATH DE number 1296790 (Why is no real title available?)
• A solvable class of quadratic 0-1 programming
• Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
• Graph separation techniques for quadratic zero-one programming
• A quadratic simplex algorithm for primal optimization over zero-one polytopes
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
• An algorithm for quadratic optimization with one quadratic constraint and bounds on the variables
• Bivalent quadratic programming problem - A computational study
• Ranking in quadratic integer programming problems

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

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