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

DOI10.1016/0305-0548(90)90050-HzbMath0727.90058OpenAlexW2008600006MaRDI QIDQ804472

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

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) Mixed integer programming (90C11) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

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 new global approach for \(0\)-\(1\) polynomial programs

Cites Work

• Unnamed Item
• Unnamed Item
• An advanced start algorithm for all-integer programming
• The mixed cutting plane algorithm for all-integer programming
• Outline of an algorithm for integer solutions to linear programs
• An Automatic Method of Solving Discrete Programming Problems
• A primal-dual cutting-plane algorithm for all-integer programming
• An advanced dual algorithm with constraint relaxation for all-integer programming
• A tree-search algorithm for mixed integer programming problems
• A Simplified Primal (All-Integer) Integer Programming Algorithm
• Integer Linear Programming: A Study in Computational Efficiency