MAXIMAL, LEXICOGRAPHIC, AND DYNAMIC NETWORK FLOWS

被引：72

|

作者：

MINIEKA, E ^{[1
]}

机构：

[1] UNIV ILLINOIS,CHICAGO,IL 60680

来源：

OPERATIONS RESEARCH | 1973年 / 21卷 / 02期

关键词：

D O I：

10.1287/opre.21.2.517

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

收藏

页码：517 / 527

页数：11

相关论文

共 50 条

[1] ALGORITHM FOR UNIVERSAL MAXIMAL DYNAMIC FLOWS IN A NETWORK
WILKINSON, WL
OPERATIONS RESEARCH, 1971, 19 (07) : 1602 - +
[2] P-PERIOD MAXIMAL DYNAMIC FLOWS IN A NETWORK
HALPERN, J
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 1976, 7 (12) : 1403 - 1415
[3] CONSTRUCTING MAXIMAL DYNAMIC FLOWS FROM STATIC FLOWS
FORD, LR
FULKERSON, DR
OPERATIONS RESEARCH, 1958, 6 (03) : 419 - 433
[4] MAXIMAL DYNAMIC POLYMATROID FLOWS AND APPLICATIONS
HAMACHER, HW
DISCRETE APPLIED MATHEMATICS, 1986, 15 (01) : 41 - 54
[5] COMPUTING MAXIMAL POLYMATROIDAL NETWORK FLOWS
LAWLER, EL
MARTEL, CU
MATHEMATICS OF OPERATIONS RESEARCH, 1982, 7 (03) : 334 - 347
[6] MAXIMAL NETWORK FLOWS, MATROIDS AND MATCHINGS
MINIEKA, E
JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1975, 79 (1-2): : 59 - 62
[7] MULTI-COMMODITY MAXIMAL DYNAMIC FLOWS
BELLMORE, M
VEMUGANTI, RR
OPERATIONS RESEARCH, 1973, 21 (01) : 10 - 21
[8] A SUGGESTED COMPUTATION FOR MAXIMAL MULTICOMMODITY NETWORK FLOWS
FORD, LR
FULKERSON, DR
MANAGEMENT SCIENCE, 1958, 5 (01) : 97 - 101
[9] CALCULATING MAXIMAL FLOWS IN A NETWORK WITH POSITIVE GAINS
GRINOLD, RC
OPERATIONS RESEARCH, 1973, 21 (02) : 528 - 541
[10] The existence of maximal elements: generalized lexicographic relations
Hougaard, JL
Tvede, M
JOURNAL OF MATHEMATICAL ECONOMICS, 2001, 36 (02) : 111 - 115

← 1 2 3 4 5 →