An advanced dual algorithm with constraint relaxation for all-integer programming
From MaRDI portal
Publication:3671759
DOI10.1002/nav.3800300110zbMath0521.90079OpenAlexW2062643516MaRDI QIDQ3671759
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
branch and boundcomputational experiencebinding constraintsallocation problemsfixed-charge problemsconstraint relaxationadvanced dual algorithmall-integer cutting plane algorithmreduced advanced start algorithm
Related Items (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 ⋮ 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 intelligent algorithm for mixed-integer programming models ⋮ An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem ⋮ An implicit branch-and-bound algorithm for mixed-integer linear programming
Cites Work
This page was built for publication: An advanced dual algorithm with constraint relaxation for all-integer programming
