An efficient data structure for branch-and-bound algorithm (Q558042)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2184176
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient data structure for branch-and-bound algorithm |
scientific article; zbMATH DE number 2184176 |
Statements
An efficient data structure for branch-and-bound algorithm (English)
0 references
30 June 2005
0 references
Branch-and-bound
0 references
Priority queue
0 references
Combinatorial optimization
0 references
Complexity
0 references
0.7474149465560913
0 references
0.7370867133140564
0 references
0.7300388216972351
0 references
