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)
-
Optimization-based scenario reduction for data-driven two-stage stochastic optimization
Bertsimas, Dimitris, (2023)
-
Simple sequencing problems with interdependent costs
Hain, Roland, (2001)
- More ...
-
Relaxation methods for minimum cost ordinary and generalized network flow problems
Bertsekas, Dimitri P., (1988)
-
Convergence Properties of Dikin’s Affine Scaling Algorithm for Nonconvex Quadratic Minimization
Tseng, Paul, (2004)
-
Nabetani, Koichi, (2011)
- More ...