We propose an algorithm which returns a single Hamiltonian cycle with performance guarantee on both objectives. The algorithm is analysed in three cases. When both (resp. at least one) objective function(s) fulfill(s) the triangle inequality, the approximation ratio is 512−041 (resp. 83−). When the triangle inequality is not assumed on any objective function, the algorithm is 141+22−027 -approximate.ouinonouirechercheInternationa
Though 2-approximation algorithms are available for several Multiple Depot Travelling Salesman Probl...
We study the problem of computing a Hamiltonian tour (cycle) or path on a set of points in order to ...
We give bounds on heuristics and relaxations for the problem of determining a maximum weight hamilto...
We mainly study the Max TSP with two objective functions. We propose an algorithm which returns a si...
International audienceWe propose an algorithm which returns a single Hamiltonian cycle with performa...
This paper deals with the problem of constructing Hamiltonian paths of optimal weight, called HPPs,t...
This paper deals with the problem of constructing Hamiltonian paths of optimal weight, called HPP_s,...
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP...
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP....
We present a classical approximation algorithm for the MAX-2-Local Hamiltonian problem. This is a ma...
The traveling salesman problem (TSP) is one of the most fundamental optimization problems....
AbstractIn this paper, we consider the maximum traveling salesman problem with γ-parameterized trian...
We investigate the problem of approximating the Pareto set of biobjective optimization problems with...
We consider a Generalized, Multiple Depot Hamiltonian Path Problem (GMDHPP) and show that it has an ...
The Stacker-Crane Problem (SCP) consists of finding the minimum length hamiltonian cycle on a mixed ...
Though 2-approximation algorithms are available for several Multiple Depot Travelling Salesman Probl...
We study the problem of computing a Hamiltonian tour (cycle) or path on a set of points in order to ...
We give bounds on heuristics and relaxations for the problem of determining a maximum weight hamilto...
We mainly study the Max TSP with two objective functions. We propose an algorithm which returns a si...
International audienceWe propose an algorithm which returns a single Hamiltonian cycle with performa...
This paper deals with the problem of constructing Hamiltonian paths of optimal weight, called HPPs,t...
This paper deals with the problem of constructing Hamiltonian paths of optimal weight, called HPP_s,...
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP...
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP....
We present a classical approximation algorithm for the MAX-2-Local Hamiltonian problem. This is a ma...
The traveling salesman problem (TSP) is one of the most fundamental optimization problems....
AbstractIn this paper, we consider the maximum traveling salesman problem with γ-parameterized trian...
We investigate the problem of approximating the Pareto set of biobjective optimization problems with...
We consider a Generalized, Multiple Depot Hamiltonian Path Problem (GMDHPP) and show that it has an ...
The Stacker-Crane Problem (SCP) consists of finding the minimum length hamiltonian cycle on a mixed ...
Though 2-approximation algorithms are available for several Multiple Depot Travelling Salesman Probl...
We study the problem of computing a Hamiltonian tour (cycle) or path on a set of points in order to ...
We give bounds on heuristics and relaxations for the problem of determining a maximum weight hamilto...