Improving branch-and-bound methods for discrete problems with Boolean variables (Q755318)
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 branch-and-bound methods for discrete problems with Boolean variables |
scientific article; zbMATH DE number 3650014
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improving branch-and-bound methods for discrete problems with Boolean variables |
scientific article; zbMATH DE number 3650014 |
Statements
Improving branch-and-bound methods for discrete problems with Boolean variables (English)
0 references
1978
0 references
branch-and-bound methods
0 references
algorithms
0 references
combinatorial problems with Boolean variables
0 references
efficiency
0 references
knapsack problem
0 references
linear programming
0 references
