A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow

DOI10.1142/S0217595921500275zbMath1493.90038OpenAlexW3167998345MaRDI QIDQ5092549

Stephan Dempe, Hari Nandan Nath, Tanka Nath Dhamala

Publication date: 22 July 2022

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595921500275

zbMATH Keywords

network flowmulticriteria optimizationbicriteria optimizationdynamic flowcontraflow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (1)

Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach

Cites Work

• Unnamed Item
• Unnamed Item
• Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
• Scheduling arc maintenance jobs in a network to maximize total flow over time
• Complexity analysis for maximum flow problems with arc reversals
• Efficient continuous-time dynamic network flow algorithms
• Continuous time dynamic contraflow models and algorithms
• Partial contraflow with path reversals for evacuation planning
• Efficient continuous contraflow algorithms for evacuation planning problems
• Dynamic network flow location models and algorithms for quickest evacuation planning
• An Introduction to Network Flows over Time
• Multicriteria Optimization
• Constructing Maximal Dynamic Flows from Static Flows

This page was built for publication: A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow