Results 1 to 10 of about 16,247 (139)
Minimizing capacity of Electric Vehicle Battery using Bottleneck Traveling Salesman Problem
Journal of Physics: Conference Series, 2021 Abstract Electrical vehicle technology has now developed. Various public transportation can start using electric power sources. However, there are battery capacity constraints. When the distance is too far, the battery capacity is not sufficient to provide the required power.
Rio Aurachman, Dyah Putri Saraswari
semanticscholar +3 more sources
Experimental analysis of heuristics for the bottleneck traveling salesman problem [PDF]
Journal of Heuristics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John Larusic +2 more
semanticscholar +4 more sources
The Bottleneck Traveling Salesman Problem [PDF]
Journal of the ACM, 1978 Robert Garfinkel, Kenneth Gilbert
semanticscholar +3 more sources
Discrete Applied Mathematics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jack A.A. van der Veen
semanticscholar +6 more sources
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem [PDF]
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2021 We present the first nontrivial approximation algorithm for the bottleneck asymmetric traveling salesman problem. Given an asymmetric metric cost between n vertices, the problem is to find a Hamiltonian cycle that minimizes its bottleneck (or maximum ...
Hyung-Chan An +2 more
openalex +3 more sources
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem [PDF]
ACM Transactions on Algorithms, 2010 We present the first nontrivial approximation algorithm for the bottleneck asymmetric traveling salesman problem . Given an asymmetric metric cost between n vertices, the problem is to find a Hamiltonian cycle that minimizes its bottleneck (or maximum-length edge) cost.
Hyung-Chan An +2 more
openalex +3 more sources
Variants of the Traveling Salesman Problem
Studies in Business and Economics, 2019 This paper includes an introduction to the concept of spreadsheet optimization and modeling as it specifically applies to combinatorial problems. One of the best known of the classic combinatorial problems is the “Traveling Salesman Problem” (TSP).
Patterson Mike, Friesen Daniel
doaj +2 more sources
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem [PDF]
Journal of Discrete Algorithms, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ming‐Yang Kao, Manan Sanghi
openalex +3 more sources
Efficiently solvable special cases of bottleneck travelling salesman problems
Discrete Applied Mathematics, 1991 A special case of the bottleneck travelling salesman problem is investigated. For distance matrices that are circulant matrices, it is shown that the problem can be solved in \(O(n \log n)\) time in contrast with the sum version of the problem for which this is still an open question.
Rainer E. Burkard, W. Sandholzer
openalex +2 more sources
Tongxin xuebao, 2018 In the fields such as intelligent transport and multiple tasks cooperation, the model scale constructed by colored bottleneck traveling salesman problem (CBTSP) tends to large scale, and therefore it is necessary to study the large scale CBTSP and its ...
Wenyong DONG, Xueshi DONG, Yufeng WANG
doaj +3 more sources