On the public citation graph

Parallel computing in combinatorial optimization

https://doi.org/10.1007/bf02186483
0 signed · 95 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.1002/j.1538-7305.1957.tb01515.xopenalex-snapshot
Shortest Connection Networks And Some Generalizations
inferredcites →https://doi.org/10.1007/3-540-18099-0_24openalex-snapshot
Deterministic simulation of idealized parallel computers on more realistic ones
inferredcites →https://doi.org/10.1007/bf00940421openalex-snapshot
Dynamic programming and parallel computers
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf02579338openalex-snapshot
Sorting inc logn parallel steps
inferredcites →https://doi.org/10.1007/bf02579407openalex-snapshot
Constructing a perfect matching is in random NC
inferredcites →https://doi.org/10.1007/bfb0016243openalex-snapshot
Deterministic simulation of idealized parallel computers on more realistic ones
inferredcites →https://doi.org/10.1016/0010-4655(82)90016-9openalex-snapshot
Parallel computers: Architecture, programming and algorithms
inferredcites →https://doi.org/10.1016/0020-0190(79)90152-2openalex-snapshot
Linear programming is log-space hard for P
inferredcites →https://doi.org/10.1016/0020-0190(86)90109-2openalex-snapshot
A note on anomalies in parallel branch-and-bound algorithms with one-to-one bounding functions
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/0166-218x(86)90057-0openalex-snapshot
An introduction to parallelism in combinatorial optimization
inferredcites →https://doi.org/10.1016/0196-6774(80)90004-8openalex-snapshot
A parallel algorithm for constructing minimum spanning trees
inferredcites →https://doi.org/10.1016/0196-6774(83)90045-7openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0304-3975(82)90092-5openalex-snapshot
The maximum flow problem is log space complete for P
inferredcites →https://doi.org/10.1016/0377-2217(86)90338-3openalex-snapshot
Parallel computers and computations
inferredcites →https://doi.org/10.1016/0377-2217(88)90255-xopenalex-snapshot
Experiments with parallel algorithms for combinatorial problems
inferredcites →https://doi.org/10.1016/0378-4754(86)90100-xopenalex-snapshot
Combinatorial optimization: Annotated bibliographies.
inferredcites →https://doi.org/10.1016/0743-7315(88)90037-8openalex-snapshot
A parallel algorithm for preemptive scheduling of uniform machines
inferredcites →https://doi.org/10.1016/s0022-0000(74)80046-2openalex-snapshot
An observation on time-storage trade off
inferredcites →https://doi.org/10.1057/jors.1986.93openalex-snapshot
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
inferredcites →https://doi.org/10.1109/jrproc.1958.286755openalex-snapshot
A Computer Oriented toward Spatial Problems
inferredcites →https://doi.org/10.1109/proc.1966.5273openalex-snapshot
Very high-speed computing systems
inferredcites →https://doi.org/10.1109/t-c.1971.223205openalex-snapshot
Parallel Processing with the Perfect Shuffle
inferredcites →https://doi.org/10.1109/tc.1977.5009294openalex-snapshot
Analysis Techniques for SIMD Machine Interconnection Networks and the Effects of Processor Address Masks
inferredcites →https://doi.org/10.1109/tc.1979.1675260openalex-snapshot
An Optimal Solution for the Channel-Assignment Problem
inferredcites →https://doi.org/10.1109/tc.1979.1675280openalex-snapshot
A Model of SIMD Machines and a Comparison of Various Interconnection Networks
inferredcites →https://doi.org/10.1109/tc.1980.1675681openalex-snapshot
Distributed Enumeration on Between Computers
inferredcites →https://doi.org/10.1109/tc.1983.1676223openalex-snapshot
Binary Trees and Parallel Scheduling Algorithms
inferredcites →https://doi.org/10.1109/tc.1985.6312201openalex-snapshot
Performance of parallel branch-and-bound algorithms
inferredcites →https://doi.org/10.1109/tc.1986.5009434openalex-snapshot
Coping with Anomalies in Parallel Branch-and-Bound Algorithms
inferredcites →https://doi.org/10.1126/science.153.3731.34openalex-snapshot
Dynamic Programming
inferredcites →https://doi.org/10.1137/0205040openalex-snapshot
Fast Parallel Matrix Inversion Algorithms
inferredcites →https://doi.org/10.1137/0210049openalex-snapshot
Parallel Matrix and Graph Algorithms
inferredcites →https://doi.org/10.1137/0210051openalex-snapshot
Fast, Efficient Parallel Algorithms for Some Graph Problems
inferredcites →https://doi.org/10.1137/0216053openalex-snapshot
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
inferredcites →https://doi.org/10.1145/1008354.1008356openalex-snapshot
The monotone and planar circuit value problems are log space complete for P
inferredcites →https://doi.org/10.1145/12130.12146openalex-snapshot
Parallel hashing---an efficient implementation of shared memory
inferredcites →https://doi.org/10.1145/1457769.1457836openalex-snapshot
A computer oriented toward spatial problems
inferredcites →https://doi.org/10.1145/1461551.1461597openalex-snapshot
Programming and design considerations of a highly parallel computer
inferredcites →https://doi.org/10.1145/2465.2468openalex-snapshot
The Manchester prototype dataflow computer
inferredcites →https://doi.org/10.1145/31846.31849openalex-snapshot
Parallel algorithms for minimum cuts and maximum flows in planar networks
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1145/321879.321882openalex-snapshot
Bounds to Complexities of Networks for Sorting and for Switching
inferredcites →https://doi.org/10.1145/322047.322055openalex-snapshot
Preemptive Scheduling of Uniform Processor Systems
inferredcites →https://doi.org/10.1145/322234.322243openalex-snapshot
Alternation
inferredcites →https://doi.org/10.1145/322344.322353openalex-snapshot
A universal interconnection pattern for parallel computers
inferredcites →https://doi.org/10.1145/357114.357116openalex-snapshot
Ultracomputers
inferredcites →https://doi.org/10.1145/358080.358103openalex-snapshot
Anomalies in parallel branch-and-bound algorithms
inferredcites →https://doi.org/10.1145/358645.358660openalex-snapshot
The cube-connected cycles: a versatile network for parallel computation
inferredcites →https://doi.org/10.1145/800057.808688openalex-snapshot
Finding euler circuits in logarithmic parallel time
inferredcites →https://doi.org/10.1145/800057.808689openalex-snapshot
A probabilistic relation between desirable and feasible, models of parallel computation
inferredcites →https://doi.org/10.1145/990518.990519openalex-snapshot
The circuit value problem is log space complete for P
inferredcites →https://doi.org/10.1287/mnsc.24.4.441openalex-snapshot
Job-Shop Scheduling by Implicit Enumeration
inferredcites →https://doi.org/10.1287/mnsc.6.1.1openalex-snapshot
Scheduling with Deadlines and Loss Functions
inferredcites →https://doi.org/10.1287/opre.31.1.24openalex-snapshot
Parallel Scheduling Algorithms
inferredcites →https://doi.org/10.1515/9781400874651openalex-snapshot
Applied Dynamic Programming
inferredcites →https://doi.org/10.21236/ada456864openalex-snapshot
DPUP: A Distributed Processing Utilities Package
inferredcites →https://doi.org/10.2307/2282884openalex-snapshot
Applied Dynamic Programming.
inferredcites →https://doi.org/10.2307/2333941openalex-snapshot
Programmes, Jeux et Reseaux de Transport.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/aic.690420617openalex-snapshot
Application of distributed computing to batch plant design and scheduling
inferred← citeshttps://doi.org/10.1002/scj.4690240304openalex-snapshot
A parallel branch‐and‐bound algorithm for integer linear programming and its implementation on a distributed multiprocessor
inferred← citeshttps://doi.org/10.1007/1-4020-0611-x_728openalex-snapshot
Parallel computing
inferred← citeshttps://doi.org/10.1007/978-1-4419-1153-7_728openalex-snapshot
Parallel Computing
inferred← citeshttps://doi.org/10.1007/978-1-4613-0459-3_16openalex-snapshot
P
inferred← citeshttps://doi.org/10.1007/978-3-540-32220-7_6openalex-snapshot
Communication Delays and Multiprocessor Tasks
inferred← citeshttps://doi.org/10.1007/978-3-662-03217-6_6openalex-snapshot
Communication Delays and Multiprocessor Tasks
inferred← citeshttps://doi.org/10.1007/978-3-662-04363-9_6openalex-snapshot
Communication Delays and Multiprocessor Tasks
inferred← citeshttps://doi.org/10.1007/bf01589406openalex-snapshot
A simulation tool for the performance evaluation of parallel branch and bound algorithms
inferred← citeshttps://doi.org/10.1007/bfb0027120openalex-snapshot
Mapping tree-structured combinatorial optimization problems onto parallel computers
inferred← citeshttps://doi.org/10.1007/bfb0049327openalex-snapshot
On the reasons for average superlinear speedup in parallel backtrack search
inferred← citeshttps://doi.org/10.1016/0098-3004(94)00063-zopenalex-snapshot
Advanced computational methods for spatial information extraction
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/0167-8191(90)90056-fopenalex-snapshot
Multiprocessor scheduling with communication delays
inferred← citeshttps://doi.org/10.1016/0305-0548(91)90090-eopenalex-snapshot
Parallel processing and OR/MS
inferred← citeshttps://doi.org/10.1016/0377-2217(96)00009-4openalex-snapshot
Parallel processing for difficult combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/0928-4869(95)00036-4openalex-snapshot
Parallel search in discrete optimization problems
inferred← citeshttps://doi.org/10.1016/j.orl.2023.02.004openalex-snapshot
On the complexity of scheduling unrelated parallel machines with limited preemptions
inferred← citeshttps://doi.org/10.1016/s1574-0021(96)01009-xopenalex-snapshot
Chapter 7 Parallel computation
inferred← citeshttps://doi.org/10.1080/0020754031000075853openalex-snapshot
Dynamic search tree decomposition for balancing assembly lines by parallel search
inferred← citeshttps://doi.org/10.1080/02331939508844112openalex-snapshot
single Machine Preemptive Scheduling With Special Cost Functions1
inferred← citeshttps://doi.org/10.1080/07421222.1989.11517865openalex-snapshot
The Impact of Parallel and Neural Computing on Managerial Decision Making
inferred← citeshttps://doi.org/10.1088/1367-2630/ac2a5dopenalex-snapshot
Physical requirements for scaling up network-based biocomputation
inferred← citeshttps://doi.org/10.1088/2399-1984/ac7d81openalex-snapshot
Roadmap for network-based biocomputation
inferred← citeshttps://doi.org/10.1109/acssc.1992.269088openalex-snapshot
On the parallel solution of set covering and set partitioning problems
inferred← citeshttps://doi.org/10.1109/etfa.1995.496818openalex-snapshot
Parallel scheduling algorithm to minimize maximal cost
inferred← citeshttps://doi.org/10.1109/ipps.1995.395930openalex-snapshot
Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network
inferred← citeshttps://doi.org/10.1145/115234.115349openalex-snapshot
A parallel shortest augmenting path algorithm for the assignment problem
inferred← citeshttps://doi.org/10.1287/opre.37.5.748openalex-snapshot
A Fast and Simple Algorithm for the Maximum Flow Problem
inferred← citeshttps://doi.org/10.1287/opre.37.6.985openalex-snapshot
OR Forum—Perspectives on Parallel Computing
inferred← citeshttps://doi.org/10.1287/opre.39.6.1005openalex-snapshot
A Queueing Network Model for Analyzing a Class of Branch-and-Bound Algorithms on a Master–Slave Architecture
inferred← citeshttps://doi.org/10.1287/opre.41.1.11openalex-snapshot
Stochastic and Dynamic Models in Transportation
inferred← citeshttps://doi.org/10.1287/opre.42.6.1042openalex-snapshot
Parallel Branch-and-Branch Algorithms: Survey and Synthesis
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.