An Adaptive Group Theoretic Algorithm for Integer Programming Problems
From MaRDI portal
Publication:5635258
DOI10.1287/mnsc.17.5.285zbMath0227.90036OpenAlexW1980384444MaRDI QIDQ5635258
G. Anthony Gorry, Jeremy F. Shapiro
Publication date: 1971
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/46755
Related Items (10)
Solution approaches for highly primal- and dual-degenerate all-integer programming problems ⋮ Prediction with zero‐one loss structure ⋮ Computational experience with a group theoretic integer programming algorithm ⋮ Generalized dynamic programming methods in integer programming ⋮ Improved integer programming bounds using intersections of corner polyhedra ⋮ A solution method for a knapsack problem and its variant ⋮ An extension of Hu's group minimization algorithm ⋮ Cutting-plane theory: Algebraic methods ⋮ Alternative group relaxation of integer programming problems ⋮ A new storage reduction technique for the solution of the group problem
This page was built for publication: An Adaptive Group Theoretic Algorithm for Integer Programming Problems
