Results 91 to 100 of about 166,209 (267)
New heuristic algorithms for the Dubins traveling salesman problem [PDF]
, 2020 Luitpold Babel
openalex +1 more source
Approximation algorithms for the traveling salesman problem
, 2002 We first prove that the minimum and maximum traveling salesman problems, their metric versions as well as some versions defined on parameterized triangle inequalities (called sharpened and relaxed metric traveling salesman) are all equi-approximable ...
Monnot, Jérôme +2 more
core +3 more sources
Advanced Intelligent Systems, Volume 8, Issue 1, January 2026.This perspective article considers what computations optical computing can and should enable. Focusing upon free‐space optical computing, it argues that a codesign approach whereby materials, devices, architectures, and algorithms are simultaneously optimized is needed.
Prasad P. Iyer +6 more
wiley +1 more source
The traveling salesman problem, conformal invariance, and dense polymers
, 2004 We propose that the statistics of the optimal tour in the planar random Euclidean traveling salesman problem is conformally invariant on large scales. This is exhibited in power-law behavior of the probabilities for the tour to zigzag repeatedly between ...
Jacobsen, J. L., Read, N., Saleur, H.
core +3 more sources
Trajectory Stability in the Traveling Salesman Problem
Complexity, 2018 Two generalizations of the traveling salesman problem in which sites change their position in time are presented. The way the rank of different trajectory lengths changes in time is studied using the rank diversity.
Sergio Sánchez +5 more
doaj +1 more source
Optimizing Movement Sequences for Step-and-Scan Lithography Equipment
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2013 The purpose of this work is to improve the throughput of step-and-scan lithography equipment to shorten the production time of a wafer. For this purpose, we propose a method for solving the MSOP (Movement Sequence Optimization Problem), which is the ...
Yuji SHINANO +3 more
doaj +1 more source
Automating Algorithm Experiments With ALGator: From Problem Modeling to Reproducible Results
Software: Practice and Experience, Volume 56, Issue 1, Page 26-41, January 2026.ABSTRACT Background Theoretical algorithm analysis provides fundamental insights into algorithm complexity but relies on simplified and often outdated computational models. Experimental algorithmics complements this approach by evaluating the empirical performance of algorithm implementations on real data and modern computing platforms.
Tomaž Dobravec
wiley +1 more source
Approximating 1-dimensional TSP Requires Omega(n log n) Comparisons
, 2013 We give a short proof that any comparison-based n^(1-epsilon)-approximation algorithm for the 1-dimensional Traveling Salesman Problem (TSP) requires Omega(n log n) comparisons.Comment: Superseded by "On the complexity of approximating Euclidean ...
Young, Neal E.
core
An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem [PDF]
, 2012 The Generalized Traveling Salesman Problem (GTSP) is an extension of the well-known Traveling Salesman Problem (TSP), where the node set is partitioned into clusters, and the objective is to find the shortest cycle visiting each cluster exactly once.
Karapetyan, Daniel, Reihaneh, Mohammad
core +2 more sources
, 2017 For the Asymmetric Traveling Salesman Problem (ATSP), it is known that the Dantzig-Fulkerson-Johnson (DFJ) polytope is contained in the Miller-Tucker-Zemlin (MTZ) polytope. The analytic proofs of this fact are quite long.
Velednitsky, Mark
core +1 more source