The reduced cost branch and bound algorithm for mixed integer programming

DOI10.1016/0305-0548(85)90039-5zbMath0606.90098OpenAlexW1981350060MaRDI QIDQ1085067

R. Kipp Martin, Dennis J. Sweeney, Michael E. Doherty

Publication date: 1985

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(85)90039-5

zbMATH Keywords

branch and boundmixed integer programming

Mathematics Subject Classification ID

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

Related Items (1)

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

Uses Software

• LINDO

Cites Work

• Unnamed Item
• Unnamed Item
• Zero-one programming with many variables and few constraints
• An ideal column algorithm for integer programs with special ordered sets of variables
• An Algorithm for Large Zero-One Knapsack Problems
• Branch and Bound Methods for Multi-Item Scheduling
• Practical Solution of Large Mixed Integer Programming Problems with Umpire
• Experiments in mixed-integer linear programming using pseudo-costs
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• An integer programming approach to a class of combinatorial problems

This page was built for publication: The reduced cost branch and bound algorithm for mixed integer programming