Approximate minimum-cost multicommodity flows in O(ε-2KNM) time

被引：0

作者：

Grigoriadis, Michael D. ^{[1
]}

Khachiyan, Leonid G. ^{[1
]}

机构：

[1] Dept. of Comp. Sci. Rutgers Univ., New Brunswick, NJ 08903, United States

来源：

Mathematical Programming, Series B | 1996年 / 75卷 / 03期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：477 / 482

共 50 条

[41] A 3/2-approximation algorithm for some minimum-cost graph problems
Basile Couëtoux
James M. Davis
David P. Williamson
Mathematical Programming, 2015, 150 : 19 - 34
[42] A 3/2-approximation algorithm for some minimum-cost graph problems
Couetoux, Basile
Davis, James M.
Williamson, David P.
MATHEMATICAL PROGRAMMING, 2015, 150 (01) : 19 - 34
[43] Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
Salman Khodayifar
Optimization Letters, 2021, 15 : 1009 - 1026
[44] 2 STRONGLY POLYNOMIAL CUT CANCELING ALGORITHMS FOR MINIMUM-COST NETWORK FLOW
ERVOLINA, TR
MCCORMICK, ST
DISCRETE APPLIED MATHEMATICS, 1993, 46 (02) : 133 - 165
[45] Minimum cost flows over time without intermediate storage
Fleischer, L
Skutella, M
PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 66 - 75
[46] ON THE GLOBAL-CONTROLLABILITY OF A MINIMUM-TIME CONTROL PROBLEM FOR A MINIMUM-COST CONTROL PROBLEM IN BANACH-SPACE
MUKHERJEE, RN
INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 1994, 25 (05): : 463 - 471
[47] Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
Fleischer, Lisa
Jain, Kamal
Williamson, David P.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2006, 72 (05) : 838 - 867
[48] Quasi-polynomial time approximation algorithm for low-degree minimum-cost Steiner trees
Könemann, J
Ravi, R
FST TCS 2003: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 2003, 2914 : 289 - 301
[49] The Minimum-cost PD Process Planning and Control Methodology with the Consideration of Resource/Time Constraints and Skill Levels
Chiang, Tzu-An
CONCURRENT ENGINEERING-RESEARCH AND APPLICATIONS, 2009, 17 (04): : 257 - 266
[50] A polynomial time primal network simplex algorithm for minimum cost flows
Orlin, JB
MATHEMATICAL PROGRAMMING, 1997, 78 (02) : 109 - 129

← 1 2 3 4 5 →