# Minimum Convex Cost Dynamic Network Flows

@article{Orlin1984MinimumCC,
title={Minimum Convex Cost Dynamic Network Flows},
author={James B. Orlin},
journal={Math. Oper. Res.},
year={1984},
volume={9},
pages={190-207}
}
• J. Orlin
• Published 1 May 1984
• Math. Oper. Res.
This paper presents and solves in polynomial time the minimum convex cost dynamic network flow problem, an infinite horizon integer programming problem which involves network flows evolving over time. The model is a finite network in which each arc has an associated transit time for flow to pass through it. An integral amount of flow is to be sent through arcs of the network in each period over an infinite horizon so as to satisfy conservation of flow from some fixed period on. Furthermore, the…

## Figures from this paper

Maximum-throughput dynamic network flows
This paper presents and solves the maximum throughput dynamic network flow problem, an infinite horizon integer programming problem which involves network flows evolving over time, and demonstrates that among those flows with maximum throughput there is a flow which repeats every period.
Optimal Rounding of Instantaneous Fractional Flows Over Time
• Mathematics
SIAM J. Discret. Math.
• 2000
This paper improves upon the previous best algorithm to solve the problem without costs by a factor of k and starts with a stationary fractional flow and uses rounding to transform this into an integral flow.
An approximation algorithm for discrete minimum cost flows over time problem
• 2014
An approximation algorithm for the T-length bounded discrete minimum cost flows over time problem, which aims to determine an s-t flow over time f that satisfies demand d within given time horizon T at minimum cost is introduced.
Minimum Cost Dynamic Flows: The Series-Parallel Case
• Mathematics
IPCO
• 1995
A greedy algorithm is formulated for MCDFP and a full characterization via forbidden subgraphs of the class G of graphs is provided, for which this greedy algorithm always yields an optimum solution (for arbitrary choices of problem parameters).
Minimum‐cost dynamic flows: The series‐parallel case
• Mathematics
Networks
• 2004
A greedy algorithm is formulated for MCDFP and a full characterization via forbidden subgraphs of the class of graphs is provided, for which this greedy algorithm always yields an optimum solution (for arbitrary choices of problem parameters).
Efficient Dynamic Network Flow Algorithms
This thesis introduces the first polynomial algorithms to solve several important dynamic network flow problems by computing chain-decomposable flows, a new class of structured dynamic flows and describes the firstPolynomial algorithm to approximate a universally maximum dynamic flow within a factor of (1 + $\epsilon$), for any $\epSilon>0$.
Optimal Rounding of Fractional Dynamic Flows when Transit Times are Zero
• Computer Science
• 1997
This paper shows that the transshipment problem without costs can be solved using at most log T maximum ow computations and one minimum (convex) cost ow computation, when there is only one sink.
Optimal Rounding of Fractional Dynamic Flows when TransitTimes are
• Computer Science
• 1998
This paper shows that the transshipment problem without costs can be solved using at most log T maximum ow computations and one minimum (convex) cost ow computation, when there is only one sink.
Minimum cost flows over time without intermediate storage
SODA '03
• 2003
It is proved that the minimum cost flow over time never requires storage, and the first approximation scheme for minimum cost flows over time that meets hard cost constraints is provided, while approximating only makespan.
Optimal Rounding of Fractional Dynamic Flows when TransitTimes are Zero
• Computer Science
• 1998
This paper shows that the transshipment problem without costs can be solved using at most log T maximum ow computations and one minimum (convex) cost ow computation, when there is only one sink.

## References

SHOWING 1-10 OF 37 REFERENCES
Maximum-throughput dynamic network flows
This paper presents and solves the maximum throughput dynamic network flow problem, an infinite horizon integer programming problem which involves network flows evolving over time, and demonstrates that among those flows with maximum throughput there is a flow which repeats every period.
Constructing Maximal Dynamic Flows from Static Flows
• Mathematics
• 1958
A network, in which two integers tij the traversal time and cij the capacity are associated with each arc PiPj, is considered with respect to the following question. What is the maximal amount of
FINDING MINIMAL COST-TIME RATIO CIRCUITS,
Abstract : An efficient method is given for finding minimal cost-time ratio circuits in routing problems through the use of the out-of-kilter algorithm. The problem of finding a cycle in a network
FINDING A CYCLE IN A GRAPH WITH MINIMUM COST TO TIME RATIO WITH APPLICATION TO A SHIP ROUTING PROBLEM
• Mathematics
• 1966
Abstract : Associated with each arc of a directed graph are two numbers which will be called arc cost and arc time. The problem is to find that cycle in a graph whose ratio of the sum of arc costs to
Cyclic Scheduling via Integer Programs with Circular Ones
• Economics
Oper. Res.
• 1980
This work identifies a large class of cyclic staffing problems for which special structure permits the ILP to be solved parametrically as a bounded series of network flow problems.
Letter to the Editor - Finding Minimal Cost-Time Ratio Circuits
• B. Fox
• Engineering
Oper. Res.
• 1969
This note presents an efficient method for the solution of the flow-circulation problem, the basis for which is a search for a way to route flow so that the cost-time trade-off is optimal.
Optimal Capacity Scheduling---II
• 1962
The analysis of the capacity scheduling model is extended to situations in which initial capacities exist, and an application of the model to the multicommodity warehousing problem is given.
The NETFORM concept: A more effective model form and solution procedure for large scale nonlinear problems
• Computer Science
ACM '77
• 1977
This paper presents modeling techniques which are mathematically and symbolically linked to network and augmented network structures called the NETFORM (network formulation) concept or approach and shows how this approach has proven to be extremely valuable in both communicating and refining nonlinear and combinatorial relationships.
A primal algorithm for solving a capacitated network flow problem with additional linear constraints
• Computer Science
Networks
• 1977
A variant of the revised simplex method is given for solving capacitated network flow problems with additional linear constraints for pivoting, pricing, and inversion that can result in a substantial reduction of computation over a standard linear programming approach.
Unnetworks, with Applications to Idle Time Scheduling