A review of optimisation models for pedestrian evacuation and design problems

H Vermuyten, J Beliën, L De Boeck, G Reniers… - Safety science, 2016 - Elsevier
This article presents a review of the use of optimisation models for pedestrian evacuation
and design problems. The articles are classified according to the problem type that is …

Optimization models for large scale network evacuation planning and management: A literature review

V Bayram - Surveys in Operations Research and Management …, 2016 - Elsevier
This study presents a comprehensive review of network-based large scale emergency
evacuation planning and management literature. Evacuation planning and management …

Routing in a delay tolerant network

S Jain, K Fall, R Patra - Proceedings of the 2004 conference on …, 2004 - dl.acm.org
We formulate the delay-tolerant networking routing problem, where messages are to be
moved end-to-end across a connectivity graph that is time-varying but whose dynamics may …

Mobile data offloading through opportunistic communications and social participation

B Han, P Hui, VSA Kumar, MV Marathe… - … on mobile computing, 2011 - ieeexplore.ieee.org
3G networks are currently overloaded, due to the increasing popularity of various
applications for smartphones. Offloading mobile data traffic through opportunistic …

A combinatorial strongly polynomial algorithm for minimizing submodular functions

S Iwata, L Fleischer, S Fujishige - Journal of the ACM (JACM), 2001 - dl.acm.org
This paper presents a combinatorial polynomial-time algorithm for minimizing submodular
functions, answering an open question posed in 1981 by Grötschel, Lovász, and Schrijver …

The continuous-time service network design problem

N Boland, M Hewitt, L Marshall… - Operations …, 2017 - pubsonline.informs.org
Consolidation carriers transport shipments that are small relative to trailer capacity. To be
cost effective, the carrier must consolidate shipments, which requires coordinating their …

An introduction to network flows over time

M Skutella - Research Trends in Combinatorial Optimization: Bonn …, 2009 - Springer
We give an introduction into the fascinating area of flows over time—also called “dynamic
flows” in the literature. Starting from the early work of Ford and Fulkerson on maximum flows …

Capacity constrained routing algorithms for evacuation planning: A summary of results

Q Lu, B George, S Shekhar - International symposium on spatial and …, 2005 - Springer
Evacuation planning is critical for numerous important applications, eg disaster emergency
management and homeland defense preparation. Efficient tools are needed to produce …

Multi-agent path planning and network flow

J Yu, SM LaValle - Algorithmic Foundations of Robotics X: Proceedings of …, 2013 - Springer
This paper connects multi-agent path planning on graphs (roadmaps) to network flow
problems, showing that the former can be reduced to the latter, therefore enabling the …

[BOOK][B] Network flow algorithms

DP Williamson - 2019 - books.google.com
Network flow theory has been used across a number of disciplines, including theoretical
computer science, operations research, and discrete math, to model not only problems in the …