On the public citation graph
Local search with memory: benchmarking RTS
0 signed · 73 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/9780470172254.ch1openalex-snapshot
Foundations of Genetic Algorithms
inferredcites →https://doi.org/10.1007/bf00202749openalex-snapshot
Correlated and uncorrelated fitness landscapes and how to tell the difference
inferredcites →https://doi.org/10.1007/bf00339943openalex-snapshot
“Neural” computation of decisions in optimization problems
inferredcites →https://doi.org/10.1007/bf00363956openalex-snapshot
On the stability of the Travelling Salesman Problem algorithm of Hopfield and Tank
inferredcites →https://doi.org/10.1007/bf02022561openalex-snapshot
Dynamic tabu list management using the reverse elimination method
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/0165-1684(83)90098-1openalex-snapshot
Fast transforms: Algorithms, analyses, applications
inferredcites →https://doi.org/10.1016/0166-218x(85)90037-xopenalex-snapshot
Probabilistic asymptotic properties of some combinatorial optimization problems
inferredcites →https://doi.org/10.1016/0377-2217(93)90197-uopenalex-snapshot
An exact search for the solution of the surrogate dual of the 0–1 bidimensional knapsack problem
inferredcites →https://doi.org/10.1016/0898-1221(93)90275-zopenalex-snapshot
Bounding the probability of success of stochastic methods for global optimization
inferredcites →https://doi.org/10.1016/0898-1221(94)00147-2openalex-snapshot
Simulated annealing and Tabu search in the long run: A comparison on QAP tasks
inferredcites →https://doi.org/10.1016/b978-0-08-050684-5.50010-0openalex-snapshot
Spurious Correlations and Premature Convergence in Genetic Algorithms
inferredcites →https://doi.org/10.1016/b978-0-08-050684-5.50022-7openalex-snapshot
An Analysis of Multi-Point Crossover
inferredcites →https://doi.org/10.1016/s0022-5193(87)80029-2openalex-snapshot
Towards a general theory of adaptive walks on rugged landscapes
inferredcites →https://doi.org/10.1016/s0167-8191(05)80052-3openalex-snapshot
The parallel genetic algorithm as function optimizer
inferredcites →https://doi.org/10.1038/scientificamerican0984-60openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1109/72.410361openalex-snapshot
Training neural nets with the reactive tabu search
inferredcites →https://doi.org/10.1109/tsmc.1986.289288openalex-snapshot
Optimization of Control Parameters for Genetic Algorithms
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1142/s0129065789000414openalex-snapshot
A NEW METHOD FOR MAPPING OPTIMIZATION PROBLEMS ONTO NEURAL NETWORKS
inferredcites →https://doi.org/10.1162/neco.1993.5.2.331openalex-snapshot
Neural Networks for Optimization Problems with Inequality Constraints: The Knapsack Problem
inferredcites →https://doi.org/10.2307/2004500openalex-snapshot
The Art of Computer Programming. Vol. II: Seminumerical Algorithms
inferredcites →https://doi.org/10.2307/2583458openalex-snapshot
Knapsack Problems: Algorithms and Computer Implementations
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/0-306-48332-7_318openalex-snapshot
Multidimensional Knapsack Problems
inferred← citeshttps://doi.org/10.1007/3-540-45153-6_6openalex-snapshot
Combinatorial Auctions, Knapsack Problems, and Hill-Climbing Search
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_412openalex-snapshot
Multidimensional Knapsack Problems
inferred← citeshttps://doi.org/10.1007/978-1-4419-1665-5_18openalex-snapshot
Reactive Search Optimization: Learning While Optimizing
inferred← citeshttps://doi.org/10.1007/978-1-4613-1361-8_27openalex-snapshot
Comparison of Heuristics for the 0–1 Multidimensional Knapsack Problem
inferred← citeshttps://doi.org/10.1007/978-1-4615-4102-8_1openalex-snapshot
Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges
inferred← citeshttps://doi.org/10.1007/978-3-319-91086-4_15openalex-snapshot
Reactive Search Optimization: Learning While Optimizing
inferred← citeshttps://doi.org/10.1007/978-3-322-93861-9_7openalex-snapshot
Vergleich und Beurteilung von EA
inferred← citeshttps://doi.org/10.1007/978-3-642-12538-6_15openalex-snapshot
HC12: Highly Scalable Optimisation Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-29694-9_18openalex-snapshot
Memory and Learning in Metaheuristics
inferred← citeshttps://doi.org/10.1007/978-3-642-31137-6_6openalex-snapshot
Solving Multidimensional 0–1 Knapsack Problem with an Artificial Fish Swarm Algorithm
inferred← citeshttps://doi.org/10.1007/bf01719248openalex-snapshot
Strategies with memories: local search in an application oriented environment
inferred← citeshttps://doi.org/10.1007/bf02032479openalex-snapshot
On the application of TRIMAP to problems with multiple decision makers
inferred← citeshttps://doi.org/10.1007/bf02125453openalex-snapshot
The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization
inferred← citeshttps://doi.org/10.1007/s004530010074openalex-snapshot
Reactive Local Search for the Maximum Clique Problem1
inferred← citeshttps://doi.org/10.1007/s10479-005-3448-8openalex-snapshot
The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects
inferred← citeshttps://doi.org/10.1007/s10559-006-0086-3openalex-snapshot
Problems of discrete optimization: Challenges and main approaches to solve them
inferred← citeshttps://doi.org/10.1007/s10732-008-9087-xopenalex-snapshot
An ant colony optimization approach for the multidimensional knapsack problem
inferred← citeshttps://doi.org/10.1016/0898-1221(94)00147-2openalex-snapshot
Simulated annealing and Tabu search in the long run: A comparison on QAP tasks
inferred← citeshttps://doi.org/10.1016/j.amc.2012.05.001openalex-snapshot
A Modified Binary Particle Swarm Optimization for Knapsack Problems
inferred← citeshttps://doi.org/10.1016/j.asoc.2016.05.016openalex-snapshot
Local search versus Path Relinking in metaheuristics: Redesigning Meta-RaPS with application to the multidimensional knapsack problem
inferred← citeshttps://doi.org/10.1016/j.cie.2016.10.022openalex-snapshot
Integrating estimation of distribution algorithms versus Q-learning into Meta-RaPS for solving the 0-1 multidimensional knapsack problem
inferred← citeshttps://doi.org/10.1016/j.omega.2011.06.003openalex-snapshot
Corporate structure optimisation for multinational companies
inferred← citeshttps://doi.org/10.1016/s0167-739x(96)00024-6openalex-snapshot
Virtual particles and search for global minimum
inferred← citeshttps://doi.org/10.1016/s0377-2217(03)00274-1openalex-snapshot
The multidimensional 0–1 knapsack problem: An overview
inferred← citeshttps://doi.org/10.1023/a:1009642405419openalex-snapshot
A Genetic Algorithm for the Multidimensional Knapsack Problem
inferred← citeshttps://doi.org/10.1023/a:1009681732632openalex-snapshot
Reactive Tabu Search and Sensor Selection in Active Structural Acoustic Control Problems
inferred← citeshttps://doi.org/10.1023/a:1009724325820openalex-snapshot
Quelling Cabin Noise in Turboprop Aircraft via Active Control
inferred← citeshttps://doi.org/10.1080/03155986.1999.11732381openalex-snapshot
Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
inferred← citeshttps://doi.org/10.1109/72.410361openalex-snapshot
Training neural nets with the reactive tabu search
inferred← citeshttps://doi.org/10.1109/cec.2007.4424909openalex-snapshot
Solving Multidimensional Knapsack Problems by an Immune-inspired Algorithm
inferred← citeshttps://doi.org/10.1109/icetet.2008.163openalex-snapshot
A Socio-Cognitive Particle Swarm Optimization for Multi-Dimensional Knapsack Problem
inferred← citeshttps://doi.org/10.1109/ictai.2004.104openalex-snapshot
Reactive prohibition-based ant colony optimization (RPACO): a new parallel architecture for constrained clique sub-graphs
inferred← citeshttps://doi.org/10.1109/ictai.2004.92openalex-snapshot
N-to-2-space mapping for visualization of search algorithm performance
inferred← citeshttps://doi.org/10.1139/x03-039openalex-snapshot
Tabu search design for difficult forest management optimization problems
inferred← citeshttps://doi.org/10.1201/9781351236423-19openalex-snapshot
Reactive Search: Machine Learning for Memory-Based Heuristics
inferred← citeshttps://doi.org/10.1590/s0103-17592002000200003openalex-snapshot
Uma abordagem evolutiva para geração automática de turnos completos em torneios
inferred← citeshttps://doi.org/10.48550/arxiv.0712.0451openalex-snapshot
A Reactive Tabu Search Algorithm for Stimuli Generation in Psycholinguistics
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.