On the public citation graph
On the Complexity of Local Search for the Traveling Salesman Problem
0 signed · 100 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/j.1538-7305.1965.tb04146.xopenalex-snapshot
Computer Solutions of the Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_8openalex-snapshot
Reducibility Among Combinatorial Problems
inferredcites →https://doi.org/10.1016/s0022-0000(73)80033-9openalex-snapshot
Time bounds for selection
inferredcites →https://doi.org/10.1016/s0022-0000(76)80016-5openalex-snapshot
Neighborhood search algorithms for guaranteeingoptimal traveling salesman tours must be inefficient
inferredcites →https://doi.org/10.1145/321958.321975openalex-snapshot
P-Complete Approximation Problems
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.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.1002/9781118600207.ch7openalex-snapshot
The Traveling Salesman Problem and its Variations
inferred← citeshttps://doi.org/10.1002/9781119005353.ch7openalex-snapshot
The Traveling Salesman Problem and its Variations
inferred← citeshttps://doi.org/10.1002/nav.3800300107openalex-snapshot
The traveling salesman problem: An update of research
inferred← citeshttps://doi.org/10.1002/net.3230110211openalex-snapshot
Complexity of vehicle routing and scheduling problems
inferred← citeshttps://doi.org/10.1002/sapm1978593245openalex-snapshot
Pairs of Adjacent Hamiltonian Circuits with Small Intersection
inferred← citeshttps://doi.org/10.1007/3-540-29297-7_21openalex-snapshot
The Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/3-540-45365-2_21openalex-snapshot
Effective Local and Guided Variable Neighbourhood Search Methods for the Asymmetric Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-1-4613-3629-7_6openalex-snapshot
Optimization Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_7openalex-snapshot
Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-2-287-99037-3_21openalex-snapshot
Le probléme du voyageur de commerce
inferred← citeshttps://doi.org/10.1007/978-3-031-07067-9_12openalex-snapshot
Recursive Optimization Model for Constructing a Hamilton Tree (G-tree) of Minimum Cost not Belonging to the Class NP
inferred← citeshttps://doi.org/10.1007/978-3-031-35719-0_2openalex-snapshot
Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-39869-1_17openalex-snapshot
Multiagent Matching Algorithms with and without Coach
inferred← citeshttps://doi.org/10.1007/978-3-540-71844-4_21openalex-snapshot
The Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-73297-6_14openalex-snapshot
Pareto Evolutionary Algorithm Hybridized with Local Search for Biobjective TSP
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_19openalex-snapshot
On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-76919-4_21openalex-snapshot
Das Traveling-Salesman-Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-13182-0_17openalex-snapshot
Algorithmics – Is There Hope for a Unified Theory?
inferred← citeshttps://doi.org/10.1007/978-3-642-24488-9_21openalex-snapshot
The Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_21openalex-snapshot
Das Traveling-Salesman-Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-21708-5_21openalex-snapshot
The Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-21711-5_21openalex-snapshot
The Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-56039-6_21openalex-snapshot
The Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_21openalex-snapshot
Das Traveling-Salesman-Problem
inferred← citeshttps://doi.org/10.1007/978-88-470-1523-4_21openalex-snapshot
Il problema del commesso viaggiatore
inferred← citeshttps://doi.org/10.1007/bf01314278openalex-snapshot
Searching for optimal configurations by simulated tunneling
inferred← citeshttps://doi.org/10.1007/bf01415982openalex-snapshot
Optimization and optimality test for the Max-Cut Problem
inferred← citeshttps://doi.org/10.1007/bf01588973openalex-snapshot
The adjacency relation on the traveling salesman polytope is NP-Complete
inferred← citeshttps://doi.org/10.1007/bfb0032050openalex-snapshot
Local optimization and the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/bfb0120888openalex-snapshot
On the symmetric travelling salesman problem: A computational study
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/s101070050010openalex-snapshot
A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1007/s12205-022-0995-3openalex-snapshot
A Simulation Sandbox to Compare Fixed-Route, Semi-flexible Transit, and On-demand Microtransit System Designs
inferred← citeshttps://doi.org/10.1016/0020-0190(81)90102-2openalex-snapshot
On minimal Eulerian graphs
inferred← citeshttps://doi.org/10.1016/0020-0255(82)90055-xopenalex-snapshot
The optimum assignments and a new heuristic approach for the traveling salesman problem
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90003-7openalex-snapshot
On the depth of combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/0167-6377(83)90030-5openalex-snapshot
On the number of iterations of local improvement algorithms
inferred← citeshttps://doi.org/10.1016/0304-3975(77)90012-3openalex-snapshot
The Euclidean travelling salesman problem is NP-complete
inferred← citeshttps://doi.org/10.1016/0305-0548(83)90030-8openalex-snapshot
Routing and scheduling of vehicles and crews
inferred← citeshttps://doi.org/10.1016/0377-2217(89)90412-8openalex-snapshot
Heuristic methods and applications: A categorized survey
inferred← citeshttps://doi.org/10.1016/0885-064x(90)90001-topenalex-snapshot
On the power of neural networks for solving hard problems
inferred← citeshttps://doi.org/10.1016/0893-9659(92)90090-vopenalex-snapshot
Traveling salesman problem and local search
inferred← citeshttps://doi.org/10.1016/b978-0-12-734250-4.50010-2openalex-snapshot
COMBINATORIAL OPTIMIZATION: WHAT IS THE STATE OF THE ART?
inferred← citeshttps://doi.org/10.1016/b978-0-443-16147-6.00005-0openalex-snapshot
Discrete and combinatorial optimization
inferred← citeshttps://doi.org/10.1016/b978-0-443-24066-9.00074-xopenalex-snapshot
Applications to biomedicine
inferred← citeshttps://doi.org/10.1016/j.cam.2010.12.027openalex-snapshot
Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
inferred← citeshttps://doi.org/10.1016/j.cie.2024.109889openalex-snapshot
The Hampered Travelling Salesman problem with Neighbourhoods
inferred← citeshttps://doi.org/10.1016/j.future.2017.09.033openalex-snapshot
Mobile Couriers’ selection for the Smart-grid in Smart-cities’ Pervasive Sensing
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.10.003openalex-snapshot
Local search: Is brute-force avoidable?
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.04.010openalex-snapshot
Searching for better fill-in
inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.02.009openalex-snapshot
Approximation algorithms for sweep coverage in wireless sensor networks
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70820-3openalex-snapshot
Approximative Algorithms for Discrete Optimization Problems
inferred← citeshttps://doi.org/10.1023/a:1024680908847openalex-snapshot
Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems
inferred← citeshttps://doi.org/10.1080/10637199708915622openalex-snapshot
SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS
inferred← citeshttps://doi.org/10.1109/21.281425openalex-snapshot
A bibliography of heuristic search research through 1992
inferred← citeshttps://doi.org/10.1109/21.293486openalex-snapshot
Efficient local search with search space smoothing: a case study of the traveling salesman problem (TSP)
inferred← citeshttps://doi.org/10.1109/32.41334openalex-snapshot
Allocating modules to processors in a distributed system
inferred← citeshttps://doi.org/10.1109/icuas.2019.8797839openalex-snapshot
A Multi-UAS Trajectory optimization Methodology for Complex Enclosed Environments
inferred← citeshttps://doi.org/10.1109/tsmca.2002.1021106openalex-snapshot
Dynamics of local search heuristics for the traveling salesman problem
inferred← citeshttps://doi.org/10.1142/9781848162778_0004openalex-snapshot
Complexity and Approximation in Reoptimization
inferred← citeshttps://doi.org/10.1142/9789814295291_0015openalex-snapshot
LOCAL OPTIMIZATION FOR GLOBAL ALIGNMENT OF PROTEIN INTERACTION NETWORKS
inferred← citeshttps://doi.org/10.1145/3476883.3524046openalex-snapshot
A new approach to the traveling salesman problem
inferred← citeshttps://doi.org/10.1145/3648354openalex-snapshot
Optimizing with Attractor: A Tutorial
inferred← citeshttps://doi.org/10.1201/9780429171529-12openalex-snapshot
Approximation Algorithms and Metaheuristics
inferred← citeshttps://doi.org/10.1201/9781351236423-1openalex-snapshot
Introduction, Overview, and Notation
inferred← citeshttps://doi.org/10.1287/ijoo.2025.0078openalex-snapshot
The Dantzig–Fulkerson–Johnson TSP Formulation Is Easy to Solve for Few Subtour Constraints
inferred← citeshttps://doi.org/10.1287/moor.5.1.1openalex-snapshot
Combinatorial Optimization: What is the State of the Art
inferred← citeshttps://doi.org/10.1287/opre.26.3.434openalex-snapshot
Some Examples of Difficult Traveling Salesman Problems
inferred← citeshttps://doi.org/10.1287/opre.28.5.1086openalex-snapshot
Local Search for the Asymmetric Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1478/aapp.971a1openalex-snapshot
Symmetric traveling salesman problem and flows in hypergraphs: New algorithmic possibilities
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7557openalex-snapshot
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8128openalex-snapshot
Don't Be Strict in Local Search!
inferred← citeshttps://doi.org/10.21936/si2014_v35.n1.682openalex-snapshot
Algorytm hybrydowy wielokrotnego startu dla rozwiązywania problemu sekwencyjnego uporządkowania
inferred← citeshttps://doi.org/10.3233/978-1-60750-718-5-97openalex-snapshot
Facility Location: Discrete Models and Local Search Methods
inferred← citeshttps://doi.org/10.32657/10356/50765openalex-snapshot
Epistemology-based social search for exploratory information seeking
inferred← citeshttps://doi.org/10.3390/su14105805openalex-snapshot
An Artificial-Immune-System-Based Algorithm Enhanced with Deep Reinforcement Learning for Solving Returnable Transport Item Problems
inferred← citeshttps://doi.org/10.3929/ethz-a-007161496openalex-snapshot
Reoptimization of NP-hard Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1403.3431openalex-snapshot
Minimal TSP Tour is coNP-Complete
inferred← citeshttps://doi.org/10.5772/intechopen.90521openalex-snapshot
Solution Attractor of Local Search System: A Method to Reduce Computational Complexity of the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.5772/intechopen.96129openalex-snapshot
How to Solve the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.70675/757ee109zc59cz487cz8d7dza01a149ad1e2openalex-snapshot
Modelling and solving complex vehicle routing problems with integrated management of shared inventories in supply chains
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.