1723 search results - page 104 / 345 » Cycling in linear programming problems |
154
Voted
SODA
2012
ACM
13 years 18 days ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
85
Voted
JCO
2000
14 years 10 months ago
2000
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
110
Voted
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
106
Voted
OSN
2007
14 years 9 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...