An efficient data structure for branch-and-bound algorithm
type: Item
instance of: scholarly article
title: An efficient data structure for branch-and-bound algorithm
zbMATH Open document ID: 1094.68550
author: Jigang Wu
author: Thambipillai Srikanthan
published in: Information Sciences
publication date: 2005-06-30T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 2184176
zbMATH Keywords: Branch-and-bound
zbMATH Keywords: Priority queue
zbMATH Keywords: Combinatorial optimization
zbMATH Keywords: Complexity
describes a project that uses: heapsort
MaRDI profile type: Publication
Wikidata QID: Q58210212
full work available at URL: j.ins.2003.12.008
OpenAlex ID: W2082472868
cites work: Branch-and-Bound Methods: A Survey
cites work: Parallel Branch-and-Branch Algorithms: Survey and Synthesis
cites work: Q5585020
cites work: Q3816955
cites work: Heaps on Heaps
cites work: Heaps with bits
cites work: Available stabilizing heaps
cites work: General branch and bound, and its relation to \(A^*\) and \(AO^*\)
cites work: Performance of parallel branch-and-bound algorithms
DBLP publication ID: journals/isci/JigangS04
DOI: 10.1016/J.INS.2003.12.008
description: scientific article; zbMATH DE number 2184176