Decomposing finitely generated integral monoids by elimination (Q1175279): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:23, 29 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposing finitely generated integral monoids by elimination |
scientific article |
Statements
Decomposing finitely generated integral monoids by elimination (English)
0 references
25 June 1992
0 references
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.
0 references
integral monoid
0 references
