An efficient data structure for branch-and-bound algorithm

Authors:
Wu Jigang;Thambipillai Srikanthan
Affiliations:
Centre for High Performance Embedded Systems, School of Computer Engineering, Nanyang Technological University, Singapore 639798, Singapore;Centre for High Performance Embedded Systems, School of Computer Engineering, Nanyang Technological University, Singapore 639798, Singapore
Venue:
Information Sciences—Informatics and Computer Science: An International Journal
Year:
2004

Citing 7
Cited 0

General branch and bound, and its relation to A* and AO*

Artificial Intelligence
Heaps on heaps

SIAM Journal on Computing
Heaps with bits

Theoretical Computer Science
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Available stabilizing heaps

Information Processing Letters - Special issue in honor of Edsger W. Dijkstra
Handbook of Algorithms

Handbook of Algorithms
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

An efficient data structure called cube heap is presented in this paper to reduce both the time complexity and data movements of the branch-and-bound (B&B) algorithm. We show that the time complexity of B&B algorithm is reduced from O(m log log m + h log m) to O(m + h log h) and the number of the data movements is reduced from O(m log m) to O(m + h log h), where m is the number of the active nodes and h is the number of expanded nodes in the solution tree.