• Aucun résultat trouvé

[PDF] Top 20 An algorithm for the traveling salesman problem,

Has 10000 "An algorithm for the traveling salesman problem," found on our website. Below are the top 20 most common "An algorithm for the traveling salesman problem,".

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] ... Voir le document complet

80

An exact algorithm for the Partition Coloring Problem

An exact algorithm for the Partition Coloring Problem

... study the Partition Coloring Problem (PCP), a generalization of the Vertex Coloring Problem where the vertex set is ...partitioned. The PCP asks to select one vertex for ... Voir le document complet

27

Algorithms for the on-line quota traveling salesman problem

Algorithms for the on-line quota traveling salesman problem

... a traveling salesman is not forced to visit all cities in a single tour but in each city he can sell a certain amount of merchandise and his committment is to reach a given quota of sales, by visiting a ... Voir le document complet

11

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

... eling Salesman Problem with Time ...in the minimization of the travel cost of the Traveling Salesman Problem with Time ...Recently, the use of a Nested ... Voir le document complet

14

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

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

... framework for finding an approximation of the Pareto front. The first phase decomposes the search into a number of linearly aggregated problems of the original multi- objective ... Voir le document complet

32

Algorithms for the on-line quota traveling salesman problem

Algorithms for the on-line quota traveling salesman problem

... a traveling salesman is not forced to visit all cities in a single tour but in each city he can sell a certain amount of merchandise and his committment is to reach a given quota of sales, by visiting a ... Voir le document complet

11

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

... constitutes an important issue for logistics service ...involves the usage of drones in the delivery ...of the so-called Parallel Drone Scheduling Traveling Salesman ... Voir le document complet

21

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

... results 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 ... Voir le document complet

24

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] ... Voir le document complet

16

Approximation algorithms for the traveling salesman problem

Approximation algorithms for the traveling salesman problem

... results 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 ... Voir le document complet

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

... Given an instance I of an NP optimization (NPO) problem Π and a polynomial time approx- imation algorithm A feasibly solving Π, we will denote by ω(I), λ A (I) and β(I) the values of ... Voir le document complet

12

An exact algorithm for the Partition Coloring Problem

An exact algorithm for the Partition Coloring Problem

... formulation for the PCP with an exponential number of variables and in Section 3 we design a Brach-and-Price algorithm to solve it to proven ...of the mathematical structures of ... Voir le document complet

25

An Efficient Algorithm for the Knapsack Sharing Problem

An Efficient Algorithm for the Knapsack Sharing Problem

... enhance the STS approach by introducing some intensifying and diversifying strategies: the resulting algorithm is called MTS (Multiple-depth Tabu ...Search). The rest of the article is ... Voir le document complet

20

An Algorithm for the Real Interval Eigenvalue Problem

An Algorithm for the Real Interval Eigenvalue Problem

... obtained for smaller R, as both the Jansson & Rohn method and the sufficient regularity condition are more efficient for smaller radii of matrix ...intervals. The results were ... Voir le document complet

29

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

... that the best decision is made at each step during tour construction. The proposed representation allows for significant improvements over the greedy heuristic by allowing the ... Voir le document complet

11

An auction algorithm for the max-flow problem

An auction algorithm for the max-flow problem

... The iteration tries to construct an augmenting path starting at nl by using the second path construction algorithm of the preceding section, applied to the reduced graph[r] ... Voir le document complet

33

Sparse Two-Row Cuts and an Algorithm for the Separation Problem

Sparse Two-Row Cuts and an Algorithm for the Separation Problem

... Quentin Louveaux (University of Li` ege - Montefiore Institute) Separation for the two-row problem July 2010 21 / 26.. How to check the validity of an inequality[r] ... Voir le document complet

63

An efficient dynamic programming parallel algorithm for the 0-1 knapsack problem

An efficient dynamic programming parallel algorithm for the 0-1 knapsack problem

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ... Voir le document complet

9

An auction/sequential shortest path algorithm for the minimum cost network flow problem

An auction/sequential shortest path algorithm for the minimum cost network flow problem

... By the theory of the auction/shortest path algorithm, a shortest path in the reduced graph will be found in a finite number of iterations if there exists at lea[r] ... Voir le document complet

20

An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem

An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem

... . The main idea behind the developed algorithm is to calculate an upper bound on the possible consumption of resources X and Y taking into account the non-compulsory parts of ... Voir le document complet

11

Show all 10000 documents...