Covering Relaxation for Positive 0-1 Polynomial Programs (Q3205016)
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: Covering Relaxation for Positive 0-1 Polynomial Programs |
scientific article; zbMATH DE number 3646635
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Covering Relaxation for Positive 0-1 Polynomial Programs |
scientific article; zbMATH DE number 3646635 |
Statements
Covering Relaxation for Positive 0-1 Polynomial Programs (English)
0 references
1979
0 references
polynomial constraint
0 references
non-negative coefficients
0 references
linear covering problem
0 references
cutting-plane algorithm
0 references
positive 0-1 polynomial program
0 references
implicit enumeration
0 references
relaxation
0 references
algorithmic performance
0 references
computational study
0 references
random test problems
0 references
