Valid inequalities for mixed 0-1 programs (Q1076609)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3954653
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Valid inequalities for mixed 0-1 programs |
scientific article; zbMATH DE number 3954653 |
Statements
Valid inequalities for mixed 0-1 programs (English)
0 references
1986
0 references
A class of valid linear inequalities and facets for the convex hull is derived for a typical region appearing in mixed 0-1 programs. To use these inequalities computationally, it is shown how one can find a most violated inequality by solving a series of parametric equality knapsack problems with multiple choice constraints.
0 references
valid linear inequalities
0 references
facets
0 references
convex hull
0 references
mixed 0-1 programs
0 references
most violated inequality
0 references
parametric equality knapsack problems
0 references
multiple choice constraints
0 references
0.8676387667655945
0 references
0.8451049327850342
0 references
0.8355118036270142
0 references
0.8330001831054688
0 references
0.8229251503944397
0 references
