Can I read A Polynomial Time Algorithm For Minimax-Regret Evacuation On A Dynamic Path on EtoBox?

A Polynomial Time Algorithm For Minimax-Regret Evacuation On A Dynamic Path by Andy Johnson is a document available to read on EtoBox.

What is A Polynomial Time Algorithm For Minimax-Regret Evacuation On A Dynamic Path about?

This paper presents a polynomial time algorithm for the minimax-regret evacuation problem on a dynamic path network, where evacuees must travel to designated sinks while minimizing evacuation time under uncertain conditions. The authors derive new properties that lead to two algorithms, improving upon previous exponential time solutions, with one algorithm running in O(kn^2 (log n)^k) and the other in O(kn^3 log n). This research addresses the challenge of optimizing evacuation strategies when the exact num

Author

Andy Johnson

Language

EN