On the use of lexicographic min cost flows in evacuation modeling

DOI<487::AID-NAV3220340404>3.0.CO;2-9 10.1002/1520-6750(198708)34:4<487::AID-NAV3220340404>3.0.CO;2-9zbMath0652.90042OpenAlexW1993721538MaRDI QIDQ3798458

Suleyman Tufekci, Horst W. Hamacher

Publication date: 1987

Full work available at URL: https://doi.org/10.1002/1520-6750(198708)34:4<487::aid-nav3220340404>3.0.co;2-9

zbMATH Keywords

project schedulingmultiple objectiveslexicographical optimizationtime-expanded networkBuilding evacuation problemsdynamic network-flow problemslexicographical min cost flow problems

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (10)

On performance measures for evacuation systems ⋮ OR/MS research in disaster operations management ⋮ An Introduction to Network Flows over Time ⋮ A survey of dynamic network flows ⋮ Unnamed Item ⋮ Decision support for hospital evacuation and emergency response ⋮ A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ Traffic Networks and Flows over Time ⋮ A network flow approach to a city emergency evacuation planning

Cites Work

• Minimal cost flows in regular matroids
• Unnamed Item

This page was built for publication: On the use of lexicographic min cost flows in evacuation modeling