DUALITY AND DISTANCE CONSTRAINTS FOR THE NON-LINEAR P-CENTER PROBLEM AND COVERING PROBLEM ON A TREE NETWORK

被引：28

作者：

TANSEL, BC

FRANCIS, RL

LOWE, TJ

CHEN, ML

机构：

[1] UNIV FLORIDA,GAINESVILLE,FL 32611

[2] PURDUE UNIV,W LAFAYETTE,IN 47907

来源：

OPERATIONS RESEARCH | 1982年 / 30卷 / 04期

关键词：

D O I：

10.1287/opre.30.4.725

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：725 / 744

页数：20

共 28 条

[1]

Chan A. W., 1976, Transportation Science, V10, P35, DOI 10.1287/trsc.10.1.35

[2] AN O((N LOG P)2) ALGORITHM FOR THE CONTINUOUS P-CENTER PROBLEM ON A TREE [J].

CHANDRASEKARAN, R ;

TAMIR, A .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (04) :370-375

[3] LOCATION ON TREE NETWORKS - P-CENTRE AND N-DISPERSION PROBLEMS [J].

CHANDRASEKARAN, R ;

DAUGHETY, A .

MATHEMATICS OF OPERATIONS RESEARCH, 1981, 6 (01) :50-57

[4]

CHANDRASEKARAN R, 1982, UNPUB MATH OPNS RES

[5] MATCHINGS AND TRANSVERSALS IN HYPERGRAPHS, DOMINATION AND INDEPENDENCE IN TREES [J].

COCKAYNE, EJ ;

HEDETNIEMI, ST ;

SLATER, PJ .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1979, 26 (01) :78-80

[6]

Dearing P. M., 1974, Transportation Science, V8, P333, DOI 10.1287/trsc.8.4.333

[7] MINIMAX LOCATION PROBLEMS WITH NON-LINEAR COSTS [J].

DEARING, PM .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS, 1977, 82 (01) :65-72

[8] CONVEX LOCATION PROBLEMS ON TREE NETWORKS [J].

DEARING, PM ;

FRANCIS, RL ;

LOWE, TJ .

OPERATIONS RESEARCH, 1976, 24 (04) :628-642

[9] DISTANCE CONSTRAINTS FOR TREE NETWORK MULTIFACILITY LOCATION PROBLEMS [J].

FRANCIS, RL ;

LOWE, TJ ;

RATLIFF, HD .

OPERATIONS RESEARCH, 1978, 26 (04) :570-596

[10] NOTE ON A NON-LINEAR MINIMAX LOCATION PROBLEM IN TREE NETWORKS [J].

FRANCIS, RL .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS, 1977, 82 (01) :73-80

← 1 2 3 →