Sciweavers

599 search results - page 74 / 120
» The traveling salesman problem
Sort
View
HICSS
2005
IEEE
157views Biometrics» more  HICSS 2005»
14 years 1 months ago
A Two-Stage Heuristic for the Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles
The Vehicle Routing Problem with Time Windows (VRPTW) is an important problem in logistics. The problem is to serve a number of customers at minimum cost without violating the cus...
Andrew Lim, Xingwen Zhang
DSN
2002
IEEE
14 years 27 days ago
Pinpoint: Problem Determination in Large, Dynamic Internet Services
Traditional problem determination techniques rely on static dependency models that are difficult to generate accurately in today’s large, distributed, and dynamic application e...
Mike Y. Chen, Emre Kiciman, Eugene Fratkin, Armand...
EOR
2008
97views more  EOR 2008»
13 years 8 months ago
Optimization models for the single delay management problem in public transportation
Passengers travelling in public transportation networks often have to use different lines to cover the trip from their origin to the desired destination. As a consequence, the rel...
Géraldine Heilporn, Luigi De Giovanni, Mart...
ICEB
2004
297views Business» more  ICEB 2004»
13 years 9 months ago
Security Measures in Mobile Commerce: Problems and Solutions
Due to the advent of the Internet, electronic business transactions have exploded around the globe. Along with the Internet, wireless technology has exponentially developed as wel...
Sanwar Ali, Waleed Farag, Mohammad A. Rob
ICDE
2006
IEEE
137views Database» more  ICDE 2006»
14 years 9 months ago
Finding Fastest Paths on A Road Network with Speed Patterns
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP ...
Evangelos Kanoulas, Yang Du, Tian Xia, Donghui Zha...