Sciweavers

1671 search results - page 121 / 335
» On the Covering Steiner Problem
Sort
View
EOR
2010
159views more  EOR 2010»
15 years 1 months ago
An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the wor...
Nabila Azi, Michel Gendreau, Jean-Yves Potvin
UAI
2001
15 years 8 months ago
A Clustering Approach to Solving Large Stochastic Matching Problems
In this work we focus on efficient heuristics for solving a class of stochastic planning problems that arise in a variety of business, investment, and industrial applications. The...
Milos Hauskrecht, Eli Upfal
WG
2004
Springer
16 years 2 days ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...
MFCS
2009
Springer
16 years 1 months ago
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf ...
ICOIN
2005
Springer
16 years 7 days ago
On the Hidden Terminal Problem in Multi-rate Ad Hoc Wireless Networks
Multi-hop ad hoc wireless networks generally use the IEEE 802.11 Distributed Coordination Function (DCF) MAC protocol, which utilizes the request-to-send/clear-to-send (RTS/CTS) me...
Joon Yoo, Chongkwon Kim