88 search results - page 9 / 18 » Improved Bounds and Schemes for the Declustering Problem |
WIOPT
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
ICCCN
2007
IEEE
14 years 2 months ago
2007
IEEE
—The focus of this paper is on wireless mesh networks. In particular, we study the multi-radio case, given the considerable improvement in network throughput that multiple radios...
CPAIOR
2010
Springer
13 years 11 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
CP
2009
Springer
13 years 5 months ago
2009
Springer
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...