A new lower bound for the channel assignment problem

被引：19

作者：

Smith, DH ^{[1
]}

Hurley, S

Allen, SM

机构：

[1] Univ Glamorgan, Div Math & Comp, Pontypridd CF37 1DL, M Glam, Wales

[2] Univ Wales, Dept Comp Sci, Cardiff CF2 3XF, S Glam, Wales

来源：

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY | 2000年 / 49卷 / 04期

基金：

英国工程与自然科学研究理事会;

关键词：

cellular systems; channel assignment; lower bound;

D O I：

10.1109/25.875238

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The strength of lower bounds for the span in channel assignment problems is discussed with reference to standard benchmark problems. It is shown that in some circumstances current bounds are capable of very significant improvement, The use of methods from mathematical programming is outlined and a new lower bound applicable to cellular problems is presented.

引用

页码：1265 / 1272

页数：8

共 19 条

[1]

Allen SM, 1999, DISCRETE MATH, V197, P41

[2]

ANDERSON LG, 1973, IEEE T COMMUN, V21, P12194

[3] AN EXACT ALGORITHM FOR THE MAXIMUM CLIQUE PROBLEM [J].

CARRAGHAN, R ;

PARDALOS, PM .

OPERATIONS RESEARCH LETTERS, 1990, 9 (06) :375-382

[4] SOME LOWER BOUNDS FOR A CLASS OF FREQUENCY ASSIGNMENT PROBLEMS [J].

GAMST, A .

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 1986, 35 (01) :8-14

[5]

HALE WK, 1981, ELECTROMATIC COMPATI, P47

[6]

HELMAN P, 1991, INTERMEDIATE PROBLEM

[7] FASoft: A system for discrete channel frequency assignment [J].

Hurley, S ;

Smith, DH ;

Thiel, SU .

RADIO SCIENCE, 1997, 32 (05) :1921-1939

[8]

JANSSEN J, 1996, CDAM9617 LOND SCH EC

[9]

Johnson DS, 1996, PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P341

[10]

Leese R, 1996, Z ANGEW MATH MECH, V76, P303

← 1 2 →