2 search results - page 1 / 1 » Metaheuristics for the Asymmetric Hamiltonian Path Problem |
NMA
2010
13 years 2 months ago
2010
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathemat...
DISOPT
2006
13 years 4 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...