An advanced start algorithm for all-integer programming

DOI10.1016/0305-0548(85)90029-2zbMath0608.90072OpenAlexW1981191225MaRDI QIDQ1086158

Michael E. Hanna, Larry M. Austin

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)90029-2

zbMATH Keywords

computational resultsLP relaxationAdvanced Start Algorithmall-integer cutting plane techniquetwo-stage dual/primal algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (4)

Solution approaches for highly primal- and dual-degenerate all-integer programming problems ⋮ The mixed cutting plane algorithm for all-integer programming ⋮ An intelligent algorithm for mixed-integer programming models ⋮ An implicit branch-and-bound algorithm for mixed-integer linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Outline of an algorithm for integer solutions to linear programs
• A bounded dual (all-integer) integer programming algorithm with an objective cut
• A primal-dual cutting-plane algorithm for all-integer programming
• A Simplified Primal (All-Integer) Integer Programming Algorithm
• Integer Linear Programming: A Study in Computational Efficiency

This page was built for publication: An advanced start algorithm for all-integer programming