An advanced dual algorithm with constraint relaxation for all-integer programming

DOI10.1002/NAV.3800300110MaRDI QIDQ3671759zbMATH OpenOpenAlexFDO

Authors Larry M. Austin, Parviz Ghandforoush

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.3800300110

zbMATH Keywords

advanced dual algorithmall-integer cutting plane algorithmallocation problemsbinding constraintsbranch and boundcomputational experienceconstraint relaxationfixed-charge problemsreduced advanced start algorithm

Mathematics Subject Classification ID

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

Cited in

(8)

• Solution approaches for highly primal- and dual-degenerate all-integer programming problems
• A surrogate cutting plane algorithm for all-integer programming
• The mixed cutting plane algorithm for all-integer programming
• An intelligent algorithm for mixed-integer programming models
• An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem
• A computational study of an objective hyperplane search heuristic for the general integer linear programming problem
• Parametric formulation of the general integer linear programming problem
• An implicit branch-and-bound algorithm for mixed-integer linear programming

This page was built for publication: An advanced dual algorithm with constraint relaxation for all-integer programming

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