On the public citation graph

Parallel heuristic search — Introductions and a new approach

https://doi.org/10.1007/bfb0027125
0 signed · 36 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/3-540-57811-0openalex-snapshot
Algorithms and Complexity
inferredcites →https://doi.org/10.1007/3-540-58484-6_293openalex-snapshot
Implementation of standard genetic algorithm on MIMD machines
inferredcites →https://doi.org/10.1007/978-3-642-46787-5_2openalex-snapshot
Problem Independent Distributed Simulated Annealing and its Applications
inferredcites →https://doi.org/10.1007/978-94-015-7744-1openalex-snapshot
Simulated Annealing: Theory and Applications
inferredcites →https://doi.org/10.1007/bf02022999openalex-snapshot
Massively parallel tabu search for the quadratic assignment problem
inferredcites →https://doi.org/10.1007/bfb0029744openalex-snapshot
Genetic algorithms and punctuated equilibria in VLSI
inferredcites →https://doi.org/10.1007/bfb0029746openalex-snapshot
Explicit parallelism of genetic algorithms through population structures
inferredcites →https://doi.org/10.1007/bfb0029750openalex-snapshot
Optimization using distributed genetic algorithms
inferredcites →https://doi.org/10.1016/0022-0000(88)90046-3openalex-snapshot
How easy is local search?
inferredcites →https://doi.org/10.1016/0141-9331(92)90003-copenalex-snapshot
Parallel biased search for combinatorial optimization: genetic algorithms and TABU
inferredcites →https://doi.org/10.1016/0167-8191(89)90106-3openalex-snapshot
A distributed implementation of simulated annealing for the travelling salesman problem
inferredcites →https://doi.org/10.1016/0377-2217(93)90167-lopenalex-snapshot
Simulated annealing for the QAP — Optimal tradeoff between simulation time and solution quality
inferredcites →https://doi.org/10.1016/0378-4754(88)90023-7openalex-snapshot
Simulated annealing: theory and applications.
inferredcites →https://doi.org/10.1016/s0167-8191(05)80147-4openalex-snapshot
Robust taboo search for the quadratic assignment problem
inferredcites →https://doi.org/10.1109/tcad.1987.1270301openalex-snapshot
Placement by Simulated Annealing on a Multiprocessor
inferredcites →https://doi.org/10.1109/tcad.1987.1270327openalex-snapshot
A Parallel Simulated Annealing Algorithm for the Placement of Macro-Cells
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1287/ijoc.1.3.190openalex-snapshot
Tabu Search—Part I
inferredcites →https://doi.org/10.1287/ijoc.2.1.4openalex-snapshot
Tabu Search—Part II
inferredcites →https://doi.org/10.1287/opre.21.2.498openalex-snapshot
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
inferredcites →https://doi.org/10.1287/opre.37.6.865openalex-snapshot
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
inferredcites →https://doi.org/10.1287/opre.39.3.378openalex-snapshot
Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
inferredcites →https://doi.org/10.5860/choice.27-0936openalex-snapshot
Genetic algorithms in search, optimization, and machine learning
inferredcites →https://doi.org/10.7551/mitpress/1090.001.0001openalex-snapshot
Adaptation in Natural and Artificial Systems
inferredcites →https://doi.org/10.7551/mitpress/4931.003.0017openalex-snapshot
*13 Simulated Annealing and Boltzmann Machines

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-306-48056-5_17openalex-snapshot
Parallel Strategies for Meta-Heuristics
inferred← citeshttps://doi.org/10.1007/978-1-4419-1665-5_17openalex-snapshot
Parallel Meta-heuristics
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_29openalex-snapshot
Selected Algorithmic Techniques for Parallel Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3400-2_8openalex-snapshot
Parallelized Heuristics for Combinatorial Search
inferred← citeshttps://doi.org/10.1007/978-1-4615-5755-5_10openalex-snapshot
Parallel Metaheuristics
inferred← citeshttps://doi.org/10.1007/978-3-030-73882-2_86openalex-snapshot
A New Optimized Approach to Resolve a Combinatorial Problem: CoronaVirus Optimization Algorithm and Self-organizing Maps
inferred← citeshttps://doi.org/10.1007/978-3-319-07124-4_40openalex-snapshot
Parallel Metaheuristic Search
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_40-1openalex-snapshot
Parallel Meta-heuristic Search
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_40-2openalex-snapshot
Parallel Meta-Heuristic Search
inferred← citeshttps://doi.org/10.1023/b:casa.0000034443.12493.40openalex-snapshot
Optimization Parallelizing for Discrete Programming Problems
inferred← citeshttps://doi.org/10.5505/pajes.2017.46794openalex-snapshot
Comparison of simulated annealing parallelization methods for quadratic assignment problems
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.