An improved enumerative algorithm for solving quadratic zero-one programming

DOI10.1016/0377-2217(84)90054-7MaRDI QIDQ594766zbMATH OpenOpenAlexFDO

Authors Shi Hui Lu

Publication date 1984

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(84)90054-7

zbMATH Keywords

quadratic constraintsadditive penaltiesminimization of quadratic functiontighter bound

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Boolean programming (90C09)

Cites work

• scientific article; zbMATH DE number 3480381 (Why is no real title available?)
• scientific article; zbMATH DE number 3422199 (Why is no real title available?)
• Methods of Nonlinear 0-1 Programming

Cited in

(7)

• 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
• An algorithm for indefinite integer quadratic programming
• An exact penalty function approach for nonlinear integer programming problems
• Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
• Models and methods of solution of quadratic integer programming problems

This page was built for publication: An improved enumerative algorithm for solving quadratic zero-one programming

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