An efficient method for obtaining sharp bounds for nonlinear boolean programming problems (Q4016776)
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: An efficient method for obtaining sharp bounds for nonlinear boolean programming problems |
scientific article; zbMATH DE number 89312
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient method for obtaining sharp bounds for nonlinear boolean programming problems |
scientific article; zbMATH DE number 89312 |
Statements
An efficient method for obtaining sharp bounds for nonlinear boolean programming problems (English)
0 references
16 January 1993
0 references
Lagrange duality
0 references
Boolean programming
0 references
quadratic equality constraints
0 references
branch and bound
0 references
0.8139241933822632
0 references
0.8036394715309143
0 references
0.7842792272567749
0 references
