A SUCCESSIVE SHORTEST-PATH ALGORITHM FOR THE ASSIGNMENT PROBLEM

被引：0

|

作者：

ENGQUIST, M

机构：

来源：

INFOR | 1982年 / 20卷 / 04期

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：370 / 384

页数：15

相关论文

共 50 条

[41] A FACTORING APPROACH FOR THE STOCHASTIC SHORTEST-PATH PROBLEM
HAYHURST, KJ
SHIER, DR
OPERATIONS RESEARCH LETTERS, 1991, 10 (06) : 329 - 334
[42] STRING ALGORITHM FOR SHORTEST-PATH IN DIRECTED NETWORKS
KLEE, V
OPERATIONS RESEARCH, 1964, 12 (03) : 428 - &
[43] THE VARIANCE-CONSTRAINED SHORTEST-PATH PROBLEM
SIVAKUMAR, RA
BATTA, R
TRANSPORTATION SCIENCE, 1994, 28 (04) : 309 - 316
[44] A SHORTEST AUGMENTING PATH ALGORITHM FOR THE SEMI-ASSIGNMENT PROBLEM
KENNINGTON, J
WANG, Z
OPERATIONS RESEARCH, 1992, 40 (01) : 178 - 187
[45] A NEW POLYNOMIALLY BOUNDED SHORTEST-PATH ALGORITHM
GLOVER, F
KLINGMAN, D
PHILLIPS, N
OPERATIONS RESEARCH, 1985, 33 (01) : 65 - 73
[46] THE SHORTEST-PATH PROBLEM WITH 2 OBJECTIVE FUNCTIONS
HENIG, MI
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1986, 25 (02) : 281 - 291
[47] ALGORITHM 562 - SHORTEST-PATH LENGTHS [H]
PAPE, U
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1980, 6 (03): : 450 - 455
[48] A NEW VARIANT OF THE PARTITIONING SHORTEST-PATH ALGORITHM
PHILLIPS, NV
DISCRETE APPLIED MATHEMATICS, 1986, 13 (2-3) : 207 - 212
[49] THE MINIMUM-COVERING SHORTEST-PATH PROBLEM
CURRENT, J
REVELLE, C
COHON, J
DECISION SCIENCES, 1988, 19 (03) : 490 - 503
[50] APPROXIMATION SCHEMES FOR THE RESTRICTED SHORTEST-PATH PROBLEM
HASSIN, R
MATHEMATICS OF OPERATIONS RESEARCH, 1992, 17 (01) : 36 - 42

← 1 2 3 4 5 →