On the public citation graph

Traveling Salesman Problem

https://doi.org/10.5772/66
0 signed · 22 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.
Claim with ORCID
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.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-05521-3_7openalex-snapshot
Walk Optimization of a Drilling Operation Carried Out by a Two Link Robot Arm Using Heuristic Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-13495-1_60openalex-snapshot
Optimization of Minimum Completion Time MTSP Based on the Improved DE
inferred← citeshttps://doi.org/10.1007/978-3-642-30976-2_60openalex-snapshot
A Novel Two-Level Hybrid Algorithm for Multiple Traveling Salesman Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-57760-4openalex-snapshot
Neural networks an introduction
inferred← citeshttps://doi.org/10.1007/978-81-322-1602-5_15openalex-snapshot
Implementation of Intelligent Water Drops Algorithm to Solve Graph-Based Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1109/cipls.2013.6595203openalex-snapshot
SDGP: A developmental approach for traveling salesman problems
inferred← citeshttps://doi.org/10.1109/csndsp.2016.7574016openalex-snapshot
Using genetic algorithm for advanced municipal waste collection in Smart City
inferred← citeshttps://doi.org/10.1109/icccmla58983.2023.10346828openalex-snapshot
Analysis and Evaluation of Bio-Inspired Algorithmic Framework, Potential Application in Cloud/Multi-Cloud Environment
inferred← citeshttps://doi.org/10.1109/icecocs50124.2020.9314375openalex-snapshot
The Ant-Step Algorithms: Reloading the Ant System Heuristic and the Overlooked Basic Variants
inferred← citeshttps://doi.org/10.1109/iceit.2010.5607762openalex-snapshot
An experiment to study wandering salesman applicability on solving the travelling salesman problem based on genetic algorithm
inferred← citeshttps://doi.org/10.1109/iciet56899.2023.10111461openalex-snapshot
A Decision Support System for Teaching Vehicle Routing
inferred← citeshttps://doi.org/10.1109/icmcs.2012.6320145openalex-snapshot
Unsupervised fuzzy clustering-based genetic algorithms to Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1109/lra.2023.3236573openalex-snapshot
FAEL: Fast Autonomous Exploration for Large-scale Environments With a Mobile Robot
inferred← citeshttps://doi.org/10.1109/pci60110.2023.10325958openalex-snapshot
Heuristic Algorithm for Solving Travelling Salesman Problem: Adding the Endpoints of the Longest Edges
inferred← citeshttps://doi.org/10.2478/ttj-2019-0026openalex-snapshot
Making Warehouse Logistics Smart by Effective Placement Strategy Based on Genetic Algorithms
inferred← citeshttps://doi.org/10.30605/proximal.v7i1.3063openalex-snapshot
Penentuan Rute Pendistribusian Gas LPG Menggunakan Algoritma Prim dengan Optimalisasi melalui Pergantian Sisi
inferred← citeshttps://doi.org/10.32508/stdjet.v4i1.746openalex-snapshot
Optimization in Handling Tasks in Monorail Transportation System at Busan Port
inferred← citeshttps://doi.org/10.3390/app14083151openalex-snapshot
An Efficiency Boost for Genetic Algorithms: Initializing the GA with the Iterative Approximate Method for Optimizing the Traveling Salesman Problem—Experimental Insights
inferred← citeshttps://doi.org/10.3390/drones10060430openalex-snapshot
Energy Consumption Optimization of Multi-Trip UAV Routing Using Surrogate Modeling with Heuristic and Metaheuristic Algorithms
inferred← citeshttps://doi.org/10.3390/math10030416openalex-snapshot
GPS: A New TSP Formulation for Its Generalizations Type QUBO
inferred← citeshttps://doi.org/10.5772/12927openalex-snapshot
Linear Programming Formulation of the Multi-Depot Multiple Traveling Salesman Problem with Differentiated Travel Costs
inferred← citeshttps://doi.org/10.70675/02e94438z1a94z4bb0z9966z2a0088eb2df7openalex-snapshot
Métaheuristiques pour l'optimisation combinatoire sur processeurs graphiques (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.