CONTINUOUS NETWORK PROGRAMMING.

被引：0
|
作者：
Anderson, E.J. [1 ]
Philpott, A.B. [1 ]
机构：
[1] Cambridge Univ, Cambridge, Engl, Cambridge Univ, Cambridge, Engl
来源：
Cambridge University, Engineering Department, (Technical Report) CUED/F-CAMS | 1986年
关键词：
ELECTRIC NETWORKS - Topology - MATHEMATICAL TECHNIQUES - Algorithms;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Given a network having costs and upper bound constraints on the flows in its arcs, the minimum-cost network flow problem is that of finding flows which satisfy a flow-conservation constraint at each node and minimize the total cost of the flow. If the arc capacities vary as functions of time, and storage is permitted at the nodes of the network, then the problem becomes an infinite-dimensional linear program with a network structure. We describe an algorithm to solve such problems. This algorithm is a continuous-time version of the network simplex algorithm.
引用
收藏
相关论文
共 50 条
12345