On the public citation graph
Strategies with memories: local search in an application oriented environment
0 signed · 77 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.1002/fedr.19750860506openalex-snapshot
Rechenberg, Ingo, Evolutionsstrategie — Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. 170 S. mit 36 Abb. Frommann-Holzboog-Verlag. Stuttgart 1973. Broschiert
inferredcites →https://doi.org/10.1007/3-540-52282-4_52openalex-snapshot
The analysis of local search problems and their heuristics
inferredcites →https://doi.org/10.1007/978-3-0348-5927-1openalex-snapshot
Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie
inferredcites →https://doi.org/10.1007/978-3-642-49366-9openalex-snapshot
Learning in Automated Manufacturing
inferredcites →https://doi.org/10.1007/978-3-642-77537-6_23openalex-snapshot
Tabu Search Techniques for the Quadratic Semi-Assignment Problem
inferredcites →https://doi.org/10.1007/978-3-662-02830-8openalex-snapshot
Genetic Algorithms + Data Structures = Evolution Programs
inferredcites →https://doi.org/10.1007/978-94-015-7744-1openalex-snapshot
Simulated Annealing: Theory and Applications
inferredcites →https://doi.org/10.1007/bf00940812openalex-snapshot
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
inferredcites →https://doi.org/10.1007/bf01719249openalex-snapshot
Local search with memory: benchmarking RTS
inferredcites →https://doi.org/10.1007/bf01719250openalex-snapshot
A generalized permutation approach to job shop scheduling with genetic algorithms
inferredcites →https://doi.org/10.1007/bf01719251openalex-snapshot
A local search approach for two-dimensional irregular cutting
inferredcites →https://doi.org/10.1007/bf01719252openalex-snapshot
Efficient heuristics for robot acquisition planning for a CIM system
inferredcites →https://doi.org/10.1007/bf01719254openalex-snapshot
Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
inferredcites →https://doi.org/10.1007/bf01719256openalex-snapshot
Scatter search and star-paths: beyond the genetic metaphor
inferredcites →https://doi.org/10.1007/bf01719258openalex-snapshot
Obtaining minimum-correlation Latin Hypercube Sampling plans using an IP-based heuristic
inferredcites →https://doi.org/10.1007/bf01719259openalex-snapshot
Solving the damper placement problem via local search heuristics
inferredcites →https://doi.org/10.1007/bf01719261openalex-snapshot
A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs
inferredcites →https://doi.org/10.1007/bf01719262openalex-snapshot
Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
inferredcites →https://doi.org/10.1007/bf01719263openalex-snapshot
A genetic search algorithm to optimize job sequencing under a technological constraint in a rolling-mill facility
inferredcites →https://doi.org/10.1007/bf01719265openalex-snapshot
Heuristic solution approaches to operational forest planning problems
inferredcites →https://doi.org/10.1007/bf01719267openalex-snapshot
A modification of threshold accepting and its application to the quadratic assignment problem
inferredcites →https://doi.org/10.1007/bf01720977openalex-snapshot
Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches
inferredcites →https://doi.org/10.1007/bf02022561openalex-snapshot
Dynamic tabu list management using the reverse elimination method
inferredcites →https://doi.org/10.1007/bf02241270openalex-snapshot
Algorithms for the maximum satisfiability problem
inferredcites →https://doi.org/10.1007/bfb0027029openalex-snapshot
Local search in combinatorial optimization
inferredcites →https://doi.org/10.1007/bfb0029725openalex-snapshot
Global convergence of genetic algorithms: A markov chain analysis
inferredcites →https://doi.org/10.1007/bfb0032050openalex-snapshot
Local optimization and the Traveling Salesman Problem
inferredcites →https://doi.org/10.1016/0021-9991(90)90201-bopenalex-snapshot
Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
inferredcites →https://doi.org/10.1016/0022-0000(88)90046-3openalex-snapshot
How easy is local search?
inferredcites →https://doi.org/10.1016/0166-218x(94)00037-eopenalex-snapshot
Ejection chains, reference structures and alternating path methods for traveling salesman problems
inferredcites →https://doi.org/10.1016/0305-0548(86)90048-1openalex-snapshot
Future paths for integer programming and links to artificial intelligence
inferredcites →https://doi.org/10.1016/0305-0548(86)90050-xopenalex-snapshot
The general employee scheduling problem. An integration of MS and AI
inferredcites →https://doi.org/10.1016/0305-0548(93)e0016-mopenalex-snapshot
Evolution based learning in a job shop scheduling environment
inferredcites →https://doi.org/10.1016/0377-2217(89)90185-9openalex-snapshot
New approaches for heuristic search: A bilateral linkage with artificial intelligence
inferredcites →https://doi.org/10.1016/0378-4754(88)90023-7openalex-snapshot
Simulated annealing: theory and applications.
inferredcites →https://doi.org/10.1016/b978-0-08-051055-2.50030-4openalex-snapshot
GENETIC-ALGORITHM-BASED LEARNING
inferredcites →https://doi.org/10.1063/1.1699114openalex-snapshot
Equation of State Calculations by Fast Computing Machines
inferredcites →https://doi.org/10.1080/01966324.1988.10737242openalex-snapshot
Simulated Annealing – An Annotated Bibliography
inferredcites →https://doi.org/10.1111/j.1540-5915.1977.tb01074.xopenalex-snapshot
HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1287/ijoc.8.3.302openalex-snapshot
Job Shop Scheduling by Local Search
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.13021/mars/3470openalex-snapshot
Toward a Unified Theory of Learning: Multistrategy Task-adaptive Learning
inferredcites →https://doi.org/10.2307/1911908openalex-snapshot
The Theory of Graphs and Its Applications
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.2307/2333777openalex-snapshot
The Theory of Graphs and its Applications.
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.1002/1520-684x(200103)32:3<33::aid-scj4>3.0.co;2-popenalex-snapshot
On metaheuristic algorithms for combinatorial optimization problems
inferred← citeshttps://doi.org/10.1007/3-540-26942-8_6openalex-snapshot
Ganzzahlige und kombinatorische Optimierung
inferred← citeshttps://doi.org/10.1007/3-540-45612-0_1openalex-snapshot
Meta-heuristics: The State of the Art
inferred← citeshttps://doi.org/10.1007/978-3-322-80047-3_5openalex-snapshot
Ganzzahlige und kombinatorische Optimierung
inferred← citeshttps://doi.org/10.1007/978-3-540-70950-3_6openalex-snapshot
Ganzzahlige und kombinatorische Optimierung
inferred← citeshttps://doi.org/10.1007/978-3-540-72929-7_2openalex-snapshot
Modellierung logistischer Systeme
inferred← citeshttps://doi.org/10.1007/978-3-540-92176-9_4openalex-snapshot
Negotiation-Based Collaborative Planning between Two Partners
inferred← citeshttps://doi.org/10.1007/978-3-642-18112-2_6openalex-snapshot
Ganzzahlige und kombinatorische Optimierung
inferred← citeshttps://doi.org/10.1007/978-3-642-18965-4_31openalex-snapshot
Machine Learning by Schedule Decomposition — Prospects for an Integration of AI and OR Techniques for Job Shop Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-56183-2_17openalex-snapshot
Strategic Vehicle Routing in Practice — A pure Software Problem or a Problem Requiring Scientific Advice? Routing Problems of Daily Deliveries to the Same Customers
inferred← citeshttps://doi.org/10.1007/978-3-662-05443-7_4openalex-snapshot
Negotiation-Based Collaborative Planning Between two Partners
inferred← citeshttps://doi.org/10.1007/978-3-662-06910-3_6openalex-snapshot
Ganzzahlige und kombinatorische Optimierung
inferred← citeshttps://doi.org/10.1007/978-3-662-07715-3_2openalex-snapshot
Modellierung logistischer Systeme
inferred← citeshttps://doi.org/10.1007/978-3-662-21852-5_6openalex-snapshot
Ganzzahlige und kombinatorische Optimierung
inferred← citeshttps://doi.org/10.1007/bf01539782openalex-snapshot
Kapazit�tsanpassung bei simultaner Losgr��en- und Reihenfolgeplanung
inferred← citeshttps://doi.org/10.1007/bf01720977openalex-snapshot
Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches
inferred← citeshttps://doi.org/10.1016/j.ejor.2004.01.014openalex-snapshot
Negotiation-based collaborative planning between supply chains partners
inferred← citeshttps://doi.org/10.1016/s0305-9006(02)00039-9openalex-snapshot
Optimising spatial mergers: commercial and regulatory perspectives
inferred← citeshttps://doi.org/10.1016/s0895-7177(99)00085-0openalex-snapshot
A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
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.