Maximum-throughput dynamic network flows

DOI10.1007/BF02591946MaRDI QIDQ3664790zbMATH OpenOpenAlexWikidataFDO

Authors 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) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A suggested computation for maximal multi-commodity network flows
• Flows in infinite graphs
• Maximal Flow Through a Network
• Maximal, Lexicographic, and Dynamic Network Flows
• Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Transient flows in networks

Cited in

(8)

• Flows in strongly regular periodic dynamic resource networks
• Mixed-integer programming models and heuristic algorithms for the maximum value dynamic network flow scheduling problem
• Complexity analysis for maximum flow problems with arc reversals
• Minimization of circuit registers: Retiming revisited
• Universally maximum flow with piecewise-constant capacities
• A survey of dynamic network flows
• Regular periodic dynamic resource networks
• Minimum‐cost flow problems having arc‐activation costs

This page was built for publication: Maximum-throughput dynamic network flows

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