کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4652781 1632595 2010 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Earliest Arrival Flows in Networks with Multiple Sinks
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Earliest Arrival Flows in Networks with Multiple Sinks
چکیده انگلیسی

Earliest arrival flows model a central aspect of evacuation planning: In a dangerous situation, as many individuals as possible should be rescued at any point in time. Unfortunately, given a network with multiple sinks, flows over time satisfying this condition do not always exist. We analyze the special case of flows over time with zero transit times and characterize which networks always allow for earliest arrival flows.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 36, 1 August 2010, Pages 607-614