A branch and bound algorithm for allocation problems in which constraint coefficients depend upon decision variables

DOI10.1002/nav.3800160202zbMath0175.17502OpenAlexW1511556604MaRDI QIDQ5563829

Publication date: 1969

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800160202

zbMATH Keywords

branch and bound algorithm allocation problems

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

Branch-and-Bound Methods: A Survey

This page was built for publication: A branch and bound algorithm for allocation problems in which constraint coefficients depend upon decision variables