Results 171 to 180 of about 72,557 (222)
How our advisory board members are using generative AI in teaching. [PDF]
Patterns (N Y)Patel P, Mani G.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Small Travelling Salesman Polytopes
Mathematics of Operations Research, 1991We introduce a new class of valid inequalities for the polytope of the symmetric travelling salesman problem. We also gave complete characterizations of the polytope for 6 and 7 cities. For the latter case, the new inequalities are needed. These results are related to work of R. Z. Norman in the 1950's.
Boyd, Sylvia C., Cunningham, William H.
openaire +2 more sources
Approximate Traveling Salesman Algorithms
Operations Research, 1980There have been a multitude of heuristic algorithms proposed for the solution of large scale traveling salesman problems. Our intent in this paper is to examine some of these well known heuristics, to introduce some new heuristics, and to compare these approximate techniques on the basis of efficiency and accuracy.
Golden, B. +3 more
openaire +1 more source
The “molecular” traveling salesman
Biological Cybernetics, 1990zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
TRAVELING SALESMAN PROBLEM OF SEGMENTS
International Journal of Computational Geometry & Applications, 2004In this paper, we present a polynomial time approximation scheme (PTAS) for a variant of the traveling salesman problem (called segment TSP) in which a traveling salesman tour is sought to traverse a set of n ∊-separated segments in two dimensional space.
Xu, Jinhui +3 more
openaire +1 more source
Time-Dependent Travelling Salesman Problem
OPSEARCH, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bhavani, V., Sundara Murthy, M.
openaire +2 more sources
Traveling Salesman Problem with Clustering
Journal of Statistical Physics, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schneider, Johannes J. +2 more
openaire +1 more source
2017
This chapter is devoted to the Traveling Salesman Problem (TSP), one of the most famous problems of combinatorial optimization. Compact ILP models for this problem have been proposed since a long time, but most of them are not effective for computational purposes.
Giuseppe Lancia, Paolo Serafini
openaire +1 more source
This chapter is devoted to the Traveling Salesman Problem (TSP), one of the most famous problems of combinatorial optimization. Compact ILP models for this problem have been proposed since a long time, but most of them are not effective for computational purposes.
Giuseppe Lancia, Paolo Serafini
openaire +1 more source
2013
The traveling salesman problem (TSP) has commanded much attention from mathematicians and computer scientists specifically because it is so easy to describe and so difficult to solve. In this paper the problem is defined, various solutiona approaches are discussed and some applications are described.
Hoffman K, Padberg M, Rinaldi G
openaire +1 more source
The traveling salesman problem (TSP) has commanded much attention from mathematicians and computer scientists specifically because it is so easy to describe and so difficult to solve. In this paper the problem is defined, various solutiona approaches are discussed and some applications are described.
Hoffman K, Padberg M, Rinaldi G
openaire +1 more source
Computational Experience with an M-Salesman Traveling Salesman Algorithm
Management Science, 1973A formulation of the traveling salesman problem with more than one salesman is offered. The particular formulation has computational advantages over other formulations. Experience is obtained with an exact branch and bound algorithm employing both upper and lower bounds (mean run time for 55 city problems is one minute). Due to the special formulation,
Joseph A. Svestka, Vaughn E. Huckfeldt
openaire +2 more sources