A bounded dual (all-integer) integer programming algorithm with an objective cut

DOI10.1002/nav.3800300208zbMath0533.90063OpenAlexW2126369429MaRDI QIDQ3316963

Michael E. Hanna, Larry M. Austin

Publication date: 1983

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800300208

zbMATH Keywords

convergence analysiscomparison of algorithmsComputational testsall integer cutting plane algorithmintegral upper bounds

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 ⋮ An advanced start algorithm for all-integer programming ⋮ A surrogate cutting plane algorithm for all-integer programming ⋮ The mixed cutting plane algorithm for all-integer programming

Cites Work

• A primal (all-integer) integer programming algorithm
• Unnamed Item
• Unnamed Item

This page was built for publication: A bounded dual (all-integer) integer programming algorithm with an objective cut