Note—Some Equivalent Objectives for Dynamic Network Flow Problems

DOI10.1287/mnsc.28.1.106zbMath0486.90042OpenAlexW2079436493MaRDI QIDQ3947427

H. Donald Ratliff, John J. Jarvis

Publication date: 1982

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.28.1.106

zbMATH Keywords

building evacuationdynamic time-expanded network flowsimultaneous optimization of several objectives

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (22)

Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\) ⋮ Algorithms for Flows over Time with Scheduling Costs ⋮ Dynamic resource allocation problem for transportation network evacuation ⋮ Clearance time estimation for incorporating evacuation risk in routing strategies for evacuation operations ⋮ Evacuation planning with endogenous transportation network degradations: a stochastic cell-based model and solution procedure ⋮ Modeling of building evacuation problems by network flows with side constraints ⋮ Elementary modelling and behavioural analysis for emergency evacuations using social media ⋮ Continuous dynamic contraflow approach for evacuation planning ⋮ The quickest flow problem ⋮ Pattern-based evacuation planning for urban areas ⋮ An Introduction to Network Flows over Time ⋮ A survey of dynamic network flows ⋮ Nash equilibria and the price of anarchy for flows over time ⋮ Unnamed Item ⋮ Decision support for hospital evacuation and emergency response ⋮ A heuristic algorithm for the earliest arrival flow with multiple sources ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths ⋮ Dynamic Atomic Congestion Games with Seasonal Flows ⋮ Traffic Networks and Flows over Time ⋮ Optimal Evacuation Solutions for Large-Scale Scenarios ⋮ Algorithms for flows over time with scheduling costs

This page was built for publication: Note—Some Equivalent Objectives for Dynamic Network Flow Problems