LAGRANGIAN-RELAXATION FOR THE STAR-STAR CONCENTRATOR LOCATION PROBLEM - APPROXIMATION ALGORITHM AND BOUNDS

被引：58

作者：

MIRZAIAN, A

机构：

[1] York Univ, Computer Science Dep,, Downsview, Ont, Can, York Univ, Computer Science Dep, Downsview, Ont, Can

来源：

NETWORKS | 1985年 / 15卷 / 01期

关键词：

CONCENTRATOR LOCATION - LAGRANGIAN RELAXATION - STAR-STAR CONCENTRATOR LOCATION PROBLEM (SSCLP);

D O I：

10.1002/net.3230150102

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

(Edited Abstract)

引用

页码：1 / 20

页数：20

共 20 条

[1]

BAHL LR, 1972, P S COMPUTER COMMUNI

[2] LARGE-SCALE NETWORK TOPOLOGICAL OPTIMIZATION [J].

BOORSTYN, RR ;

FRANK, H .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1977, 25 (01) :29-47

[3]

Edmonds J., 1971, COMBINATORIAL STRUCT, P69

[4] A BRANCH-BOUND ALGORITHM FOR PLANT LOCATION [J].

EFROYMSON, MA ;

RAY, TL .

OPERATIONS RESEARCH, 1966, 14 (03) :361-+

[5] DUAL-BASED PROCEDURE FOR UNCAPACITATED FACILITY LOCATION [J].

ERLENKOTTER, D .

OPERATIONS RESEARCH, 1978, 26 (06) :992-1009

[6] ON TELEPROCESSING SYSTEM DESIGN .2. A METHOD FOR APPROXIMATING OPTIMAL NETWORK [J].

ESAU, LR ;

WILLIAMS, KC .

IBM SYSTEMS JOURNAL, 1966, 5 (03) :142-+

[7]

Feldman E., 1966, MANAGE SCI, V12, P670, DOI DOI 10.1287/MNSC.12.9.670

[8]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[9]

Geoffrion A., 1974, MATH PROGRAMMING STU, V2, DOI [10.1007/BFb0120690, DOI 10.1007/BFB0120686]

[10] DUALITY IN NONLINEAR PROGRAMMING - SIMPLIFIED APPLICATIONS-ORIENTED DEVELOPMENT [J].

GEOFFRION, AM .

SIAM REVIEW, 1971, 13 (01) :1-+

← 1 2 →