On the public citation graph
Building a parallel branch and bound library
0 signed · 61 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-51687-5_40openalex-snapshot
Two strategies for solving the vertex cover problem on a transputer network
inferredcites →https://doi.org/10.1007/3-540-55895-0_450openalex-snapshot
A parallel best-first B & B with synchronization phases
inferredcites →https://doi.org/10.1007/3-540-58078-6_14openalex-snapshot
An efficient implementation of parallel A*
inferredcites →https://doi.org/10.1007/978-3-642-75771-6_23openalex-snapshot
Data Structures for Parallel Computation on Shared-Memory Machines
inferredcites →https://doi.org/10.1007/978-3-662-25209-3_19openalex-snapshot
Managing a Parallel Heap Efficiently
inferredcites →https://doi.org/10.1007/bf00128644openalex-snapshot
Parallel heap: An optimal parallel priority queue
inferredcites →https://doi.org/10.1007/bf00289064openalex-snapshot
Concurrent search and insertion in 2?3 trees
inferredcites →https://doi.org/10.1007/bf01379360openalex-snapshot
Parallel state-space search for a first solution with consistent linear speedups
inferredcites →https://doi.org/10.1007/bf01581188openalex-snapshot
A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
inferredcites →https://doi.org/10.1007/bf01840439openalex-snapshot
The pairing heap: A new form of self-adjusting heap
inferredcites →https://doi.org/10.1007/bf02023053openalex-snapshot
Large-scale 0–1 linear programming on distributed workstations
inferredcites →https://doi.org/10.1007/bf02073942openalex-snapshot
Branch-and-bound as a higher-order function
inferredcites →https://doi.org/10.1016/0004-3702(91)90100-xopenalex-snapshot
Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
inferredcites →https://doi.org/10.1016/0166-218x(94)00137-3openalex-snapshot
Performances of parallel branch and bound algorithms with best-first search
inferredcites →https://doi.org/10.1016/0166-218x(94)90014-0openalex-snapshot
A new exact algorithm for the solution of quadratic assignment problems
inferredcites →https://doi.org/10.1016/0167-7977(89)90023-3openalex-snapshot
Parallel computing in combinatorial optimization
inferredcites →https://doi.org/10.1016/0377-2217(88)90160-9openalex-snapshot
A parallel integer linear programming algorithm
inferredcites →https://doi.org/10.1016/0377-2217(91)90197-4openalex-snapshot
QAPLIB-A quadratic assignment problem library
inferredcites →https://doi.org/10.1016/0377-2217(93)e0334-topenalex-snapshot
A parallel depth first search branch and bound algorithm for the quadratic assignment problem
inferredcites →https://doi.org/10.1016/0377-2217(96)00009-4openalex-snapshot
Parallel processing for difficult combinatorial optimization problems
inferredcites →https://doi.org/10.1090/dimacs/016/13openalex-snapshot
Difficulties of exact methods for solving the quadratic assignment problem
inferredcites →https://doi.org/10.1109/spdp.1991.218255openalex-snapshot
An evaluation of concurrent priority queue algorithms
inferredcites →https://doi.org/10.1109/tc.1980.1675680openalex-snapshot
Concurrent Search and Insertion in AVL Trees
inferredcites →https://doi.org/10.1109/tc.1980.1675681openalex-snapshot
Distributed Enumeration on Between Computers
inferredcites →https://doi.org/10.1109/tc.1984.1676453openalex-snapshot
MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
inferredcites →https://doi.org/10.1137/0207026openalex-snapshot
Implementation and Analysis of Binomial Queue Algorithms
inferredcites →https://doi.org/10.1145/109025.109118openalex-snapshot
Analysis of scalability of parallel algorithms and architectures
inferredcites →https://doi.org/10.1145/22719.24067openalex-snapshot
DIB—a distributed implementation of backtracking
inferredcites →https://doi.org/10.1145/319628.319663openalex-snapshot
Efficient locking for concurrent operations on B-trees
inferredcites →https://doi.org/10.1145/320613.320619openalex-snapshot
Concurrent manipulation of binary search trees
inferredcites →https://doi.org/10.1145/358080.358103openalex-snapshot
Anomalies in parallel branch-and-bound algorithms
inferredcites →https://doi.org/10.1145/512274.512284openalex-snapshot
Algorithm 230: Matrix Permutation
inferredcites →https://doi.org/10.1145/5684.5686openalex-snapshot
An empirical comparison of priority-queue and event-set implementations
inferredcites →https://doi.org/10.1145/588011.588020openalex-snapshot
Concurrency control mechanisms and the serializability of concurrent tree algorithms
inferredcites →https://doi.org/10.1145/63047.63109openalex-snapshot
Branch-and-bound algorithms on a hypercube
inferredcites →https://doi.org/10.1145/63238.63249openalex-snapshot
Concurrent operations on priority queues
inferredcites →https://doi.org/10.1145/76263.76306openalex-snapshot
A dynamic scheduling strategy for the Chare-Kernel system
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470053928.ch10openalex-snapshot
MW: A Software Framework for Combinatorial Optimization on Computational Grids
inferred← citeshttps://doi.org/10.1007/0-387-22827-6_5openalex-snapshot
Parallel Algorithm Design for Branch and Bound
inferred← citeshttps://doi.org/10.1007/0-387-23529-9_21openalex-snapshot
Alps: A Framework for Implementing Parallel Tree Search Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45586-8_6openalex-snapshot
Branch, Cut, and Price: Sequential and Parallel
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_719openalex-snapshot
Parallel optimisation in the SCOOP library
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_8openalex-snapshot
Parallel Solvers for Mixed Integer Linear Optimization
inferred← citeshttps://doi.org/10.1007/s10107-003-0404-8openalex-snapshot
Parallel branch, cut, and price for large-scale discrete optimization
inferred← citeshttps://doi.org/10.1007/s12532-015-0087-1openalex-snapshot
PEBBL: an object-oriented framework for scalable parallel branch and bound
inferred← citeshttps://doi.org/10.1016/s0065-2458(06)68004-2openalex-snapshot
Computational Grand Challenges in Assembling the Tree of Life: Problems and Solutions
inferred← citeshttps://doi.org/10.1016/s0167-8191(03)00045-0openalex-snapshot
Parallel branch and cut for capacitated vehicle routing
inferred← citeshttps://doi.org/10.1016/s1570-579x(01)80014-8openalex-snapshot
Pico: An Object-Oriented Framework for Parallel Branch and Bound
inferred← citeshttps://doi.org/10.1023/a:1018952429396openalex-snapshot
On the best search strategy in parallel branch‐and‐bound:Best‐First Search versus Lazy Depth‐First Search
inferred← citeshttps://doi.org/10.1023/a:1018972901171openalex-snapshot
The parallel search bench ZRAM and its applications
inferred← citeshttps://doi.org/10.1023/b:supe.0000020179.55383.adopenalex-snapshot
A Library Hierarchy for Implementing Scalable Parallel Search Algorithms
inferred← citeshttps://doi.org/10.1109/icpp.2006.40openalex-snapshot
ExactMP: An Efficient Parallel Exact Solver for Phylogenetic Tree Reconstruction Using Maximum Parsimony
inferred← citeshttps://doi.org/10.1109/ipdps.2011.354openalex-snapshot
A Parallel Exact Solver for the Three-Index Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1109/ipdpsw.2019.00095openalex-snapshot
An Easy Way to Build Parallel State-of-the-art Combinatorial Optimization Problem Solvers: A Computational Study on Solving Steiner Tree Problems and Mixed Integer Semidefinite Programs by using ug[SCIP-*,*]-Libraries
inferred← citeshttps://doi.org/10.1109/ipps.1998.669935openalex-snapshot
Solving the maximum clique problem using PUBB
inferred← citeshttps://doi.org/10.1109/wetice.2009.26openalex-snapshot
Performance Evaluation of Grid-Enabled Code: A Case Study
inferred← citeshttps://doi.org/10.1287/ijoc.1090.0347openalex-snapshot
Computational Experience with a Software Framework for Parallel Integer Programming
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.