236 search results - page 39 / 48 » On the Vehicle Routing Problem with lower bound capacities |
SOFSEM
2007
Springer
15 years 5 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
ESA
2007
Springer
15 years 5 months ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
CIC
2004
15 years 1 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
112
click to vote
ESCAPE
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In the online capacitated interval coloring problem, a sequence of requests arrive online. Each of the requests is an interval Ij ⊆ {1, 2, . . . , n} with bandwidth bj....
ICALP
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...