An implicit branch-and-bound algorithm for mixed-integer linear programming

DOI10.1016/0305-0548(90)90050-HMaRDI QIDQ804472zbMATH OpenOpenAlexFDO

Authors Youling Lin, Larry M. Austin, James R. Burns

Publication date 1990

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

Full work available at URL https://doi.org/10.1016/0305-0548(90)90050-h

zbMATH Keywords

branch-and-bound

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mixed integer programming (90C11)

Recommendations

• An improved branch and bound algorithm for mixed integer nonlinear programs
• A branch and bound method for the solution of multiparametric mixed integer linear programming problems
• Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
• A branch-and-bound algorithm for 0-1 parametric mixed integer programming
• A branch-and-cut algorithm for mixed-integer bilinear programming
• A new bounding technique in branch-and-bound algorithms for mixed integer programming
• scientific article; zbMATH DE number 1488891
• A branch and bound algorithm for mixed zero-one multiple objective linear programming
• A branch and bound algorithm for solving a class of nonlinear integer programming problems

Cites work

• scientific article; zbMATH DE number 3912096 (Why is no real title available?)
• scientific article; zbMATH DE number 4045470 (Why is no real title available?)
• A Simplified Primal (All-Integer) Integer Programming Algorithm
• A primal-dual cutting-plane algorithm for all-integer programming
• A tree-search algorithm for mixed integer programming problems
• An Automatic Method of Solving Discrete Programming Problems
• An advanced dual algorithm with constraint relaxation for all-integer programming
• An advanced start algorithm for all-integer programming
• Integer Linear Programming: A Study in Computational Efficiency
• Outline of an algorithm for integer solutions to linear programs
• The mixed cutting plane algorithm for all-integer programming

Cited in

(14)

• A new bounding technique in branch-and-bound algorithms for mixed integer programming
• Solving a problem of the choice of products by means of the branch and bound method
• scientific article; zbMATH DE number 1406243 (Why is no real title available?)
• scientific article; zbMATH DE number 4018774 (Why is no real title available?)
• An improved branch and bound algorithm for mixed integer nonlinear programs
• Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System
• A combinatorial branch-and-bound algorithm for box search
• Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
• A new global approach for \(0\)-\(1\) polynomial programs
• A global approach for general 0-1 fractional programming
• An approximate method for local optima for nonlinear mixed integer programming problems
• An intelligent algorithm for mixed-integer programming models
• A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
• The reduced cost branch and bound algorithm for mixed integer programming

This page was built for publication: An implicit branch-and-bound algorithm for mixed-integer linear programming

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