Minimum Convex Cost Dynamic Network Flows

DOI10.1287/MOOR.9.2.190MaRDI QIDQ3685538zbMATH OpenOpenAlexFDO

Authors James B. Orlin

Publication date 1984

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

Full work available at URL https://semanticscholar.org/paper/514e26ba06edfd75b7cb73040d700a2ce9b2dafd

zbMATH Keywords

dynamic flowfinite directed networkinfinite horizon integer programmingminimum convex cost flownetwork flows evolving over time

Mathematics Subject Classification ID

Paths and cycles (05C38) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1918689
• Constructing maximal dynamic flows from static flows
• Minimum cost time-varying network flow problems
• A minimum concave-cost dynamic network flow problem with an application to lot-sizing
• scientific article; zbMATH DE number 1984104

Cited in

(27)

• Minimization of circuit registers: Retiming revisited
• Optimal distribution strategies with cyclic demands
• A continuous-time average-cost flexible manufacturing and operator scheduling model solved by deconvexification over time
• One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs
• Minimum-cost flows in unit-capacity networks
• A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
• Universally maximum flow with piecewise-constant capacities
• Solving the convex cost integer dual network flow problem
• A minimum concave-cost dynamic network flow problem with an application to lot-sizing
• scientific article; zbMATH DE number 1342118 (Why is no real title available?)
• Optimal Rounding of Instantaneous Fractional Flows Over Time
• A Min Cost Flow Solution for Dynamic Assignment Problems in Networks with Storage Devices
• A feedback strategy for periodic network flows
• A critical survey on the network optimization algorithms for evacuation planning problems
• Minimum cost dynamic flows: the series-parallel case
• scientific article; zbMATH DE number 5173820 (Why is no real title available?)
• Solving a Time-Space Network Formulation for the Convoy Movement Problem
• Modular circulation and applications to traffic management
• Modular circulation and applications to traffic management
• Time-varying minimum cost flow problems
• Minimum‐cost flow problems having arc‐activation costs
• Minimal-cost network flow problems with variable lower bounds on arc flows
• Duality in convex minimum cost flow problems on infinite networks and hypernetworks
• One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs
• A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem
• Mixed-integer programming models and heuristic algorithms for the maximum value dynamic network flow scheduling problem
• A survey of dynamic network flows

This page was built for publication: Minimum Convex Cost Dynamic Network Flows

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