Sciweavers

2252 search results - page 349 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
105
Voted
ALGORITHMICA
2010
156views more  ALGORITHMICA 2010»
15 years 2 months ago
On Covering Problems of Rado
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
Sergey Bereg, Adrian Dumitrescu, Minghui Jiang
COR
2007
88views more  COR 2007»
15 years 2 months ago
Finding minimum and equitable risk routes for hazmat shipments
This paper deals with the generation of minimal risk paths for the road transportation of hazardous materials between an origin–destination pair of a given regional area. The ma...
Pasquale Carotenuto, Stefano Giordani, Salvatore R...
JDA
2006
77views more  JDA 2006»
15 years 2 months ago
On Multi-threaded Metrical Task Systems
Traditionally, on-line problems have been studied under the assumption that there is a unique sequence of requests that must be served. This approach is common to most general mod...
Esteban Feuerstein, Steven S. Seiden, Alejandro St...
112
Voted
EOR
2007
80views more  EOR 2007»
15 years 2 months ago
A partition approach to the inventory/routing problem
In this study we focus on the integration of inventory control and vehicle routing schedules for a distribution system in which the warehouse is responsible for the replenishment ...
Qiu-Hong Zhao, Shouyang Wang, Kin Keung Lai
120
Voted
ANOR
2005
120views more  ANOR 2005»
15 years 2 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Krishna Chepuri, Tito Homem-de-Mello