@article {10.3844/jmssp.2020.142.147,
article_type = {journal},
title = {Lexicographically Maximum Dynamic Flow with Vertex Capacities},
author = {Bhandari, Phanindra Prasad and Khadka, Shree Ram and Ruzika, Stefan and Schäfer, Luca E.},
volume = {16},
year = {2020},
month = {Jul},
pages = {142-147},
doi = {10.3844/jmssp.2020.142.147},
url = {https://thescipub.com/abstract/jmssp.2020.142.147},
abstract = {We consider an evacuation planning problem in the sense of computing a feasible dynamic flow lexicographically maximizing the amount of flow entering a set of terminals with respect to a given prioritization and given vertex capacities. We propose a polynomial time algorithm for the static version of the problem and a pseudo-polynomial time algorithm for the dynamic case. We show that by neglecting the vertex capacities, the dynamic version can be solved in polynomial time by using temporally repeated flows.},
journal = {Journal of Mathematics and Statistics},
publisher = {Science Publications}
}