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 条
  • [31] Didactic programming. Core items
    Leston, Tania Vieites
    DE SoToMAyoR, I. D. A. N. S. alvAREz
    Portela, C. vARElA
    BORDON-REVISTA DE PEDAGOGIA, 2023, 75 (03):
  • [32] Didactic programming. Core items
    Gallego Jimenez, Gloria
    REVISTA DE EDUCACION, 2023, (399): : 271 - 274
  • [33] An overview of study abroad programming.
    McQuiddy, IW
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 1996, 211 : 86 - CHED
  • [34] COMPUTER SOFTWARE AND SYSTEM PROGRAMMING.
    Kogan, B.I.
    Programming and Computer Software (English Translation of Programmirovanie), 1979, 5 (03): : 193 - 200
  • [35] ON REGULARITY CONDITIONS IN MATHEMATICAL PROGRAMMING.
    PENOT, JEAN PAUL
    1982, (N 19): : 167 - 199
  • [36] DATAFLOW ARCHITECTURES FOR LOGIC PROGRAMMING.
    Sastry, A.V.S.
    Patnaik, L.M.
    Silc, Jurij
    Elektrotehniski Vestnik/Electrotechnical Review, 1988, 55 (01): : 9 - 19
  • [37] STABILITY OF THE PROBLEM OF CUBIC PROGRAMMING.
    Andronov, V.G.
    Belousov, E.G.
    Moscow University computational mathematics and cybernetics, 1987, (01) : 38 - 44
  • [38] PROBLEM OF DISCRETE ADDITIVE PROGRAMMING.
    Teplitskiy, MG.
    1600, (20):
  • [39] 32000 SUPPORT FOR MODULAR PROGRAMMING.
    Hausmann, Guenther
    Electronic Engineering (London), 1987, 59 (721): : 29 - 30
  • [40] INDETERMINATE CONSTRUCTOR FOR APPLICATIVE PROGRAMMING.
    Friedman, Daniel P.
    Wise, David S.
    Conference Record of the Annual ACM Symposium on Principles of Programming Languages, 1980, : 245 - 250
12345