A Simplified Primal (All-Integer) Integer Programming Algorithm
From MaRDI portal
Publication:5540132
DOI10.1287/opre.16.4.750zbMath0157.50203OpenAlexW2087799931MaRDI QIDQ5540132
No author found.
Publication date: 1968
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.16.4.750
Related Items
Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben ⋮ 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 ⋮ Integral simplex using decomposition with primal cutting planes ⋮ New technique for solving primal all-integer linear programming ⋮ On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming ⋮ The eclectic primal algorithm: Cutting-plane method that accommodates hybrid subproblem solution techniques ⋮ Classical cuts for mixed-integer programming and branch-and-cut ⋮ Non-standard approaches to integer programming ⋮ Selected bibliography on degeneracy ⋮ An implicit branch-and-bound algorithm for mixed-integer linear programming ⋮ A primal-like algorithm for zero-one integer Fractional Programming Problem
This page was built for publication: A Simplified Primal (All-Integer) Integer Programming Algorithm
