Generalized maximum flow over time with intermediate storage

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

Cites Work

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

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