Graph simplex algorithm for solving minimal flow problem of a network

被引：0

|

作者：

Ning, Xuanxi

机构：

来源：

Daqing Shiyou Xueyuan Xuebao/Journal of Daqing Petroleum Institute | / 21卷 / 03期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：477 / 482

相关论文

共 50 条

[1] A NETWORK SIMPLEX ALGORITHM FOR SOLVING THE MINIMUM DISTRIBUTION COST PROBLEM
Wang, I-Lin
Lin, Shiou-Jie
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2009, 5 (04) : 929 - 950
[2] A FORWARD NETWORK SIMPLEX ALGORITHM FOR SOLVING MULTIPERIOD NETWORK FLOW PROBLEMS
ARONSON, JE
CHEN, BD
NAVAL RESEARCH LOGISTICS, 1986, 33 (03) : 445 - 467
[3] A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network
Morrison, David R.
Sauppe, Jason J.
Jacobson, Sheldon H.
INFORMS JOURNAL ON COMPUTING, 2013, 25 (01) : 2 - 12
[4] Network simplex algorithm for the general equal flow problem
Calvete, HI
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 150 (03) : 585 - 600
[5] A new algorithm for solving the feasibility problem of a network flow
Fathabadi, Hassan Salehi
Ghiyasvand, Mehdi
APPLIED MATHEMATICS AND COMPUTATION, 2007, 192 (02) : 429 - 438
[6] A Network Flow Algorithm for Solving Generalized Assignment Problem
Hu, Yongwen
Liu, Qunpo
MATHEMATICAL PROBLEMS IN ENGINEERING, 2021, 2021
[7] Parallel network simplex algorithm for the minimum cost flow problem
Kara, Gokcehan
Ozturan, Can
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2022, 34 (04):
[8] A specialized network simplex algorithm for the constrained maximum flow problem
Caliskan, Cenk
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 210 (02) : 137 - 147
[9] ON STRONGLY POLYNOMIAL VARIANTS OF THE NETWORK SIMPLEX ALGORITHM FOR THE MAXIMUM FLOW PROBLEM
GOLDFARB, D
HAO, JX
OPERATIONS RESEARCH LETTERS, 1991, 10 (07) : 383 - 387
[10] An exterior simplex type algorithm for the Minimum Cost Network Flow Problem
Paparrizos, Konstantinos
Samaras, Nikolaos
Sifaleras, Angelo
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (04) : 1176 - 1190

← 1 2 3 4 5 →