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 条

[31] Bilevel Programming Model for Minimum-Cost Travel Time Data Collection with Time Windows
Yu, Haifeng
Chien, Steven I-Jy
Ting, Ching-Jung
TRANSPORTATION RESEARCH RECORD, 2010, (2197) : 29 - 35
[32] Minimum-aggregate-concave-cost multicommodity flows in strong-series-parallel networks
Ward, JA
MATHEMATICS OF OPERATIONS RESEARCH, 1999, 24 (01) : 106 - 129
[33] Linear and O(n log n) time minimum-cost matching algorithms for quasi-convex tours
Buss, SR
Yianilos, PN
SIAM JOURNAL ON COMPUTING, 1998, 27 (01) : 170 - 201
[34] FINDING MINIMUM-COST TO TIME RATIO CYCLES WITH SMALL INTEGRAL TRANSIT TIMES
HARTMANN, M
ORLIN, JB
NETWORKS, 1993, 23 (06) : 567 - 574
[35] Algorithms for minimum-cost paths in time-dependent networks with waiting policies
Dean, BC
NETWORKS, 2004, 44 (01) : 41 - 46
[36] Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow
Chen, Li
Kyng, Rasmus
Liu, Yang P.
Peng, Richard
Gutenberg, Maximilian Probst
Sachdeva, Sushant
COMMUNICATIONS OF THE ACM, 2023, 66 (12) : 85 - 92
[37] Minimum-cost single-source 2-splittable flow
Kolliopoulos, SG
INFORMATION PROCESSING LETTERS, 2005, 94 (01) : 15 - 18
[38] A study of minimum-cost tree problem with response-time bound in information network
Shinomiya, N
Tamura, H
Watanabe, H
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2001, E84A (02) : 638 - 646
[39] Study of minimum-cost tree problem with response-time bound in information network
Shinomiya, Norihiko, 2001,
[40] Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
Khodayifar, Salman
OPTIMIZATION LETTERS, 2021, 15 (03) : 1009 - 1026

← 1 2 3 4 5 →