17 search results - page 4 / 4 » On the LP Relaxation of the Asymmetric Traveling Salesman Pa... |
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
OSN
2007
13 years 4 months ago
2007
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...