Generalized maximum flow over time with intermediate storage

DOI10.1007/S10479-023-05773-WMaRDI QIDQ6546986zbMATH OpenFDO

Authors Tanka Nath Dhamala, Mohan Chandra Adhikari, Durga Prasad Khanal, Urmila Pyakurel

Publication date 30 May 2024

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10479-023-05773-W

zbMATH Keywords

contraflowdynamic flowintermediate storagelossy networkmaximum flow

Mathematics Subject Classification ID

Approximation algorithms (68W25) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Combinatorial optimization (90C27)

Recommendations

• Network flow with intermediate storage: models and algorithms
• Generalized Maximum Flows over Time
• Abstract Temporally Repeated Flow with Intermediate Storage
• Lexicographic maximum flow allowing intermediate storage
• Maximum multicommodity flows over time without intermediate storage

Cites work

• A critical survey on the network optimization algorithms for evacuation planning problems
• A Faster Combinatorial Algorithm for the Generalized Circulation Problem
• A note on two problems in connexion with graphs
• A simpler and faster strongly polynomial algorithm for generalized flow maximization
• A strongly polynomial algorithm for generalized flow maximization
• A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS(<Special Issue>Network Design, Control and Optimization)
• Abstract network flow with intermediate storage for evacuation planning
• Combinatorial Algorithms for the Generalized Circulation Problem
• Complexity analysis for maximum flow problems with arc reversals
• Continuous dynamic contraflow approach for evacuation planning
• Continuous time dynamic contraflow models and algorithms
• Dioïds and semirings: Links to fuzzy sets and other applications
• Dynamic network flow location models and algorithms for quickest evacuation planning
• Efficient continuous contraflow algorithms for evacuation planning problems
• Efficient continuous-time dynamic network flow algorithms
• Fast and simple approximation schemes for generalized flow.
• Faster algorithms for the generalized network flow problem
• FlowLoc problems with maximum excess flow
• Generalized Maximum Flows over Time
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 1187161 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• Maximal, Lexicographic, and Dynamic Network Flows
• Multi-commodity flow problem on lossy network with partial lane reversals
• Network flow with intermediate storage: models and algorithms
• Network flows. Theory, algorithms, and applications.
• New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
• On Max Flows with Gains and Pure Min-Cost Flows
• On the equivalence of some generalized network problems to pure network problems
• Optimum flows in general communication networks
• Partial contraflow with path reversals for evacuation planning
• Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
• Quickest Flows Over Time
• The quickest transshipment problem

Cited in

(4)

• Abstract Temporally Repeated Flow with Intermediate Storage
• Mixed-integer programming models and heuristic algorithms for the maximum value dynamic network flow scheduling problem
• On the quickest evacuation location problem in humanitarian operations: multi-objective modelling and matheuristic solution
• Optimizing evacuation via budget constrained maximum dynamic flow with speed variation and intermediate storage

This page was built for publication: Generalized maximum flow over time with intermediate storage

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