732 search results - page 63 / 147 » Termination of Integer Linear Programs |
IPCO
2001
13 years 9 months ago
2001
We investigate network design under volatile conditions of link failures and traffic overload. Our model is a non-simultaneous 2-commodity problem. We characterize the feasible so...
CN
2008
13 years 8 months ago
2008
Capacity is an important property for QoS support in Mobile Ad Hoc Networks (MANETs) and has been extensively studied. However, most approaches rely on simplified models (e.g., pr...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...
EOR
2010
13 years 8 months ago
2010
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
ICC
2009
IEEE
13 years 5 months ago
2009
IEEE
-- We develop a new integer linear programming model to optimally design demand-wise shared protection (DSP) networks to achieve specified minimum levels of dual-failure restorabil...