The reduced cost branch and bound algorithm for mixed integer programming

DOI10.1016/0305-0548(85)90039-5MaRDI QIDQ1085067zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming
• A branch and bound algorithm for solving separable convex integer programming problems
• An implicit branch-and-bound algorithm for mixed-integer linear programming
• Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program

Cites work

• scientific article; zbMATH DE number 3526452 (Why is no real title available?)
• scientific article; zbMATH DE number 3410784 (Why is no real title available?)
• An Algorithm for Large Zero-One Knapsack Problems
• An ideal column algorithm for integer programs with special ordered sets of variables
• An integer programming approach to a class of combinatorial problems
• Branch and Bound Methods for Multi-Item Scheduling
• Experiments in mixed-integer linear programming using pseudo-costs
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• Practical Solution of Large Mixed Integer Programming Problems with Umpire
• Zero-one programming with many variables and few constraints

Cited in

(6)

• Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
• Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming
• Algorithms for solving the mixed integer two-level linear programming problem
• An intelligent algorithm for mixed-integer programming models
• A possible way to reduce degeneracy in integer programming computations

Describes a project that uses

Uses Software

• LINDO

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

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