Efficient reformulation for 0-1 programs -- methods and computational results (Q1803672)
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: Efficient reformulation for 0-1 programs -- methods and computational results |
scientific article; zbMATH DE number 221651
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient reformulation for 0-1 programs -- methods and computational results |
scientific article; zbMATH DE number 221651 |
Statements
Efficient reformulation for 0-1 programs -- methods and computational results (English)
0 references
29 June 1993
0 references
Two general methods for the reformulation of 0-1 programs are given. The first one is for coefficient reduction and the second for lifting. They are used for classical 0-1 structures: knapsack constraints, pair of \(k\) constraints, clique and cover induced inequalities etc. Computational results are given.
0 references
cutting planes
0 references
capacity expansion
0 references
variable upper bounding constraints
0 references
maximal cliques
0 references
minimal covers
0 references
coefficient reduction
0 references
knapsack
0 references
clique and cover induced inequalities
0 references
0 references
0 references
0 references
0 references
