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 | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Dynamische Optimierung | Dynamic programming |
-
A note on scheduling identical parallel machines with preemptions and setup times
Boudhar, Mourad, (2025)
-
Legrain, Antoine, (2024)
-
A new fast and accurate heuristic for the automatic scene detection problem
Catanzaro, Daniele, (2021)
- More ...
-
Design of survivable wireless backhaul networks with reliability considerations
Raayatpanah, Mohammad Ali, (2023)
-
Aghayi, Nazila, (2016)
-
Rejoinder on: Optimization and data mining in medicine
Pardalos, Panos M., (2009)
- More ...