An efficient data structure for branch-and-bound algorithm

DOI10.1016/J.INS.2003.12.008zbMath1094.68550DBLPjournals/isci/JigangS04OpenAlexW2082472868WikidataQ58210212 ScholiaQ58210212MaRDI QIDQ558042

Thambipillai Srikanthan, Jigang Wu

Publication date: 30 June 2005

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2003.12.008

zbMATH Keywords

ComplexityCombinatorial optimizationBranch-and-boundPriority queue

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Data structures (68P05)

Uses Software

• heapsort

Cites Work

• Unnamed Item
• Unnamed Item
• Heaps with bits
• General branch and bound, and its relation to \(A^*\) and \(AO^*\)
• Available stabilizing heaps
• Performance of parallel branch-and-bound algorithms
• Heaps on Heaps
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Branch-and-Bound Methods: A Survey

This page was built for publication: An efficient data structure for branch-and-bound algorithm