Decomposing finitely generated integral monoids by elimination
From MaRDI portal
A finitely generated integral monoid can be expressed as the set of right-hand sides for which a related integer programming problem is feasible. This paper shows that an integral monoid can always be decomposed into a finite set of integral monoids having a special structure in that their related integer programming feasibility problems can be solved in polynomial time.
Recommendations
- The structure of an integral monoid and integer programming feasibility
- Decomposition of integer programs and of generating sets
- scientific article; zbMATH DE number 1011070
- On finitely generated submonoids of \(\mathbb{N}^ k\)
- Integral decomposition of polyhedra and some applications in mixed integer programming
Cites work
- A new polynomial-time algorithm for linear programming
- An Abstract Linear Duality Model
- Fourier-Motzkin elimination extension to integer programming problems
- Hermite Normal Form Computation Using Modulo Determinant Arithmetic
- The value function of an integer program
- Weyl-minkowski duality for integarl monoids*
Cited in
(8)- Decomposition of strongly separative monoids
- Integer programming as projection
- The constraints of the group of an integral monoid
- The structure of an integral monoid and integer programming feasibility
- scientific article; zbMATH DE number 4125194 (Why is no real title available?)
- scientific article; zbMATH DE number 1011070 (Why is no real title available?)
- Mixed-integer linear representability, disjunctions, and Chvátal functions -- modeling implications
- Decomposition of integer programs and of generating sets
This page was built for publication: Decomposing finitely generated integral monoids by elimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1175279)
