On the public citation graph
An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
0 signed · 29 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.1002/nav.3800180102openalex-snapshot
Tree-search algorithms for quadratic assignment problems
inferredcites →https://doi.org/10.1007/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1007/bf00998631openalex-snapshot
Theoretical comparisons of search strategies in branch-and-bound algorithms
inferredcites →https://doi.org/10.1007/bf01584070openalex-snapshot
The traveling-salesman problem and minimum spanning trees: Part II
inferredcites →https://doi.org/10.1109/proc.1981.12145openalex-snapshot
Principles of artificial intelligence
inferredcites →https://doi.org/10.1145/358080.358103openalex-snapshot
Anomalies in parallel branch-and-bound algorithms
inferredcites →https://doi.org/10.1287/mnsc.18.9.465openalex-snapshot
Integer Programming Algorithms: A Framework and State-of-the-Art Survey
inferredcites →https://doi.org/10.1287/opre.11.6.972openalex-snapshot
An Algorithm for the Traveling Salesman Problem
inferredcites →https://doi.org/10.1287/opre.13.3.400openalex-snapshot
Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems
inferredcites →https://doi.org/10.1287/opre.18.2.263openalex-snapshot
Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
inferredcites →https://doi.org/10.1287/opre.20.3.668openalex-snapshot
Solving Resource-Constrained Network Problems by Implicit Enumeration—Preemptive Case
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-50517-2_79openalex-snapshot
Superlinear speedup in parallel state-space search
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_56openalex-snapshot
Steiner Minimal Trees: An Introduction, Parallel Computation, and Future Work
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_13openalex-snapshot
Steiner Minimal Trees: An Introduction, Parallel Computation, and Future Work
inferred← citeshttps://doi.org/10.1007/bf00127829openalex-snapshot
Hypercube computing: Connected components
inferred← citeshttps://doi.org/10.1007/bf00155859openalex-snapshot
Computing biconnected components on a hypercube
inferred← citeshttps://doi.org/10.1007/bf02023053openalex-snapshot
Large-scale 0–1 linear programming on distributed workstations
inferred← citeshttps://doi.org/10.1007/bfb0027122openalex-snapshot
Parallel best-first branch- and-bound in discrete optimization: A framework
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00137-3openalex-snapshot
Performances of parallel branch and bound algorithms with best-first search
inferred← citeshttps://doi.org/10.1016/b978-0-444-81837-9.50015-4openalex-snapshot
Initialization of Parallel Branch-and-bound Algorithms
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.05.019openalex-snapshot
Solving combinatorial problems using a parallel framework
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00016-1openalex-snapshot
A distributed processing algorithm for solving integer programs using a cluster of workstations
inferred← citeshttps://doi.org/10.1109/12.48868openalex-snapshot
Analysis and implementation of branch-and-bound algorithms on a hypercube multicomputer
inferred← citeshttps://doi.org/10.1109/ftdcs.1988.26723openalex-snapshot
Hypercube computing; Connected components
inferred← citeshttps://doi.org/10.1109/ftdcs.1990.138333openalex-snapshot
Computing biconnected components on a hypercube
inferred← citeshttps://doi.org/10.1145/63047.63106openalex-snapshot
Parallel branch and bound algorithms on hypercube multiprocessors
inferred← citeshttps://doi.org/10.12785/amis/080425openalex-snapshot
A Parallel Branch and Bound Algorithm for Solving Large Scale Integer Programming Problems
inferred← citeshttps://doi.org/10.1287/opre.42.6.1042openalex-snapshot
Parallel Branch-and-Branch Algorithms: Survey and Synthesis
inferred← citeshttps://doi.org/10.5445/ir/42395openalex-snapshot
Lastverteilung für feinkörnig parallelisiertes Branch-and-Bound
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.