Universally maximum flow with piecewise-constant capacities

DOI10.1002/net.1030zbMath0984.90501OpenAlexW2004700840MaRDI QIDQ2764994

Lisa K. Fleischer

Publication date: 22 April 2002

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.1030

zbMATH Keywords

computational complexityparametric flowtransshipmentdynamic flowmaximum flow over timeuniversally maximum flow

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)

Related Items (8)

Continuous dynamic contraflow approach for evacuation planning ⋮ Conveyor operations in distribution centers: modeling and optimization ⋮ Scheduling arc maintenance jobs in a network to maximize total flow over time ⋮ Algorithms for Finding Optimal Flows in Dynamic Networks ⋮ An introduction to dynamic generative networks: minimum cost flow ⋮ Structural and algorithmic properties for parametric minimum cuts ⋮ Maximum flow problem on dynamic generative network flows with time-varying bounds ⋮ A survey on models and algorithms for discrete evacuation planning network problems

Cites Work

• Unnamed Item
• A survey of dynamic network flows
• A fast algorithm for the generalized parametric minimum cut problem and applications
• Efficient continuous-time dynamic network flow algorithms
• Faster Algorithms for the Quickest Transshipment Problem
• The Quickest Transshipment Problem
• Optimal dynamic routing in communication networks with continuous traffic
• Maximum-throughput dynamic network flows
• Minimum Convex Cost Dynamic Network Flows
• Optimal Congestion Control in Single Destination Networks
• Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
• A new approach to the maximum-flow problem
• A continuous-time network simplex algorithm
• An optimal control approach to dynamic routing in networks
• A Class of Continuous Network Flow Problems
• The quickest flow problem
• Maximal, Lexicographic, and Dynamic Network Flows
• An Algorithm for a Class of Continuous Linear Programs
• A Study of General Dynamic Network Programs with Arc Time-Delays
• A Fast Parametric Maximum Flow Algorithm and Applications
• An adaptive discretization algorithm for a class of continuous network programs
• Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
• An Algorithm for Universal Maximal Dynamic Flows in a Network
• Continuous-Time Flows in Networks

This page was built for publication: Universally maximum flow with piecewise-constant capacities