Sciweavers

236 search results - page 13 / 48
» On the Vehicle Routing Problem with lower bound capacities
Sort
View
DAGSTUHL
2007
15 years 1 months ago
Approximating min-max k-clustering
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
Asaf Levin
CONEXT
2005
ACM
15 years 1 months ago
MRS: a simple cross-layer heuristic to improve throughput capacity in wireless mesh networks
Wireless Mesh Networks (WMNs) are an emerging architecture based on multi-hop transmission. ISPs considers WMNs as a potential future technology to offer broadband Internet acces...
Luigi Iannone, Serge Fdida
CORR
2011
Springer
192views Education» more  CORR 2011»
14 years 6 months ago
Improved Approximation Guarantees for Lower-Bounded Facility Location
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
Sara Ahmadian, Chaitanya Swamy
COCOON
2008
Springer
15 years 1 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi
CDC
2008
IEEE
139views Control Systems» more  CDC 2008»
15 years 6 months ago
Human-in-the-loop vehicle routing policies for dynamic environments
— In this paper we design coordination policies for a routing problem requiring human-assisted classification of targets through analysis of information gathered on-site by auto...
Ketan Savla, Tom Temple, Emilio Frazzoli