On the public citation graph
Parallel search algorithms for discrete optimization problems
0 signed · 76 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.1006/jpdc.1994.1070openalex-snapshot
Scalable Load Balancing Techniques for Parallel Computers
inferredcites →https://doi.org/10.1007/3-540-18099-0_29openalex-snapshot
Parallel processing of combinatorial search trees
inferredcites →https://doi.org/10.1007/3-540-18991-2_58openalex-snapshot
Superlinear speedup for parallel backtracking
inferredcites →https://doi.org/10.1007/3-540-50517-2_79openalex-snapshot
Superlinear speedup in parallel state-space search
inferredcites →https://doi.org/10.1007/978-1-4612-3390-9openalex-snapshot
Parallel Algorithms for Machine Intelligence and Vision
inferredcites →https://doi.org/10.1007/978-1-4612-3390-9_1openalex-snapshot
Scalable Parallel Formulations of Depth-First Search
inferredcites →https://doi.org/10.1007/978-1-4612-3390-9_2openalex-snapshot
Parallel Heuristic Search: Two Approaches
inferredcites →https://doi.org/10.1007/978-1-4612-3390-9_4openalex-snapshot
Multiprocessing of Combinatorial Search Problems
inferredcites →https://doi.org/10.1007/978-1-4613-8788-6openalex-snapshot
Search in Artificial Intelligence
inferredcites →https://doi.org/10.1007/978-1-4613-8788-6_1openalex-snapshot
The CDP: A Unifying Formulation for Heuristic Search, Dynamic Programming, and Branch-and-Bound
inferredcites →https://doi.org/10.1007/bf01379323openalex-snapshot
Performance of an OR-parallel logic programming system
inferredcites →https://doi.org/10.1007/bf01389000openalex-snapshot
Parallel depth first search. Part I. Implementation
inferredcites →https://doi.org/10.1007/bf01389001openalex-snapshot
Parallel depth first search. Part II. Analysis
inferredcites →https://doi.org/10.1007/bf02427853openalex-snapshot
A randomized parallel branch-and-bound algorithm
inferredcites →https://doi.org/10.1016/0004-3702(82)90022-4openalex-snapshot
Parallelism in alpha-beta search
inferredcites →https://doi.org/10.1016/0167-8191(94)90043-4openalex-snapshot
A massively parallel knowledge-base server using a hypercube multiprocessor
inferredcites →https://doi.org/10.1016/0377-2217(85)90047-5openalex-snapshot
Heuristics: Intelligent search strategies for computer problem solving
inferredcites →https://doi.org/10.1016/s0167-8191(05)80001-8openalex-snapshot
Automatic test pattern generation on parallel processors
inferredcites →https://doi.org/10.1016/s0736-5853(86)80081-8openalex-snapshot
Heuristics: Intelligent Search Strategies for Computer Problem Solving
inferredcites →https://doi.org/10.1090/dimacs/022openalex-snapshot
Parallel Processing of Discrete Optimization Problems
inferredcites →https://doi.org/10.1109/71.219757openalex-snapshot
On the efficiency of parallel backtracking
inferredcites →https://doi.org/10.1109/71.313122openalex-snapshot
Unstructured tree search on SIMD parallel computers
inferredcites →https://doi.org/10.1109/fmpc.1990.89450openalex-snapshot
PRA*: a memory-limited heuristic search procedure for the Connection Machine
inferredcites →https://doi.org/10.1109/fmpc.1990.89455openalex-snapshot
Efficient parallel algorithms for search problems: applications in VLSI CAD
inferredcites →https://doi.org/10.1109/iccd.1989.63338openalex-snapshot
Floorplan optimization on multiprocessors
inferredcites →https://doi.org/10.1109/mc.1985.1662926openalex-snapshot
Multiprocessing of Combinatorial Search Problems
inferredcites →https://doi.org/10.1109/robot.1993.292122openalex-snapshot
Parallel search algorithms for robot motion planning
inferredcites →https://doi.org/10.1109/tai.1990.130417openalex-snapshot
A massively parallel knowledge-base server using a hypercube multiprocessor
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/tc.1986.5009434openalex-snapshot
Coping with Anomalies in Parallel Branch-and-Bound Algorithms
inferredcites →https://doi.org/10.1109/tpami.1984.4767600openalex-snapshot
Parallel Branch-and-Bound Formulations for AND/OR Tree Search
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/109025.109118openalex-snapshot
Analysis of scalability of parallel algorithms and architectures
inferredcites →https://doi.org/10.1145/113379.113383openalex-snapshot
Optimal speedup for backtrack search on a butterfly network
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/358080.358103openalex-snapshot
Anomalies in parallel branch-and-bound algorithms
inferredcites →https://doi.org/10.1145/76263.76306openalex-snapshot
A dynamic scheduling strategy for the Chare-Kernel system
inferredcites →https://doi.org/10.1145/99163.99170openalex-snapshot
A multi-level load balancing scheme for OR-parallel exhaustive search programs on the multi-PSI
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/opre.14.4.699openalex-snapshot
Branch-and-Bound Methods: A Survey
inferredcites →https://doi.org/10.5860/choice.26-2172openalex-snapshot
Search in artificial intelligence
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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-46043-8_60openalex-snapshot
Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications
inferred← citeshttps://doi.org/10.1007/3-540-49543-6_20openalex-snapshot
Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem
inferred← citeshttps://doi.org/10.1007/3-540-62095-8_19openalex-snapshot
Parallel search-based methods in optimization
inferred← citeshttps://doi.org/10.1007/978-1-4471-2265-4_14openalex-snapshot
Towards Parallel Implementation of Hybrid MPC—A Survey and Directions for Future Research
inferred← citeshttps://doi.org/10.1007/978-1-4612-1492-2_3openalex-snapshot
Pushing the Limits of Solvable QAP Problems Using Parallel Processing - Is Nugent30 within Reach?
inferred← citeshttps://doi.org/10.1007/978-1-4615-1049-9_1openalex-snapshot
Coin-Or: An Open-Source Library for Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4615-5775-3_23openalex-snapshot
Towards an Evolutionary Method — Cooperating Multi-Thread Parallel Tabu Search Hybrid
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/s10766-012-0195-8openalex-snapshot
An MPI Implementation of a Self-Submitting Parallel Job Queue
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00228-xopenalex-snapshot
Nagging: A scalable fault-tolerant paradigm for distributed search
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00168-5openalex-snapshot
Dynamic configuration management in a graph-oriented Distributed Programming Environment
inferred← citeshttps://doi.org/10.1016/s0167-8191(03)00042-5openalex-snapshot
Solving hub arc location problems on a cluster of workstations
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/s0377-0427(01)00599-4openalex-snapshot
Heuristic allocation based on a dynamic programming state-space representation
inferred← citeshttps://doi.org/10.1016/s0921-4534(97)00907-6openalex-snapshot
Theory of negative magnetoresistance in the c-axis resistivity of High-Tc cuprates
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:1020325926188openalex-snapshot
Cooperative Parallel Tabu Search for Capacitated Network Design
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.1080/0020754031000075853openalex-snapshot
Dynamic search tree decomposition for balancing assembly lines by parallel search
inferred← citeshttps://doi.org/10.1109/4434.708255openalex-snapshot
Optimal task assignment in heterogeneous distributed computing systems
inferred← citeshttps://doi.org/10.1109/ccgrid.2007.14openalex-snapshot
A Static Load-Balancing Scheme for Parallel XML Parsing on Multicore CPUs
inferred← citeshttps://doi.org/10.1109/hcw.1997.581416openalex-snapshot
Optimal task assignment in heterogeneous computing systems
inferred← citeshttps://doi.org/10.1109/tsmca.2005.859094openalex-snapshot
A parallel hypercube algorithm for discrete resource allocation problems
inferred← citeshttps://doi.org/10.1287/ijoc.1090.0340openalex-snapshot
Grid-Enabled Optimization with GAMS
inferred← citeshttps://doi.org/10.1287/ijoc.1090.0347openalex-snapshot
Computational Experience with a Software Framework for Parallel Integer Programming
inferred← citeshttps://doi.org/10.1613/jair.5456openalex-snapshot
AND/OR Branch-and-Bound on a Computational Grid
inferred← citeshttps://doi.org/10.3844/jcssp.2017.452.459openalex-snapshot
DPSA: Deterministic Parallel Search Algorithm in Large Database
inferred← citeshttps://doi.org/10.48550/arxiv.1905.05568openalex-snapshot
Parallel and Memory-limited Algorithms for Optimal Task Scheduling Using a Duplicate-Free State-Space
inferred← citeshttps://doi.org/10.4995/thesis/10251/7108openalex-snapshot
Algoritmos paralelos para la solución de problemas de optimización discretos aplicados a la decodificación de señales.
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.