Relaxation methods for minimum cost ordinary and generalized network flow problems
Year of publication: |
1988
|
---|---|
Authors: | Bertsekas, Dimitri P. ; Tseng, Paul |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 36.1988, 1, p. 93-114
|
Subject: | Netzwerkanalyse | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Reoptimization procedures for bounded variable primal simplex network algorithms
Ali, A. Iqbal, (1986)
-
Approximations for the random minimal spanning tree with application to network provisioning
Jain, Anjani, (1988)
-
Rosenberg, Eric, (1987)
- More ...
-
Epsilon-relaxation and auction methods for separable convex cost network flow problems
Bertsekas, Dimitri P., (1997)
-
l 1 - penalized likelihood smoothing of volatility processes allowing for abrupt changes
Neto, David, (2009)
-
Sardy, Sylvain, (2004)
- More ...