17 search results - page 2 / 4 » On the LP Relaxation of the Asymmetric Traveling Salesman Pa... |
CAAN
2006
Springer
13 years 8 months ago
2006
Springer
In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heu...
ENDM
2010
13 years 5 months ago
2010
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
ANOR
2008
13 years 5 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
DISOPT
2006
13 years 5 months ago
2006
This paper gives a sufficient condition for a combinatorial problem to be greedy-type-resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will o...