2 search results - page 1 / 1 » Metaheuristics for the Asymmetric Hamiltonian Path Problem |
127
click to vote
NMA
2010
14 years 10 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...
95
Voted
DISOPT
2006
15 years 8 days 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...