On the public citation graph
A randomized parallel branch-and-bound algorithm
0 signed · 52 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.1016/0020-0190(78)90028-5openalex-snapshot
Sorting by distributive partitioning
inferredcites →https://doi.org/10.1016/0029-5582(60)90320-5openalex-snapshot
Asymptotic methods in analysis
inferredcites →https://doi.org/10.1016/0167-6377(84)90069-5openalex-snapshot
A successful algorithm for solving directed Hamiltonian path problems
inferredcites →https://doi.org/10.1109/sfcs.1977.24openalex-snapshot
Probabilistic computations: Toward a unified measure of complexity
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.1109/tse.1985.232550openalex-snapshot
Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search
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/327070.327372openalex-snapshot
The influence of parallel decomposition strategies on the performance of multiprocessor systems
inferredcites →https://doi.org/10.1145/358080.358103openalex-snapshot
Anomalies in parallel branch-and-bound algorithms
inferredcites →https://doi.org/10.1147/rd.303.0242openalex-snapshot
The average complexity of depth-first search with backtracking and cutoff
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/mnsc.20.4.460openalex-snapshot
Reduction Algorithm for Zero-One Single Knapsack Problems
inferredcites →https://doi.org/10.1287/mnsc.24.4.441openalex-snapshot
Job-Shop Scheduling by Implicit Enumeration
inferredcites →https://doi.org/10.1287/opre.14.3.361openalex-snapshot
A Branch-Bound Algorithm for Plant Location
inferredcites →https://doi.org/10.1287/opre.21.1.340openalex-snapshot
Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem
inferredcites →https://doi.org/10.1287/opre.25.5.752openalex-snapshot
A General Algorithm for One-Dimensional Knapsack Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118640708.ch03openalex-snapshot
A Multithreaded Branch‐and‐Bound Algorithm for Solving The Flow‐Shop Problem on A Multicore Environment
inferred← citeshttps://doi.org/10.1007/3-540-44681-8_95openalex-snapshot
A Case Study of Load Distribution in Parallel View Frustum Culling and Collision Detection
inferred← citeshttps://doi.org/10.1007/3-540-51687-5_40openalex-snapshot
Two strategies for solving the vertex cover problem on a transputer network
inferred← citeshttps://doi.org/10.1007/3-540-60321-2_27openalex-snapshot
Better algorithms for parallel backtracking
inferred← citeshttps://doi.org/10.1007/978-1-4757-3333-4_11openalex-snapshot
Algorithms for Some Hard Knapsack Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_5openalex-snapshot
Parallel Satisfiability Modulo Theories
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/978-3-540-73940-1_62openalex-snapshot
3-Points Relationship Based Parallel Algorithm for Minimum Ultrametric Tree Construction
inferred← citeshttps://doi.org/10.1007/978-3-642-10291-2_25openalex-snapshot
Partitioning Search Spaces of a Randomized Search
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/978-3-642-95665-2_4openalex-snapshot
Mixed-Integer Linear Optimization on a PC-Net
inferred← citeshttps://doi.org/10.1007/bf01018692openalex-snapshot
Distributed data structures and algorithms for Gr�bner basis computation
inferred← citeshttps://doi.org/10.1007/bf01407836openalex-snapshot
A parallel algorithm for the 0?1 knapsack problem
inferred← citeshttps://doi.org/10.1007/bfb0035459openalex-snapshot
Parallel search algorithms for discrete optimization problems
inferred← citeshttps://doi.org/10.1007/s10044-019-00815-1openalex-snapshot
Parallel cycle-based branch-and-bound method for Bayesian network learning
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.2009.04.008openalex-snapshot
Efficient parallel branch-and-bound algorithm for constructing minimum ultrametric trees
inferred← citeshttps://doi.org/10.1016/j.jpdc.2022.10.007openalex-snapshot
A parallel branch-and-bound algorithm with history-based domination and its application to the sequential ordering problem
inferred← citeshttps://doi.org/10.1109/71.262590openalex-snapshot
Evaluation of a parallel branch-and-bound algorithm on a class of multiprocessors
inferred← citeshttps://doi.org/10.1109/aiccsa.2011.6126581openalex-snapshot
A comparson of receiver initiated DLB schemes via Parallel DFS
inferred← citeshttps://doi.org/10.1109/fmpc.1990.89440openalex-snapshot
An asynchronous multiprocessor design for branch-and-bound algorithms
inferred← citeshttps://doi.org/10.1109/icdcs.1991.148653openalex-snapshot
Models of parallel learning systems
inferred← citeshttps://doi.org/10.1109/icpp.1999.797395openalex-snapshot
A parallel optimal branch-and-bound algorithm for MIN-based multiprocessors
inferred← citeshttps://doi.org/10.1109/ipdps.2014.124openalex-snapshot
A Multi-core Parallel Branch-and-Bound Algorithm Using Factorial Number System
inferred← citeshttps://doi.org/10.1109/ipps.1992.223037openalex-snapshot
Analytical modeling of a parallel branch-and-bound algorithm on MIN-based multiprocessors
inferred← citeshttps://doi.org/10.1145/140901.140914openalex-snapshot
Branch-and-bound and backtrack search on mesh-connected arrays of processors
inferred← citeshttps://doi.org/10.1145/2560683.2560694openalex-snapshot
Work Stealing Strategies For Multi-Core Parallel Branch-and-Bound Algorithm Using Factorial Number System
inferred← citeshttps://doi.org/10.1145/2578948.2560694openalex-snapshot
Work Stealing Strategies For Multi-Core Parallel Branch-and-Bound Algorithm Using Factorial Number System
inferred← citeshttps://doi.org/10.1287/opre.42.6.1042openalex-snapshot
Parallel Branch-and-Branch Algorithms: Survey and Synthesis
inferred← citeshttps://doi.org/10.1613/jair.518openalex-snapshot
Adaptive Parallel Iterative Deepening Search
inferred← citeshttps://doi.org/10.3233/fi-2011-404openalex-snapshot
Partitioning Search Spaces of a Randomized Search
inferred← citeshttps://doi.org/10.5445/ir/42395openalex-snapshot
Lastverteilung für feinkörnig parallelisiertes Branch-and-Bound
inferred← citeshttps://doi.org/10.70675/3132197ezbf73z4ad9zb29fz20b8a8e35a63openalex-snapshot
Parallelisation of hybrid metaheuristics for COP solving
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.