A simple, all primal branch and bound approach to pure and mixed integer binary programs

DOI10.1016/0167-6377(82)90036-0zbMath0504.90049OpenAlexW2004980487MaRDI QIDQ1835845

Victor H. Richard, Gary A. Kochenberger

Publication date: 1982

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(82)90036-0

zbMATH Keywords

branch-and-boundcomputational experienceprimal feasibility preservation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Boolean programming (90C09)

Related Items (1)

Algorithms for solving the mixed integer two-level linear programming problem

Cites Work

• Investigation of some branch and bound strategies for the solution of mixed integer linear programs
• Unnamed Item

This page was built for publication: A simple, all primal branch and bound approach to pure and mixed integer binary programs