TY  - JOUR
AU  - Bhandari, Phanindra Prasad 
AU  - Khadka, Shree Ram 
AU  - Ruzika, Stefan 
AU  - Schäfer, Luca E. 
PY  - 2020
TI  - Lexicographically Maximum Dynamic Flow with Vertex Capacities
JF  - Journal of Mathematics and Statistics
VL  - 16
IS  - 1
DO  - 10.3844/jmssp.2020.142.147
UR  - https://thescipub.com/abstract/jmssp.2020.142.147
AB  - 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.