Complexity analysis for maximum flow problems with arc reversals
From MaRDI portal
Publication:965819
DOI10.1007/s10878-008-9175-8zbMath1184.90025OpenAlexW2007899233MaRDI QIDQ965819
Panos M. Pardalos, Steffen Rebennack, Lily Elefteriadou, Ashwin Arulselvan
Publication date: 26 April 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-008-9175-8
Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)
Related Items (24)
Evacuation planning by earliest arrival contraflow ⋮ Efficient contraflow algorithms for quickest evacuation planning ⋮ Dynamic multicommodity contraflow problem with asymmetric transit times ⋮ Continuous dynamic contraflow approach for evacuation planning ⋮ Efficient continuous contraflow algorithms for evacuation planning problems ⋮ Dynamic network flow location models and algorithms for quickest evacuation planning ⋮ A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow ⋮ Pattern-based evacuation planning for urban areas ⋮ Multi-commodity flow problem on lossy network with partial lane reversals ⋮ Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach ⋮ Unnamed Item ⋮ In memoriam: Urmila Pyakurel (1980--2023) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Network flow with intermediate storage: models and algorithms ⋮ Continuous time dynamic contraflow models and algorithms ⋮ Generation of networks with prescribed degree-dependent clustering ⋮ Network design model to integrate shelter assignment with contraflow operations in emergency evacuation planning ⋮ Evacuation network optimization model with Lane-based reversal and routing ⋮ Degree-constrained orientations of embedded graphs ⋮ Partial contraflow with path reversals for evacuation planning ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ Abstract network flow with intermediate storage for evacuation planning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Flows in dynamic networks with aggregate arc capacities
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Analysis of Preflow Push Algorithms for Maximum Network Flow
- Optimal dynamic routing in communication networks with continuous traffic
- Finding minimum-cost circulations by canceling negative cycles
- Maximum-throughput dynamic network flows
- Combinatorial Optimization with Rational Objective Functions
- The quickest flow problem
- Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
- Linear-time computation of optimal subgraphs of decomposable graphs
This page was built for publication: Complexity analysis for maximum flow problems with arc reversals
