Efficient algorithms for abstract flow with partial switching

DOI10.1007/S43069-022-00168-2MaRDI QIDQ2079298zbMATH OpenOpenAlexFDO

Authors Durga Prasad Khanal, Urmila Pyakurel, Tanka Nath Dhamala, Stephan Dempe

Publication date 29 September 2022

Published in SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s43069-022-00168-2

zbMATH Keywords

maximum flowevacuation planningquickest flowcontraflowabstract networkpartial switching

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Transportation, logistics and supply chain management (90B06)

Recommendations

• Efficient continuous contraflow algorithms for evacuation planning problems
• Partial contraflow with path reversals for evacuation planning
• Evacuation planning by earliest arrival contraflow
• scientific article; zbMATH DE number 1003275
• Dynamic network contraflow evacuation planning problem with continuous time approach

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 5772889 (Why is no real title available?)
• scientific article; zbMATH DE number 871948 (Why is no real title available?)
• A Polynomial Algorithm for Weighted Abstract Flow
• A generalization of max flow—min cut
• Abstract flows over time: a first step towards solving dynamic packing problems
• Abstract network flow with intermediate storage for evacuation planning
• Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network
• Dynamic contraflow with orientation dependent transit times allowing intermediate storage
• Efficient continuous contraflow algorithms for evacuation planning problems
• Efficient contraflow algorithms for quickest evacuation planning
• Finding Minimum-Cost Circulations by Successive Approximation
• Large‐scale zone‐based evacuation planning—Part I: Models and algorithms
• Maximal Flow Through a Network
• Network flow with intermediate storage: models and algorithms
• On the quickest flow problem in dynamic networks -- a parametric min-cost flow approach
• Partial contraflow with path reversals for evacuation planning
• The quickest flow problem

Cited in

(2)

• In memoriam: Urmila Pyakurel (1980--2023)
• Abstract network flow with intermediate storage for evacuation planning

This page was built for publication: Efficient algorithms for abstract flow with partial switching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2079298)