Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut (Q4025902)
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: Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut |
scientific article; zbMATH DE number 124252
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut |
scientific article; zbMATH DE number 124252 |
Statements
Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut (English)
0 references
18 February 1993
0 references
zero-one linear programming
0 references
detection of redundant rows
0 references
variable elimination
0 references
special-ordered-set constraints
0 references
branch-and-cut
0 references
preprocessing
0 references
0.88328075
0 references
0.87680113
0 references
0.87508106
0 references
0.86768377
0 references
0.86659807
0 references
0.8651804
0 references
0.8623396
0 references
0.85507584
0 references
