Epsilon-relaxation and auction methods for separable convex cost network flow problems
| Year of publication: |
1997
|
|---|---|
| Authors: | Bertsekas, Dimitri P. |
| Other Persons: | Polymenakos, Lakis C. (contributor) ; Tseng, Paul (contributor) |
| Published in: |
Network optimization. - Berlin : Springer, ISBN 3-540-62541-0. - 1997, p. 103-126
|
| Subject: | Kostenfunktion | Cost function | Projektmanagement | Project management | Mathematische Optimierung | Mathematical programming | Auktionstheorie | Auction theory | Theorie | Theory |
-
Solution methods for nonconvex network flow problems
Bell, Gavin J., (1997)
-
Wang, Jianjun, (2021)
-
Optimization-based scenario reduction for data-driven two-stage stochastic optimization
Bertsimas, Dimitris, (2023)
- More ...
-
Dynamic programming and optimal control
Bertsekas, Dimitri P., (1995)
-
Dynamic programming : deterministic and stochastic models
Bertsekas, Dimitri P., (1987)
-
Q-learning and enhanced policy iteration in discounted dynamic programming
Bertsekas, Dimitri P., (2012)
- More ...