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

共 50 条

[1] Tight Lower Bound for the Channel Assignment Problem
Socala, Arkadiusz
[J]. ACM TRANSACTIONS ON ALGORITHMS, 2016, 12 (04)
[2] A NEW LOWER BOUND FOR THE QUADRATIC ASSIGNMENT PROBLEM
SERGEYEV, SI
[J]. USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1987, 27 (11-12): : 130 - 136
[3] A NEW LOWER BOUND FOR THE QUADRATIC ASSIGNMENT PROBLEM
CARRARESI, P
MALUCELLI, F
[J]. OPERATIONS RESEARCH, 1992, 40 : S22 - S27
[4] A new lower bound for the frequency assignment problem
Tcha, DW
Chung, YJ
Choi, TJ
[J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 1997, 5 (01) : 34 - 39
[5] A NEW LOWER BOUND VIA PROJECTION FOR THE QUADRATIC ASSIGNMENT PROBLEM
HADLEY, SW
RENDL, F
WOLKOWICZ, H
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 1992, 17 (03) : 727 - 739
[6] AN IMPROVED ASSIGNMENT LOWER BOUND FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM
STEWART, WR
[J]. OPERATIONS RESEARCH LETTERS, 1985, 4 (02) : 55 - 60
[7] Lower Bound on Bandwidth for Feasible Channel Assignment in Multimedia Cellular Networks
Audhya, Goutam K.
Sinha, Koushik
Sinha, Bhabani P.
[J]. 2008 2ND INTERNATIONAL CONFERENCE ON INTERNET MULTIMEDIA SERVICES ARCHITECTURE AND APPLICATION (IMSAA), 2008, : 121 - +
[8] Lower bounds from tile covers for the channel assignment problem
Janssen, JCM
Wentzell, TE
Fitzpatrick, SL
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 18 (04) : 679 - 696
[9] A branch and bound algorithm for the quadratic assignment problem using a lower bound based on linear programming
Ramakrishnan, KG
Resende, MGC
Pardalos, PM
[J]. STATE OF THE ART IN GLOBAL OPTIMIZATION: COMPUTATIONAL METHODS AND APPLICATIONS, 1996, 7 : 57 - 73
[10] A New Lower Bound for the Towers of Hanoi Problem
Grosu, Codrut
[J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2016, 23 (01):

← 1 2 3 4 5 →