303 search results - page 33 / 61 » Traveling Salesman Problem with Transportation |
201
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
159
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...
146
click to vote
4OR
2004
15 years 6 months ago
2004
This paper presents upper bounds for the Satellite Revenue Selection and Scheduling problem (SRSS). A compact model of this generalized Prize Collecting Traveling Salesman Problem ...
145
click to vote
IJCNN
2006
IEEE
16 years 2 days ago
2006
IEEE
— One of the major drawbacks of the Hopfield network is that when it is applied to certain polytopes of combinatorial problems, such as the traveling salesman problem (TSP), the...
171
click to vote
SASO
2007
IEEE
16 years 9 days ago
2007
IEEE
Multi-agent systems (MAS) provide a promising technology for addressing problems such as search and rescue missions, mine sweeping, and surveillance. These problems are a form of ...