Algorithms for Solving the Problem for a Minimal Network Circulation with One Side Constraint

被引：0
|
作者：
Nikolova, Mariana [1 ]
机构：
[1] Inst Informat Technol, Sofia 1113, Bulgaria
来源：
CYBERNETICS AND INFORMATION TECHNOLOGIES | 2008年 / 8卷 / 04期
关键词：
Flow with side constraints; bicriteria network flow; one side constraint; min ratio cancelin; scaling;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Two algorithms for solving the problem above are proposed. The first one use scaling technology and solve the continuous problem. The second use the method of min ratio canceling and may solve the integer problem.
引用
收藏
页码：13 / 19
页数：7
相关论文
共 50 条
  • [21] Comparison of Heuristic Algorithms to Solving Mesh Network Path Finding Problem
    Kubacki, Jacek
    Koszalka, Leszek
    Pozniak-Koszalka, Iwona
    Kasprzak, Andrzej
    FCST 2009: PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON FRONTIER OF COMPUTER SCIENCE AND TECHNOLOGY, 2009, : 388 - 392
  • [22] A solving method of an MDP with a constraint by genetic algorithms
    Hirayama, K
    Kawai, H
    MATHEMATICAL AND COMPUTER MODELLING, 2000, 31 (10-12) : 165 - 173
  • [23] NETWORK FLOW PROBLEMS WITH ONE SIDE CONSTRAINT - A COMPARISON OF 3 SOLUTION METHODS
    BELLINGSEIB, K
    MEVERT, P
    MULLER, C
    COMPUTERS & OPERATIONS RESEARCH, 1988, 15 (04) : 381 - 394
  • [24] MORNING COMMUTE PROBLEM IN A TWO-TO-ONE NETWORK WITH PARKING CONSTRAINT
    Liu, Wei
    Yang, Hai
    TRANSPORTATION & LOGISTICS MANAGEMENT, 2012, : 247 - 254
  • [25] Fuzzy algorithms of problem solving
    Chorayan, OG
    Chorayan, GO
    KYBERNETES, 2002, 31 (9-10) : 1300 - 1305
  • [26] On solving quadratically constrained quadratic programming problem with one non-convex constraint
    Keyanpour M.
    Osmanpour N.
    OPSEARCH, 2018, 55 (2) : 320 - 336
  • [27] SOLUTION OF THE PARAMETRIC MINIMAL COST CIRCULATION PROBLEM IN A NETWORK WITH A LINEAR COST FUNCTION
    SEROV, SS
    AUTOMATION AND REMOTE CONTROL, 1980, 41 (12) : 1710 - 1716
  • [28] DUAL SUPPORT METHOD FOR SOLVING A MINIMAL COST FLOW PROBLEM ON A GENERALIZED NETWORK
    KOSTYUKOVA, OI
    AUTOMATION AND REMOTE CONTROL, 1979, 40 (05) : 713 - 721
  • [29] APPROACH TO ANALYSIS AND CONSTRUCTION OF ALGORITHMS FOR SOLVING ONE CLUSTERING PROBLEM ON SIGNED GRAPHS
    Soldatenko, A. A.
    Semenova, D., V
    Ibragimova, E. I.
    PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2024, (64):
  • [30] Solving virtual network resource allocation problems using a Constraint Satisfaction Problem model
    Guenane, Fouad
    Dumas, Pierre Yves
    Nogueira, Michele
    Pujolle, Guy
    2013 FOURTH INTERNATIONAL CONFERENCE ON THE NETWORK OF THE FUTURE (NOF), 2013,
12345