Efficient algorithms for abstract flow with partial switching

DOI10.1007/s43069-022-00168-2zbMath1497.90112OpenAlexW4296642575MaRDI QIDQ2079298

Tanka Nath Dhamala, Durga Prasad Khanal, Urmila Pyakurel, 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)

Related Items (1)

In memoriam: Urmila Pyakurel (1980--2023)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient contraflow algorithms for quickest evacuation planning
• Abstract network flow with intermediate storage for evacuation planning
• Network flow with intermediate storage: models and algorithms
• Abstract flows over time: a first step towards solving dynamic packing problems
• Partial contraflow with path reversals for evacuation planning
• Efficient continuous contraflow algorithms for evacuation planning problems
• Maximal Flow Through a Network
• Finding Minimum-Cost Circulations by Successive Approximation
• A Polynomial Algorithm for Weighted Abstract Flow
• The quickest flow problem
• A generalization of max flow—min cut
• Dynamic Contraflow with Orientation Dependent Transit Times Allowing Intermediate Storage
• Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network
• On the Quickest Flow Problem in Dynamic Networks – A Parametric Min-Cost Flow Approach
• Large‐scale zone‐based evacuation planning—Part I: Models and algorithms

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