论文信息 - Some Basis Theorems for Integral Monoids

Some Basis Theorems for Integral Monoids

We consider sets of integer vectors containing the zero vector and closed under addition, the integral monoids, and provide conditions under which they contain a finite subset of integer vectors which generate the entire monoid as nonnegative integer combinations. The paper concludes with some applications to the theory of integer programming.

Robert G. Jeroslow | R. Jeroslow

[1] Henry J. Stephen Smith,et al. XV. On systems of linear indeterminate equations and congruences , 1861, Philosophical Transactions of the Royal Society of London.

[2] G. H. Bradley. Equivalent Integer Programs and Canonical Problems , 1971 .

[3] Toshimde Ibaraki. Integer programming formulation of combinatorial optimization problems , 1976, Discret. Math..

[4] R. Gomory. Some polyhedra related to combinatorial problems , 1969 .

[5] Robert R. Meyer,et al. On the existence of optimal solutions to integer and mixed-integer programming problems , 1974, Math. Program..

[6] R. Meyer. Integer and mixed-integer programming models: General properties , 1975 .

[8] J. Stoer,et al. Convexity and Optimization in Finite Dimensions I , 1970 .

[9] Jack E. Graver,et al. On the foundations of linear and integer linear programming I , 1975, Math. Program..

[10] Ellis L. Johnson. On the group problem for mixed integer programming , 1974 .

[11] M. Padberg. Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach , 1972 .