An efficient data structure for branch-and-bound algorithm

DOI10.1016/J.INS.2003.12.008MaRDI QIDQ558042zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jigang Wu, Thambipillai Srikanthan

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

ComplexityBranch-and-boundCombinatorial optimizationPriority queue

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1935510
• Multiple stack branch and bound
• scientific article; zbMATH DE number 1057779
• Simple approaches to parallel branch and bound
• Deterministic branch-and-bound on distributed memory machines

Cites work

• scientific article; zbMATH DE number 4088895 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Available stabilizing heaps
• Branch-and-Bound Methods: A Survey
• General branch and bound, and its relation to A^* and AO^*
• Heaps on Heaps
• Heaps with bits
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Performance of parallel branch-and-bound algorithms

Describes a project that uses

Uses Software

• heapsort

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q558042)