Polynomial-time simplex method for the maximum k-flow problem

被引：0

作者：

机构：

[1] Wagner, Donald K.

[2] Wan, Hong

来源：

Wagner, Donald K. | 1600年 / 60期

关键词：

Mathematical programming;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[21] On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow
Altmanova, Katerina
Kolman, Petr
Vobornik, Jan
ALGORITHMS AND DATA STRUCTURES, WADS 2019, 2019, 11646 : 14 - 27
[22] A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs
Boyaci, Arman
Ekim, Tinaz
Shalom, Mordechai
INFORMATION PROCESSING LETTERS, 2017, 121 : 29 - 33
[23] 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
[24] A NEW POLYNOMIAL-TIME METHOD FOR A LINEAR COMPLEMENTARITY-PROBLEM
MIZUNO, S
MATHEMATICAL PROGRAMMING, 1992, 56 (01) : 31 - 43
[25] POLYNOMIAL-TIME ALGORITHM FOR THE ORBIT PROBLEM
KANNAN, R
LIPTON, RJ
JOURNAL OF THE ACM, 1986, 33 (04) : 808 - 821
[26] A POLYNOMIAL-TIME SIMPLEX TYPE METHOD FOR SOLVING LINEAR-SYSTEMS OF INEQUALITIES
BREGMAN, LM
CYBERNETICS, 1990, 26 (01): : 106 - 110
[27] A FULLY POLYNOMIAL-TIME PROJECTIVE METHOD
VIAL, JP
OPERATIONS RESEARCH LETTERS, 1988, 7 (01) : 15 - 19
[28] A stable, polynomial-time algorithm for the eigenpair problem
Armentano, Diego
Beltran, Carlos
Buergisser, Peter
Cucker, Felipe
Shub, Michael
JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY, 2018, 20 (06) : 1375 - 1437
[29] A polynomial-time algorithm for the bistable roommates problem
Sethuraman, J
Teo, CP
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 63 (03) : 486 - 497
[30] A NETWORK SIMPLEX-METHOD FOR THE MAXIMUM BALANCED FLOW PROBLEM
CUI, W
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1988, 31 (04) : 551 - 564

← 1 2 3 4 5 →