Technical Note—Generalized Covering Relaxation for 0-1 Programs (Q3893670): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:44, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Technical Note—Generalized Covering Relaxation for 0-1 Programs |
scientific article |
Statements
Technical Note—Generalized Covering Relaxation for 0-1 Programs (English)
0 references
1980
0 references
generalized covering relaxation
0 references
cutting-plane algorithm
0 references
0-1 polynomial programming
0 references
nested sequence of linear generalized covering problems
0 references
randomly generated problems
0 references
computational experience
0 references
