Decomposing finitely generated integral monoids by elimination (Q1175279): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The value function of an integer program / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Abstract Linear Duality Model / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hermite Normal Form Computation Using Modulo Determinant Arithmetic / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new polynomial-time algorithm for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Weyl-minkowski duality for integarl monoids<sup>*</sup> / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fourier-Motzkin elimination extension to integer programming problems / rank | |||
Normal rank | |||
Latest revision as of 09:45, 15 May 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
