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 | Netzplantechnik | Project network techniques | Projektmanagement | Project management |
-
Computing project makespan distributions : Markovian PERT networks revisited
Burgelman, Jeroen, (2019)
-
A new path-based cutting plane approach for the discrete time-cost tradeoff problem
Hadjiconstantinou, Eleni, (2010)
-
Eusébio, Augusto, (2009)
- More ...
-
Epsilon-relaxation and auction methods for separable convex cost network flow problems
Bertsekas, Dimitri P., (1997)
-
Neuro-dynamic programming: an overview and recent results
Bertsekas, Dimitri P., (2007)
-
Necessary and sufficient conditions for existence of an optimal portfolio
Bertsekas, Dimitri P., (1974)
- More ...