An integral transformation for integer programming problems (Q1062628)
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: An integral transformation for integer programming problems |
scientific article; zbMATH DE number 3914091
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An integral transformation for integer programming problems |
scientific article; zbMATH DE number 3914091 |
Statements
An integral transformation for integer programming problems (English)
0 references
1985
0 references
It is shown that every integer programming problem can be transformed into an equivalent integer program with free variables in polynomial time. The transformation is advantageous because the equivalent problem it generates can be solved very easily in some restricted cases.
0 references
equivalent problem transformation
0 references
polynomial transformation procedure
0 references
free variables
0 references
0.9899694
0 references
0.91048276
0 references
0.89930624
0 references
0.8965639
0 references
0.8938052
0 references
0.8926906
0 references
0.8867037
0 references
