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 |
-
A hybrid algorithm for solving convex separable network flow problems
Belling-Seib, Katharina, (1983)
-
Neugestaltung des Ambulanzbereiches eines Krankenhauses : Analyse und Modellierung eines Projektes
Großpietsch, Beate, (2001)
-
Projektplanung : Modelle, Methoden, Management
Zimmermann, Jürgen, (2006)
- More ...
-
Epsilon-relaxation and auction methods for separable convex cost network flow problems
Bertsekas, Dimitri P., (1997)
-
Linear network optimization : algorithms and codes
Bertsekas, Dimitri P., (1991)
-
Dynamic programming and optimal control
Bertsekas, Dimitri P., (1995)
- More ...