Integer Linear Programming: A Study in Computational Efficiency
From MaRDI portal
Publication:5560097
DOI10.1287/mnsc.15.9.481zbMath0172.22302OpenAlexW1967508804MaRDI QIDQ5560097
Charles A. Jun. Trauth, R. E. D. Woolsey
Publication date: 1969
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.15.9.481
Related Items
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, A note on the solution of group knapsack problems, Minimal covering problem and PLA minimization, Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben, Unnamed Item, Resolution of the 0–1 knapsack problem: Comparison of methods, The multidimensional 0-1 knapsack problem: an overview., Classical cuts for mixed-integer programming and branch-and-cut, An intelligent algorithm for mixed-integer programming models, A computational comparison of Gomory and knapsack cuts, Large-scale 0-1 linear programming on distributed workstations, Gomory cuts revisited, Alternative group relaxation of integer programming problems, An implicit branch-and-bound algorithm for mixed-integer linear programming
