Extensions of the Group Theoretic Approach in Integer Programming
From MaRDI portal
Publication:5650209
DOI10.1287/mnsc.18.1.74zbMath0239.90034OpenAlexW2020175029MaRDI QIDQ5650209
Publication date: 1971
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.18.1.74
Related Items
Generating functions and duality for integer programs, A number theoretic reformulation and decomposition method for integer programming, Coefficient reduction for inequalities in 0–1 variables, The b-hull of an integer program, Computational experience with a group theoretic integer programming algorithm, Integer programming, Barvinok's counting algorithm and Gomory relaxations., Generalized dynamic programming methods in integer programming, Improved integer programming bounds using intersections of corner polyhedra, On the facial structure of set packing polyhedra, On the lattice programming gap of the group problems, An extension of Hu's group minimization algorithm, The value function of a mixed integer program. II, Standard pairs and group relaxations in integer programming