A polynomial time algorithm for the minimum flow problem in time-varying networks
Year of publication: |
2019
|
---|---|
Authors: | Khodayifar, S. ; Raayatpanah, Mohammad Ali ; Pardalos, Panos M. |
Published in: |
Advances in theoretical and practical combinatorial optimization. - New York, NY, USA : Springer. - 2019, p. 29-39
|
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Ivanov, Dmitry, (2015)
-
An improved ant algorithm for multi-mode resource constrained project scheduling problem
Wuliang, Peng, (2014)
-
Computing booking limits under a non-parametric demand model : a mathematical programming approach
Hosseinalifam, Morad, (2016)
- More ...
-
Aghayi, Nazila, (2016)
-
Design of survivable wireless backhaul networks with reliability considerations
Raayatpanah, Mohammad Ali, (2023)
-
Optimization and logistics challenges in the enterprise
Chaovalitwongse, Wanpracha, (2009)
- More ...