Equivalent Integer Programs and Canonical Problems

DOI10.1287/MNSC.17.5.354MaRDI QIDQ5615772zbMATH OpenOpenAlexFDO

Authors Gordon H. Bradley

Publication date 1971

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.17.5.354

Mathematics Subject Classification ID

Linear programming (90C05)

Cited in

(11)

• A duality property for the set of all feasible solutions to an integer program
• A canonical form for generalized linear constraints
• Aggregation of equations in integer programming
• A number theoretic reformulation and decomposition method for integer programming
• Transformation of integer programs to knapsack problems
• Coefficient reduction for inequalities in 0–1 variables
• Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations
• Generation of all integer points for given sets of linear inequalities
• An application of the Hermite normal form in integer programming
• Column basis reduction and decomposable knapsack problems
• Lattice based extended formulations for integer linear equality systems

This page was built for publication: Equivalent Integer Programs and Canonical Problems

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