On the public citation graph
Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial time algorithm for the Traveling Salesman Problem
0 signed · 50 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.1007/bf00202901openalex-snapshot
An evolutionary approach to the traveling salesman problem
inferredcites →https://doi.org/10.1007/bf00203032openalex-snapshot
Comparing genetic operators with gaussian mutations in simulated evolutionary processes using linear systems
inferredcites →https://doi.org/10.1007/bf00339943openalex-snapshot
“Neural” computation of decisions in optimization problems
inferredcites →https://doi.org/10.1017/cbo9780511617331openalex-snapshot
Integral Geometry and Geometric Probability
inferredcites →https://doi.org/10.1017/cbo9780511629563.015openalex-snapshot
ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS
inferredcites →https://doi.org/10.1017/cbo9781107325630.013openalex-snapshot
ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS
inferredcites →https://doi.org/10.1017/s0305004100034095openalex-snapshot
The shortest path through many points
inferredcites →https://doi.org/10.1287/moor.2.3.209openalex-snapshot
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
inferredcites →https://doi.org/10.1287/opre.21.2.498openalex-snapshot
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-61108-8_28openalex-snapshot
An introduction to evolutionary programming
inferred← citeshttps://doi.org/10.1007/978-1-4612-1542-4_5openalex-snapshot
An Overview of Evolutionary Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-34289-9_65openalex-snapshot
Application and Research of Shortest Time Limit-Resource Leveling Optimization Problem Based on a New Modified Evolutionary Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-61217-6_2openalex-snapshot
An Overview of Evolutionary Algorithms in Management Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-79293-9_19openalex-snapshot
Optimization by Multicanonical Annealing and the Traveling-Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-7091-7533-0_50openalex-snapshot
Mapping Parallel Genetic Algorithms on WK-Recursive Topologies
inferred← citeshttps://doi.org/10.1007/bf00199449openalex-snapshot
Optimization by hierarchical mutant production
inferred← citeshttps://doi.org/10.1007/bf00199453openalex-snapshot
Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation
inferred← citeshttps://doi.org/10.1007/s004220050423openalex-snapshot
State-space search strategies gleaned from animal behavior: a traveling salesman experiment
inferred← citeshttps://doi.org/10.1007/s00500-015-1970-4openalex-snapshot
Efficient route planning for an unmanned air vehicle deployed on a moving carrier
inferred← citeshttps://doi.org/10.1007/s10462-020-09906-6openalex-snapshot
Performance assessment of the metaheuristic optimization algorithms: an exhaustive review
inferred← citeshttps://doi.org/10.1016/0898-1221(94)90100-7openalex-snapshot
Applying evolutionary programming to selected control problems
inferred← citeshttps://doi.org/10.1016/j.future.2018.03.055openalex-snapshot
A hyper-heuristic cost optimisation approach for Scientific Workflow Scheduling in cloud computing
inferred← citeshttps://doi.org/10.1016/s0004-3702(01)00058-3openalex-snapshot
Drift analysis and average time complexity of evolutionary algorithms
inferred← citeshttps://doi.org/10.1016/s0042-6989(01)00077-3openalex-snapshot
Pursuit affects precision of perceived heading for small viewing apertures
inferred← citeshttps://doi.org/10.1016/s0166-4328(05)80223-2openalex-snapshot
Can rats solve a simple version of the traveling salesman problem?
inferred← citeshttps://doi.org/10.1016/s0167-8655(97)00111-6openalex-snapshot
Genetic algorithm parameter sets for line labelling
inferred← citeshttps://doi.org/10.1021/ci950204copenalex-snapshot
Neural Network Studies. 2. Variable Selection
inferred← citeshttps://doi.org/10.1021/jp045926yopenalex-snapshot
Maximal Use of Minimal Libraries through the Adaptive Substituent Reordering Algorithm
inferred← citeshttps://doi.org/10.1023/a:1006529012972openalex-snapshot
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators
inferred← citeshttps://doi.org/10.1049/cp.2014.0728openalex-snapshot
Detecting Hardware Trojan through Heuristic Partition and Activity Driven Test Pattern Generation
inferred← citeshttps://doi.org/10.1080/01969729308961697openalex-snapshot
APPLYING EVOLUTIONARY PROGRAMMING TO SELECTED TRAVELING SALESMAN PROBLEMS
inferred← citeshttps://doi.org/10.1080/01969729408902335openalex-snapshot
ASYMPTOTIC CONVERGENCE PROPERTIES OF GENETIC ALGORITHMS AND EVOLUTIONARY PROGRAMMING: ANALYSIS AND EXPERIMENTS
inferred← citeshttps://doi.org/10.1088/1757-899x/878/1/012026openalex-snapshot
Transportation modelling and solving Travelling Salesman problem
inferred← citeshttps://doi.org/10.1103/physreve.50.r651openalex-snapshot
Optimization by multicanonical annealing and the traveling salesman problem
inferred← citeshttps://doi.org/10.1109/48.180302openalex-snapshot
Using evolutionary programming for modeling: an ocean acoustic example
inferred← citeshttps://doi.org/10.1109/72.265956openalex-snapshot
An introduction to simulated evolutionary optimization
inferred← citeshttps://doi.org/10.1109/72.265967openalex-snapshot
Notes on the simulation of evolution
inferred← citeshttps://doi.org/10.1109/72.363466openalex-snapshot
Combinatorial optimization with use of guided evolutionary simulated annealing
inferred← citeshttps://doi.org/10.1109/access.2021.3062655openalex-snapshot
A Fast Heuristic for Gateway Location in Wireless Backhaul of 5G Ultra-Dense Networks
inferred← citeshttps://doi.org/10.1109/icec.1996.542348openalex-snapshot
A modified evolutionary programming
inferred← citeshttps://doi.org/10.1109/icsmc.1998.725116openalex-snapshot
Preying on optima: a predatory search strategy for combinatorial problems
inferred← citeshttps://doi.org/10.1109/tcc.2014.2315797openalex-snapshot
A Hyper-Heuristic Scheduling Algorithm for Cloud
inferred← citeshttps://doi.org/10.1155/2014/178621openalex-snapshot
A High-Performance Genetic Algorithm: Using Traveling Salesman Problem as a Case
inferred← citeshttps://doi.org/10.1162/evco.1993.1.1.77openalex-snapshot
Evolving Behaviors in the Iterated Prisoner's Dilemma
inferred← citeshttps://doi.org/10.1201/9781420050073.ax1openalex-snapshot
An Indexed Bibliography of Genetic Algorithms
inferred← citeshttps://doi.org/10.22215/etd/2020-14228openalex-snapshot
Efficient Backhaul Design for 5G Ultra Dense Cells
inferred← citeshttps://doi.org/10.3311/pptr.36997openalex-snapshot
Secure Travel Planning Using a Heuristic Algorithm
inferred← citeshttps://doi.org/10.3390/pr8050513openalex-snapshot
Modeling the Municipal Waste Collection Using Genetic Algorithms
inferred← citeshttps://doi.org/10.7763/lnse.2015.v3.204openalex-snapshot
Route Optimization Method for Unmanned Air Vehicle Launched from a Carrier
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.