Sciweavers

599 search results - page 59 / 120
» The traveling salesman problem
Sort
View
ALDT
2011
Springer
241views Algorithms» more  ALDT 2011»
12 years 8 months ago
The Machine Learning and Traveling Repairman Problem
Theja Tulabandhula, Cynthia Rudin, Patrick Jaillet
SSD
2005
Springer
145views Database» more  SSD 2005»
14 years 1 months ago
High Performance Multimodal Networks
Networks often form the core of many users’ spatial databases. Networks are used to support the rapid navigation and analysis of linearly connected data such as that found in tra...
Erik G. Hoel, Wee-Liang Heng, Dale Honeycutt
JDA
2006
90views more  JDA 2006»
13 years 8 months ago
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
We consider the asymmetric traveling salesperson problem with -parameterized triangle inequality for [1/2, 1). That means, the edge weights fulfill w(u, v)
Markus Bläser, Bodo Manthey, Jiri Sgall
MM
2010
ACM
150views Multimedia» more  MM 2010»
13 years 6 months ago
Photo2Trip: generating travel routes from geo-tagged photos for trip planning
Travel route planning is an important step for a tourist to prepare his/her trip. As a common scenario, a tourist usually asks the following questions when he/she is planning his/...
Xin Lu, Changhu Wang, Jiang-Ming Yang, Yanwei Pang...
CONSTRAINTS
2000
96views more  CONSTRAINTS 2000»
13 years 7 months ago
A Comparison of Traditional and Constraint-based Heuristic Methods on Vehicle Routing Problems with Side Constraints
The vehicle routing problem (VRP) is a variant of the familiar travelling salesperson problem (TSP). In the VRP we are to perform a number of visits, using a number of vehicles of ...
Philip Kilby, Patrick Prosser, Paul Shaw