The capacitated time-space fixed-charge network flow problem : an empirical investigation of procedures for arc capacity assignment
Year of publication: |
2010
|
---|---|
Authors: | Kennington, Jeff L. ; Nicholson, Charles D. |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 22.2010, 2, p. 326-337
|
Subject: | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Kapazitätsplanung | Capacity planning | Heuristik | Heuristics | Netzplantechnik | Project network techniques |
-
Prioritätsregelbasierte Ressourcenplanung für Projekte mit komplexer Ablaufstruktur
Holzer, Achim, (2000)
-
An ant colony optimization metaheuristic for single-path multicommodity network flow problems
Li, X.-Y., (2010)
-
Models and algorithms for network reduction
Li, Gang, (2015)
- More ...
-
Darayi, Mohamad, (2019)
-
Kennington, Jeffery L., (2010)
-
A survey of linear cost multicommodity network flows
Kennington, Jeff L., (1978)
- More ...