86 search results - page 9 / 18 » Approximations for minimum and min-max vehicle routing probl... |
115
click to vote
NETWORKS
2002
14 years 11 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
103
Voted
TAMC
2009
Springer
15 years 6 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...
91
Voted
INFORMS
2008
14 years 11 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
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 ...