On the public citation graph
Approximation algorithms for the traveling salesman problem
0 signed · 65 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/3-540-46541-3_32openalex-snapshot
An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality
inferredcites →https://doi.org/10.1007/3-540-48224-5_17openalex-snapshot
Approximation Hardness of TSP with Bounded Metrics
inferredcites →https://doi.org/10.1007/bf01581085openalex-snapshot
Approximation algorithms for indefinite quadratic programming
inferredcites →https://doi.org/10.1007/bf01585569openalex-snapshot
The complexity of approximating a nonlinear program
inferredcites →https://doi.org/10.1007/s00493-006-0008-zopenalex-snapshot
On The Approximability Of The Traveling Salesman Problem
inferredcites →https://doi.org/10.1016/0020-0190(94)00184-zopenalex-snapshot
A note on the complexity of local search problems
inferredcites →https://doi.org/10.1016/0022-0000(80)90046-xopenalex-snapshot
Structure preserving reductions among convex optimization problems
inferredcites →https://doi.org/10.1016/0304-3975(80)90006-7openalex-snapshot
Toward a unified approach for the classification of NP-complete optimization problems
inferredcites →https://doi.org/10.1016/0304-3975(95)00060-7openalex-snapshot
On an approximation measure founded on the links between optimization and polynomial approximation theory
inferredcites →https://doi.org/10.1016/s0020-0190(00)00089-2openalex-snapshot
Approximation algorithms for the TSP with sharpened triangle inequality
inferredcites →https://doi.org/10.1016/s0304-3975(97)00099-6openalex-snapshot
Differential approximation algorithms for some combinatorial optimization problems
inferredcites →https://doi.org/10.1023/a:1014923704338openalex-snapshot
Approximation Algorithms for Pick-and-Place Robots
inferredcites →https://doi.org/10.1051/ita:2000115openalex-snapshot
Improved Lower Bounds on the Approximability of the Traveling Salesman Problem
inferredcites →https://doi.org/10.1137/s0895480192240226openalex-snapshot
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
inferredcites →https://doi.org/10.1142/9789814354363_0002openalex-snapshot
The Complexity of Approximating a Nonlinear Program
inferredcites →https://doi.org/10.1145/321958.321975openalex-snapshot
P-Complete Approximation Problems
inferredcites →https://doi.org/10.1287/mnsc.25.8.808openalex-snapshot
Note—On “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms”
inferredcites →https://doi.org/10.1287/moor.18.1.1openalex-snapshot
The Traveling Salesman Problem with Distances One and Two
inferredcites →https://doi.org/10.1287/moor.6.3.319openalex-snapshot
Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
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.27.4.799openalex-snapshot
An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
inferredcites →https://doi.org/10.1287/opre.6.6.791openalex-snapshot
A Method for Solving Traveling-Salesman Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470611098.ch2openalex-snapshot
Approximation of Multi‐criteria Min and MaxTSP(1, 2)
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.1007/978-3-030-31489-7_1openalex-snapshot
Combining Local Search and Elicitation for Multi-Objective Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-20350-3_19openalex-snapshot
A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_12openalex-snapshot
Completeness in Differential Approximation Classes
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_13openalex-snapshot
A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-32147-4_36openalex-snapshot
Differential Approximation of the Multiple Stacks TSP
inferred← citeshttps://doi.org/10.1007/s00170-023-12116-3openalex-snapshot
A two-module automated scanning inspection planning methodology for hole features on image measuring instrument
inferred← citeshttps://doi.org/10.1016/j.array.2026.101274openalex-snapshot
TSP-TET: A variant of the traveling salesman problem with task execution at each site
inferred← citeshttps://doi.org/10.1016/j.asoc.2017.06.049openalex-snapshot
A modified ant system to achieve better balance between intensification and diversification for the traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2026.115379openalex-snapshot
Adaptive heuristic for routing problems via integrated self-attention and convolution in deep reinforcement learning
inferred← citeshttps://doi.org/10.1016/j.cosrev.2009.11.001openalex-snapshot
A survey on the structure of approximation classes
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.08.054openalex-snapshot
An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem
inferred← citeshttps://doi.org/10.1016/j.ifacol.2025.09.236openalex-snapshot
Industrial application of the Bipartite TSP in robotic pick-and-place operations
inferred← citeshttps://doi.org/10.1016/j.jocs.2024.102424openalex-snapshot
Quasi-linear time heuristic to solve the Euclidean traveling salesman problem with low gap
inferred← citeshttps://doi.org/10.1016/j.orl.2011.03.002openalex-snapshot
An analysis of the extended Christofides heuristic for the -depot TSP
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.002openalex-snapshot
A better differential approximation ratio for symmetric TSP
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115435openalex-snapshot
A 3/4 differential approximation algorithm for traveling salesman problem
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00376-1openalex-snapshot
Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
inferred← citeshttps://doi.org/10.1080/00207543.2026.2738919openalex-snapshot
Optimising robotic pick-and-place operations and the application of RMS principles
inferred← citeshttps://doi.org/10.1109/ahs.2018.8541366openalex-snapshot
The intelligent Computer Aided Satellite Designer iCASD - Creating viable configurations for modular satellites
inferred← citeshttps://doi.org/10.1109/iccv51070.2023.01778openalex-snapshot
Reducing Training Time in Cross-Silo Federated Learning using Multigraph Topology
inferred← citeshttps://doi.org/10.1109/iceta67772.2025.11280218openalex-snapshot
Quantum Computing and Optimization through QUBO in Education: A Case Study on Efficient Multi-agent Route Planning
inferred← citeshttps://doi.org/10.1109/iros40897.2019.8968113openalex-snapshot
Optimal Solving of Constrained Path-Planning Problems with Graph Convolutional Networks and Optimized Tree Search
inferred← citeshttps://doi.org/10.1109/iv51971.2022.9827020openalex-snapshot
Deep Federated Learning for Autonomous Driving
inferred← citeshttps://doi.org/10.1109/tits.2019.2949267openalex-snapshot
Energy-Efficient Timely Truck Transportation for Geographically-Dispersed Tasks
inferred← citeshttps://doi.org/10.1137/21m146199xopenalex-snapshot
The Approximation Ratio of the k -Opt Heuristic for the Euclidean Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1142/s0129054105003807openalex-snapshot
COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES
inferred← citeshttps://doi.org/10.1145/3208903.3208911openalex-snapshot
Energy-Efficient Timely Truck Transportation for Geographically-Dispersed Tasks
inferred← citeshttps://doi.org/10.1201/9781420010749.ch16openalex-snapshot
Differential Ratio Approximation
inferred← citeshttps://doi.org/10.1287/ijoc.2015.0650openalex-snapshot
A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots
inferred← citeshttps://doi.org/10.2298/yjor0901003popenalex-snapshot
An overview on polynomial approximation of NP-hard problems
inferred← citeshttps://doi.org/10.23919/apnoms56106.2022.9919905openalex-snapshot
GCN-Based Topology Design for Decentralized Federated Learning in IoV
inferred← citeshttps://doi.org/10.2478/qic-2025-0028openalex-snapshot
Implementation of Quantum Fourier Transform and Quantum Hashing for Quantum Devices with Arbitrary Qubit Connectivity Graphs
inferred← citeshttps://doi.org/10.3390/electronics13071370openalex-snapshot
A Comparative Analysis of Computational Intelligence Methods for Autonomous Navigation of Smart Ships
inferred← citeshttps://doi.org/10.3390/ijgi10090616openalex-snapshot
Indoor Traveling Salesman Problem (ITSP) Path Planning
inferred← citeshttps://doi.org/10.4018/ijisscm.2014010105openalex-snapshot
Review of Solution Approaches for the Symmetric Traveling Salesman Problem
inferred← citeshttps://doi.org/10.48550/arxiv.2010.12229openalex-snapshot
Throughput-Optimal Topology Design for Cross-Silo Federated Learning
inferred← citeshttps://doi.org/10.5120/ijca2016908151openalex-snapshot
Parallel Approach for Optimized Travelling Salesman Problem using GPU
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.