Decomposing finitely generated integral monoids by elimination (Q1175279)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decomposing finitely generated integral monoids by elimination |
scientific article; zbMATH DE number 11292
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposing finitely generated integral monoids by elimination |
scientific article; zbMATH DE number 11292 |
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
