Study of minimum-cost tree problem with response-time bound in information network

被引：0

作者：

机构：

[1] Shinomiya, Norihiko

[2] Tamura, Hiroshi

[3] Watanabe, Hitoshi

来源：

Shinomiya, Norihiko | 2001年

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[1] 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
[2] MINIMUM-COST SPANNING TREE AS A PATH-FINDING PROBLEM
MAGGS, BM
PLOTKIN, SA
INFORMATION PROCESSING LETTERS, 1988, 26 (06) : 291 - 293
[3] MINIMUM-COST TRANSMISSION OF INFORMATION
BLACHMAN, NM
INFORMATION AND CONTROL, 1964, 7 (04): : 508 - &
[4] Submodularity of minimum-cost spanning tree games
Kobayashi, Masayuki
Okamoto, Yoshio
NETWORKS, 2014, 63 (03) : 231 - 238
[5] An exact approach for the Minimum-Cost Bounded-Error Calibration Tree problem
Iago A. Carvalho
Marco A. Ribeiro
Annals of Operations Research, 2020, 287 : 109 - 126
[6] EFFICIENCY OF THE PRIMAL NETWORK SIMPLEX ALGORITHM FOR THE MINIMUM-COST CIRCULATION PROBLEM
TARJAN, RE
MATHEMATICS OF OPERATIONS RESEARCH, 1991, 16 (02) : 272 - 291
[7] MINIMUM-COST MULTICOMMODITY NETWORK FLOWS
TOMLIN, JA
OPERATIONS RESEARCH, 1966, 14 (01) : 45 - &
[8] A LAGRANGEAN HEURISTIC FOR THE CAPACITATED CONCAVE MINIMUM-COST NETWORK FLOW PROBLEM
LARSSON, T
MIGDALAS, A
RONNQVIST, M
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 78 (01) : 116 - 129
[9] An exact approach for the Minimum-Cost Bounded-Error Calibration Tree problem
Carvalho, Iago A.
Ribeiro, Marco A.
ANNALS OF OPERATIONS RESEARCH, 2020, 287 (01) : 109 - 126
[10] ON THE MINIMUM-COST PROJECT SCHEDULE - RESPONSE
WU, Y
LI, C
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1995, 23 (04): : 467 - 467

← 1 2 3 4 5 →