173 search results - page 19 / 35 » Bounds and Heuristics for the Shortest Capacitated Paths Pro... |
DISOPT
2010
13 years 7 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
GLOBECOM
2009
IEEE
13 years 5 months ago
2009
IEEE
Abstract--We consider a set of multicast sources, each multicasting a finite amount of data to its corresponding destinations. The objective is to minimize the time to deliver all ...
EOR
2008
13 years 7 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
CCR
2002
13 years 7 months ago
2002
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...