599 search results - page 66 / 120 » The traveling salesman problem |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
: The purpose of this report is to present the Crossdock Door Assignment Problem, which involves assigning destinations to outbound dock doors of Crossdock centres such that travel...
WEA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Up to now, research on speed-up techniques for DIJKSTRA’s algorithm focused on single-criteria scenarios. The goal was to find the quickest route within a transportati...
SODA
1998
ACM
13 years 9 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
TVCG
2012
11 years 10 months ago
2012
—Motion perception in immersive virtual environments significantly differs from the real world. For example, previous work has shown that users tend to underestimate travel dista...
ICNC
2005
Springer
14 years 1 months ago
2005
Springer
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...