77 search results - page 1 / 16 » Optimizing over the split closure |
MP
2008
13 years 4 months ago
2008
CORR
2010
Springer
13 years 2 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
MOBICOM
2009
ACM
13 years 11 months ago
2009
ACM
The coexistence of two unlicensed links is considered, where one link interferes with the transmission of the other, over a timevarying, block-fading channel. In the absence of fa...
INFOCOM
2002
IEEE
13 years 9 months ago
2002
IEEE
Abstract— In this paper, we address the problem of providing traffic quality of service and energy efficiency in ad hoc wireless networks. We consider a network that is shared ...
VLDB
1998
ACM
13 years 8 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...