scientific article; zbMATH DE number 7379974

zbMath1470.90010MaRDI QIDQ5005370

Shree Ram Khadka, Phanindra Prasad Bhandari

Publication date: 9 August 2021

Full work available at URL: https://digitalcommons.pvamu.edu/aam/vol16/iss1/31

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

contraflowmulti-networkevacuation planning problemTTSP network

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity analysis for maximum flow problems with arc reversals
• Minimum cost flow algorithms for series-parallel networks
• Transient flows in networks
• Efficient continuous-time dynamic network flow algorithms
• Evacuation dynamics influenced by spreading hazardous material
• Partial contraflow with path reversals for evacuation planning
• Continuous dynamic contraflow approach for evacuation planning
• The Quickest Transshipment Problem
• Earliest arrival flows on series-parallel graphs
• Finding minimum-cost circulations by canceling negative cycles
• The quickest flow problem
• Maximal, Lexicographic, and Dynamic Network Flows
• Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
• On the Quickest Flow Problem in Dynamic Networks – A Parametric Min-Cost Flow Approach
• Constructing Maximal Dynamic Flows from Static Flows
• An Algorithm for Universal Maximal Dynamic Flows in a Network

This page was built for publication: