Group Theoretic Algorithms for the Integer Programming Problem II: Extension to a General Algorithm
From MaRDI portal
Publication:5556191
DOI10.1287/opre.16.5.928zbMath0169.22401OpenAlexW2166136730MaRDI QIDQ5556191
Publication date: 1968
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.16.5.928
Related Items
Minimal covering problem and PLA minimization ⋮ A solution method for a knapsack problem and its variant ⋮ Shortest path algorithms for knapsack type problems ⋮ An extension of Hu's group minimization algorithm ⋮ Alternative group relaxation of integer programming problems