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 条

[21] MINIMUM CONVEX COST DYNAMIC NETWORK FLOWS
ORLIN, JB
MATHEMATICS OF OPERATIONS RESEARCH, 1984, 9 (02) : 190 - 207
[22] Dynamic network flows for generalized Kirchhoff law
Ostapenko, VV
Pavlygin, AI
CYBERNETICS AND SYSTEMS ANALYSIS, 1996, 32 (03) : 393 - 397
[23] ON THE PROBLEM OF SEARCH FOR A LEXICOGRAPHIC SEQUENCE OF MAXIMAL PROBLEMS WITH CONNECTED CONSTRAINTS
KHYNKU, BS
SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1987, 25 (01): : 19 - 23
[24] MAXIMAL LEXICOGRAPHIC SPECTRA AND RANKS FOR STATES WITH FIXED UNIFORM MARGINS
Li, Xin
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2019, 147 (08) : 3303 - 3315
[25] GENERATING ALL MAXIMAL INDEPENDENT SETS ON TREES IN LEXICOGRAPHIC ORDER
CHANG, YH
WANG, JS
LEE, RCT
INFORMATION SCIENCES, 1994, 76 (3-4) : 279 - 296
[26] ON THE USE OF LEXICOGRAPHIC MIN COST FLOWS IN EVACUATION MODELING
HAMACHER, HW
TUFEKCI, S
NAVAL RESEARCH LOGISTICS, 1987, 34 (04) : 487 - 503
[27] On solving continuous-time dynamic network flows
Hashemi, S. Mehdi
Nasrabadi, Ebrahim
JOURNAL OF GLOBAL OPTIMIZATION, 2012, 53 (03) : 497 - 524
[28] Investigation of Railway Network Capacity by Means of Dynamic Flows
Nikolayzik, Dominik
Maus, Maren
Niessen, Nils
APPLIED SCIENCES-BASEL, 2024, 14 (18):
[29] Dynamic Network Flows with Uncertain Costs belonging to Interval
Shirdel, Gholam Hassan
Rezapour, Hassan
APPLICATIONS AND APPLIED MATHEMATICS-AN INTERNATIONAL JOURNAL, 2016, 11 (01): : 285 - 299
[30] MIN-MAX BOUNDS FOR DYNAMIC NETWORK FLOWS
WILKINSON, WL
NAVAL RESEARCH LOGISTICS, 1973, 20 (03) : 505 - 516

← 1 2 3 4 5 →