Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,799,327 papers from all fields of science
Search
Sign In
Create Free Account
Bottleneck traveling salesman problem
Known as:
Bottleneck TSP
, Bottleneck traveling salesman
, Bottleneck travelling salesman problem
The Bottleneck traveling salesman problem (bottleneck TSP) is a problem in discrete or combinatorial optimization. It is stated as follows: Find the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Approximation algorithm
Decision problem
Discrete optimization
Euclidean distance
Expand
Broader (1)
Combinatorial optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Competition Decision for Bottleneck Traveling Salesman Problem Based on Big Data Mining Algorithm with Multi-Segment Support
Dai Ying
International Conference on Smart City and…
2018
Corpus ID: 146118876
Due to the existence of multiple constraints and multiple optimization objectives, the competition decision for bottleneck…
Expand
2011
2011
Solving the Bottleneck Traveling Salesman Problem Using the Lin-Kernighan-Helsgaun Algorithm
Keld Helsgaun
2011
Corpus ID: 122604219
The Clustered Traveling Salesman Problem (CTSP) is an extension of the Traveling Salesman Problem (TSP) where the set of cities…
Expand
2010
2010
The bottleneck traveling salesman problem and some variations
John Larusic
2010
Corpus ID: 117382681
2009
2009
An Algorithmic Approach for Solving ETSP Using Premium Solver Platform
Changbing Jiang
2009
Corpus ID: 9105416
Spreadsheet software, notably Microsoft Excel©, can be used very effectively for analyzing logistics and supply chain issues…
Expand
2007
2007
Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
V. Deineko
,
A. Tiskin
arXiv.org
2007
Corpus ID: 802
The Metric Traveling Salesman Problem (TSP) is a classical NP-hard optimization problem. The double-tree shortcutting method for…
Expand
2007
2007
On the graphical relaxation of the symmetric traveling salesman polytope
M. Oswald
,
G. Reinelt
,
D. Theis
Mathematical programming
2007
Corpus ID: 6814961
The Graphical Traveling Salesman Polyhedron (GTSP) has been proposed by Naddef and Rinaldi to be viewed as a relaxation of the…
Expand
2005
2005
Solving bottleneck travelling salesman problem with competitive decision algorithm based on quick lower bound estimation
Ma Liang
2005
Corpus ID: 124863573
Abstrcat Based on mathematical inference and proof, a quick algorithm for estimating the lower bound of bottleneck travelling…
Expand
2004
2004
Network Governance as a Response to Risk Society Dilemmas: A Proposal from the Sociology of Health
A. Maturo
2004
Corpus ID: 67782039
After a short description of the major sociological theories based on the concept of risk (Douglas, Beck, Luhmann, Giddens) I…
Expand
2001
2001
The Noisy Euclidean Traveling Salesman Problem and Learning
M. Braun
,
J. Buhmann
Neural Information Processing Systems
2001
Corpus ID: 17078073
We consider noisy Euclidean traveling salesman problems in the plane, which are random combinatorial problems with underlying…
Expand
1986
1986
Minisum location of a traveling salesman
O. Berman
,
D. Simchi-Levi
Networks
1986
Corpus ID: 29967315
In this article we deal with the problem of locating on a network a service unit that must visit all the calls that are…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE