On the public citation graph

A simulation tool for the performance evaluation of parallel branch and bound algorithms

https://doi.org/10.1007/bf01589406
0 signed · 31 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf02186483openalex-snapshot
Parallel computing in combinatorial optimization
inferredcites →https://doi.org/10.1016/0010-4485(87)90206-5openalex-snapshot
Computer simulation and modelling
inferredcites →https://doi.org/10.1016/0377-2217(82)90015-7openalex-snapshot
A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
inferredcites →https://doi.org/10.1016/0378-4754(86)90100-xopenalex-snapshot
Combinatorial optimization: Annotated bibliographies.
inferredcites →https://doi.org/10.1080/00401706.1988.10488458openalex-snapshot
Computer Simulation and Modelling
inferredcites →https://doi.org/10.1145/12492.12493openalex-snapshot
DPUP: a distributed processing utilities package
inferredcites →https://doi.org/10.1145/22719.24067openalex-snapshot
DIB—a distributed implementation of backtracking
inferredcites →https://doi.org/10.1145/2422.322422openalex-snapshot
Random Trees and the Analysis of Branch and Bound Procedures
inferredcites →https://doi.org/10.1145/322003.322010openalex-snapshot
The Power of Dominance Relations in Branch-and-Bound Algorithms
inferredcites →https://doi.org/10.1145/358080.358103openalex-snapshot
Anomalies in parallel branch-and-bound algorithms
inferredcites →https://doi.org/10.1287/moor.1.3.287openalex-snapshot
Computational Efficiency of Approximate Branch-and-Bound Algorithms
inferredcites →https://doi.org/10.1287/opre.18.1.24openalex-snapshot
Branch-and-Bound Methods: General Formulation and Properties
inferredcites →https://doi.org/10.21236/ada456864openalex-snapshot
DPUP: A Distributed Processing Utilities Package

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4613-3400-2_7openalex-snapshot
Parallel Branch and Bound — Principles and Personal Experiences
inferred← citeshttps://doi.org/10.1007/978-3-319-55669-7_28openalex-snapshot
Using Simulation for Performance Analysis and Visualization of Parallel Branch-and-Bound Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-87729-2_10openalex-snapshot
Auswahl von DV-bezogenen Veröffentlichungen
inferred← citeshttps://doi.org/10.1007/bf02023053openalex-snapshot
Large-scale 0–1 linear programming on distributed workstations
inferred← citeshttps://doi.org/10.1016/0098-1354(94)00084-0openalex-snapshot
DCABB: A distributed control architecture for branch and bound calculations
inferred← citeshttps://doi.org/10.1016/0167-6377(88)90067-3openalex-snapshot
Branch-and-bound and parallel computation: A historical note
inferred← citeshttps://doi.org/10.1016/j.jss.2012.05.060openalex-snapshot
Self-control of the time complexity of a constraint satisfaction problem solver program
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.1016/s0377-0427(00)00420-9openalex-snapshot
Variable metric methods for unconstrained optimization and nonlinear least squares
inferred← citeshttps://doi.org/10.1023/a:1018925018009openalex-snapshot
A parallel branch‐and‐bound methodfor cluster analysis
inferred← citeshttps://doi.org/10.1109/59.485987openalex-snapshot
A heuristic method for reactive power planning
inferred← citeshttps://doi.org/10.1134/s0965542506120165openalex-snapshot
Speedup estimates for some variants of the parallel implementations of the branch-and-bound method
inferred← citeshttps://doi.org/10.1137/0804046openalex-snapshot
Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
inferred← citeshttps://doi.org/10.1145/97808.97776openalex-snapshot
An APL-simulator of non-Von Neumann computer architectures
inferred← citeshttps://doi.org/10.1145/97811.97776openalex-snapshot
An APL-simulator of non-Von Neumann computer architectures
inferred← citeshttps://doi.org/10.1186/s40323-020-00167-0openalex-snapshot
Remarks on mixed-integer formulations for hyper-reduction schemes in nonlinear dynamics
inferred← citeshttps://doi.org/10.1287/opre.37.6.985openalex-snapshot
OR Forum—Perspectives on Parallel Computing
inferred← citeshttps://doi.org/10.1287/opre.42.6.1042openalex-snapshot
Parallel Branch-and-Branch Algorithms: Survey and Synthesis
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.