Technical Note—An Improved Branch-and-Bound Method for Integer Programming

DOI10.1287/opre.19.4.1070zbMath0219.90034OpenAlexW2158503982MaRDI QIDQ5624983

No author found.

Publication date: 1971

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

Full work available at URL: https://doi.org/10.1287/opre.19.4.1070

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

A heuristic for multiple choice programming, An improved enumeration for pure 0-1 programs, Links between linear bilevel and mixed 0-1 programming problems, Faster integer-feasibility in mixed-integer linear programs by branching to force change, Parametric integer linear programming: A synthesis of branch and bound with cutting planes, Conflict graphs in solving integer programming problems, Valid integer polytope (VIP) penalties for branch-and-bound enumeration, Unnamed Item, An improved branch and bound algorithm for minimum concave cost network flow problems, Some computationally relevant group theoretic structures of fixed charge problems, Unnamed Item, Active-constraint variable ordering for faster feasibility of mixed integer linear programs, The transportation problem with exclusionary side constraints and two branch-and-bound algorithms, Penalty computations for the set partitioning problem, Trivial integer programs unsolvable by branch-and-bound, Facility location models for distribution planning