Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming (Q1366300)
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: Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming |
scientific article; zbMATH DE number 1059656
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming |
scientific article; zbMATH DE number 1059656 |
Statements
Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming (English)
0 references
23 October 1997
0 references
fractional surrogate constraint cuts
0 references
separation procedure
0 references
surrogate constraint analysis
0 references
strong valid inequalities
0 references
surrogate-knapsack
0 references
