Integer Programming over a Finite Additive Group

DOI10.1137/0307015MaRDI QIDQ5592006zbMATH OpenOpenAlexFDO

Authors Fred Glover

Publication date 1969

Published in SIAM Journal on Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0307015

zbMATH Keywords

operations research

Cited in

(8)

• Testing integer knapsacks for feasibility
• A relation between the knapsack and group knapsack problems
• Genetic algorithms and tabu search: Hybrids for optimization
• Faces of the Gomory polyhedron for cyclic groups
• Compact LP bases for a class of IP problems
• Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization
• Aggregating diophantine equations
• Computational experience with a group theoretic integer programming algorithm

This page was built for publication: Integer Programming over a Finite Additive Group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5592006)