• Aucun résultat trouvé

Traveling salesman

On Labeled Traveling Salesman Problems

On Labeled Traveling Salesman Problems

... Abstract. We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum (or minimum) number of colors. We derive ...

12

Approximation algorithms for the traveling salesman problem

Approximation algorithms for the traveling salesman problem

... for traveling salesman problem Abstra t We prove that both minimum and maximum traveling salesman problems an be approx- imately solved, in polynomial time within approximation ratio bounded ...

24

Differential approximation results for the traveling salesman problem with distances 1 and 2

Differential approximation results for the traveling salesman problem with distances 1 and 2

... for traveling salesman problem Abstra t We prove that both minimum and maximum traveling salesman problems an be approx- imately solved, in polynomial time within approximation ratio bounded ...

24

Differential approximation results for the traveling salesman problem with distances 1 and 2

Differential approximation results for the traveling salesman problem with distances 1 and 2

... maximum traveling salesman problems on complete graphs with edge-distances 1 and 2 (denoted by min TSP12 and max TSP12, respectively) are approximable within ...maximum traveling salesman with ...

12

An iterative two-step heuristic for the parallel drone scheduling traveling salesman problem

An iterative two-step heuristic for the parallel drone scheduling traveling salesman problem

... Aubière Cedex, France alain.quilliot@isima.fr ABSTRACT Delivery of goods into urban areas constitutes an important issue for logistics service providers. One recent evolution in urban logistics involves the usage of ...

21

Application of the Nested Rollout Policy Adaptation Algorithm to the Traveling Salesman Problem with Time Windows

Application of the Nested Rollout Policy Adaptation Algorithm to the Traveling Salesman Problem with Time Windows

... Keywords: Nested Monte-Carlo, Nested Rollout Policy Adaptation, Trav- eling Salesman Problem with Time Windows. 1 Introduction In this paper we are interested in the minimization of the travel cost of the ...

14

Perturbed Decomposition Algorithm applied to the multi-objective Traveling Salesman Problem

Perturbed Decomposition Algorithm applied to the multi-objective Traveling Salesman Problem

... Abstract Dealing with multi-objective combinatorial optimization, this article proposes a new multi-objective set-based meta- heuristic named Perturbed Decomposition Algorithm (PDA). Combining ideas from decomposition ...

32

A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem

A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem

... of traveling salesman tours and its use in heuristics Abstract A new approach is presented to the traveling salesman problem relying on a novel greedy representation of the solution space and ...

11

Joseph B. Kruskal, Jr., 1956, On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Version bilingue et commentée

Joseph B. Kruskal, Jr., 1956, On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Version bilingue et commentée

... On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Received by the editors April 11, 1955. [48] Several years ago a typewritten translation (of obscure origin ) of [1] raised ...

10

Reoptimization of minimum and maximum traveling salesman's tours

Reoptimization of minimum and maximum traveling salesman's tours

... 1 Introduction The traveling salesman problem (TSP) is one of the most interesting and par- adigmatic optimization problems. In both minimization and maximization ver- sions, TSP has been widely studied and ...

19

Reoptimization of minimum and maximum traveling salesman's tours

Reoptimization of minimum and maximum traveling salesman's tours

... 1 Introduction The traveling salesman problem (TSP) is one of the most interesting and paradig- matic optimization problems. In both minimization and maximization versions, TSP has been widely studied and a ...

12

Differential approximation results for the traveling salesman and related problems

Differential approximation results for the traveling salesman and related problems

... 16. R. M. Karp, Reductibility among combinatorial problems, R.E Miller and J.W. Thatche, Complexity of Computer Computations, 85 − 103, Plenum Press, NY, 1972. 17. S. R. Kosaraju, J. K. Park, and C. Stein, Long tours and ...

7

Algorithms for the on-line quota traveling salesman problem

Algorithms for the on-line quota traveling salesman problem

... ing salesman problem [3], the traveling repairman problem [13, 16, 18], variants of the dial-a-ride problem [2, 13], have been studied in the literature in the re- cent ...(the traveling ...

11

Labeled Traveling Salesman Problems: Complexity and approximation

Labeled Traveling Salesman Problems: Complexity and approximation

... possible, so as to diminish incompatibilities among different technologies. For the maximization case, consider the situation of designing a metropolitan peripheral ring road, where every color represents a different ...

17

Convergent Duality for the Traveling Salesman Problem

Convergent Duality for the Traveling Salesman Problem

... In this paper, we present a constructive method for optimizing exactly the traveling salesman problem (TSP) by solving a sequence of shortest route problems.. The t[r] ...

16

Algorithms for the on-line quota traveling salesman problem

Algorithms for the on-line quota traveling salesman problem

... ing salesman problem [3], the traveling repairman problem [13, 16, 18], variants of the dial-a-ride problem [2, 13], have been studied in the literature in the re- cent ...(the traveling ...

11

An algorithm for the traveling salesman problem,

An algorithm for the traveling salesman problem,

... Q assigned a new, lower balue.) Repeat the procedure: again work up the branch, discarding terminal nodes with bounds equal or greater than Zg until the first one smaller. is found; agai[r] ...

80

The salesman and the tree: the importance of search in CP

The salesman and the tree: the importance of search in CP

... The traveling salesman problem (TSP) involves finding a Hamiltonian cycle of minimum weight in a given undirected graph G = (V, E) associated with a weight function w : E → ...

19

Travelling salesman-based variable density sampling

Travelling salesman-based variable density sampling

... [12] Marco F Duarte and Yonina C Eldar, “Structured compressed sensing: From theory to applications,” Signal Processing, IEEE Transactions on, vol. 59, no. 9, pp. 4053–4085, 2011. [13] WanSoo T Rhee and Michel Talagrand, ...

5

Alpha oscillations and traveling waves: Signatures of predictive coding?

Alpha oscillations and traveling waves: Signatures of predictive coding?

... the traveling wave arises naturally as in the last model from the communication between separately oscillating ...the traveling waves, it is possible to envision the first level of the model as a thalamic ...

27

Show all 83 documents...

Sujets connexes