Parametric-objective integer programming using knapsack facets and Gomory cutting planes (Q579128): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:27, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parametric-objective integer programming using knapsack facets and Gomory cutting planes |
scientific article |
Statements
Parametric-objective integer programming using knapsack facets and Gomory cutting planes (English)
0 references
1987
0 references
A method for solving parametric integer programs is presented. Fixed integer programs are solved using knapsack facets or a cutting plane algorithm and their number is minimized by post-optimal analysis and re- optimization. Computational results are given.
0 references
parametric integer programs
0 references
knapsack facets
0 references
cutting plane
0 references
post-optimal analysis
0 references
re-optimization
0 references
Computational results
0 references
