6976 search results - page 67 / 1396 » The Oil Searching Problem |
114
Voted
EOR
2007
15 years 5 months ago
2007
This article addresses an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. It proposes a heurist...
181
click to vote
EDBT
2012
ACM
13 years 7 months ago
2012
ACM
The range searching problem is fundamental in a wide spectrum of applications such as radio frequency identification (RFID) networks, location based services (LBS), and global po...
130
click to vote
AIMSA
2004
Springer
15 years 10 months ago
2004
Springer
Nowadays, many real problem in Artificial Intelligence can be modeled as constraint satisfaction problems (CSPs). A general rule in constraint satisfaction is to tackle the hardes...
188
click to vote
SDM
2012
SIAM
13 years 7 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
308
Voted
GECCO
2011
Springer
14 years 8 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...