Maximum-throughput dynamic network flows

DOI10.1007/BF02591946zbMath0516.90027OpenAlexW2142745220WikidataQ59592750 ScholiaQ59592750MaRDI QIDQ3664790

James B. Orlin

Publication date: 1983

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02591946

zbMATH Keywords

infinite horizonperiodic schedulingvehicle schedulingmaximum throuhput dynamic network flow problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items

Flows in strongly regular periodic dynamic resource networks ⋮ Minimum‐cost flow problems having arc‐activation costs ⋮ A survey of dynamic network flows ⋮ Complexity analysis for maximum flow problems with arc reversals ⋮ Universally maximum flow with piecewise-constant capacities ⋮ Minimization of circuit registers: Retiming revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transient flows in networks
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• Maximal Flow Through a Network
• Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets
• Maximal, Lexicographic, and Dynamic Network Flows
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Flows in infinite graphs