-
1
-
-
0003515463
-
-
Prentice Hall
-
R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
-
(1993)
Network Flows: Theory, Algorithms, and Applications
-
-
Ahuja, R.K.1
Magnanti, T.L.2
Orlin, J.B.3
-
2
-
-
0000325698
-
Integer programming: Methods, uses, computation
-
M.L. Balinski. Integer programming: methods, uses, computation. Management Science, 12(3):253-313, 1965.
-
(1965)
Management Science
, vol.12
, Issue.3
, pp. 253-313
-
-
Balinski, M.L.1
-
3
-
-
0012590885
-
The volume algorithm: Producing primal solutions with the subgradient method
-
IBM Watson
-
F. Barahona and R. Anbil. The volume algorithm: producing primal solutions with the subgradient method. Technical report, IBM Watson, 1998.
-
(1998)
Technical Report
-
-
Barahona, F.1
Anbil, R.2
-
6
-
-
4544321135
-
Solving fractional packing problems in o*(1/ε) iterations
-
D. Bienstock and G. Iyengar. Solving fractional packing problems in o*(1/ε) iterations. In STOC'04, pages 146-155, 2004.
-
(2004)
STOC'04
, pp. 146-155
-
-
Bienstock, D.1
Iyengar, G.2
-
8
-
-
1842511654
-
Improved approximation algorithms for the uncapacitated facility location problem
-
F.A. Chudak and D.B. Shmoys. Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput., 33(1):1-25, 2003.
-
(2003)
SIAM J. Comput.
, vol.33
, Issue.1
, pp. 1-25
-
-
Chudak, F.A.1
Shmoys, D.B.2
-
9
-
-
1842591282
-
A fast approximation scheme for fractional covering problems with variable upper bounds
-
L. Fleischer. A fast approximation scheme for fractional covering problems with variable upper bounds. In SODA'04, pages 1001-1010, 2004.
-
(2004)
SODA'04
, pp. 1001-1010
-
-
Fleischer, L.1
-
10
-
-
0036949026
-
Fast approximation algorithms for fractional steiner forest and related problems
-
N. Garg and R. Khandekar. Fast approximation algorithms for fractional steiner forest and related problems. In FOCS'02, pages 500-509, 2002.
-
(2002)
FOCS'02
, pp. 500-509
-
-
Garg, N.1
Khandekar, R.2
-
11
-
-
0032317818
-
Faster and simpler algorithms for multicommodity flow and other fractional packing problems
-
N. Garg and J. Konemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In FOCS'98, pages 300-309, 1998.
-
(1998)
FOCS'98
, pp. 300-309
-
-
Garg, N.1
Konemann, J.2
-
12
-
-
0005363324
-
A factor 2 approximation for the generalized steiner network problem
-
K. Jain. A factor 2 approximation for the generalized steiner network problem. Combinatorica, 21(21):39-60, 2001.
-
(2001)
Combinatorica
, vol.21
, Issue.21
, pp. 39-60
-
-
Jain, K.1
-
14
-
-
84948978415
-
On the number of iterations for dantzig-wolfe optimization and packing-covering approximation algorithms
-
P. Klein and N. Young. On the number of iterations for dantzig-wolfe optimization and packing-covering approximation algorithms. In IPCO'99, pages 320-327, 1999.
-
(1999)
IPCO'99
, pp. 320-327
-
-
Klein, P.1
Young, N.2
-
16
-
-
0026993999
-
ε-approximation with minimum packing constraint violation
-
J.H. Lin and J.S. Vitter. ε-approximation with minimum packing constraint violation. In STOC'92, pages 771-782, 1992.
-
(1992)
STOC'92
, pp. 771-782
-
-
Lin, J.H.1
Vitter, J.S.2
-
17
-
-
0021608332
-
A polynomial algorithm for minimum quadratic cost flows
-
M. Minoux. A polynomial algorithm for minimum quadratic cost flows. In European J. Oper. Res. 18, pages 377-387, 1984.
-
(1984)
European J. Oper. Res.
, vol.18
, pp. 377-387
-
-
Minoux, M.1
-
19
-
-
24944581915
-
Excessive gap technique in non-smooth convex minimizarion
-
To appear
-
Yu. Nesterov. Excessive gap technique in non-smooth convex minimizarion. SIAM J. Optimization, 2003. To appear.
-
(2003)
SIAM J. Optimization
-
-
Nesterov, Yu.1
-
21
-
-
24944493490
-
Smooth minimization of non-smooth functions
-
To appear
-
Yu. Nesterov. Smooth minimization of non-smooth functions. Mathematcal Programming, 2003. To appear.
-
(2003)
Mathematcal Programming
-
-
Nesterov, Yu.1
-
22
-
-
24944475047
-
Unconstrained convex minimization in relative scale
-
CORE
-
Yu. Nesterov. Unconstrained convex minimization in relative scale. Technical report, CORE, 2003.
-
(2003)
Technical Report
-
-
Nesterov, Yu.1
-
23
-
-
24944515639
-
Rounding of convex sets and efficient gradient methods for linear programming problems
-
CORE
-
Yu. Nesterov. Rounding of convex sets and efficient gradient methods for linear programming problems. Technical report, CORE, 2004.
-
(2004)
Technical Report
-
-
Nesterov, Yu.1
-
24
-
-
0038309442
-
An approximation algorithm for the generalized assignment problem
-
D.B. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming, 62:461-474, 1993.
-
(1993)
Mathematical Programming
, vol.62
, pp. 461-474
-
-
Shmoys, D.B.1
Tardos, E.2
-
25
-
-
0033900292
-
K-medians, facility location, and the chernoff-wald bound
-
N. Young. K-medians, facility location, and the chernoff-wald bound. In STOC'00, pages 86-95, 2000.
-
(2000)
STOC'00
, pp. 86-95
-
-
Young, N.1
-
26
-
-
0035181264
-
Sequential and parallel algorithms for mixed packing and covering
-
N. Young. Sequential and parallel algorithms for mixed packing and covering. In FOCS'01, pages 538-546, 2001.
-
(2001)
FOCS'01
, pp. 538-546
-
-
Young, N.1
|