A potential reduction approach to the frequency assignment problem

被引:12
作者
Warners, JP [1 ]
Terlaky, T [1 ]
Roos, C [1 ]
Jansen, B [1 ]
机构
[1] CQM BV,NL-5600 AK EINDHOVEN,NETHERLANDS
关键词
interior point methods; nonlinear optimization; combinatorial optimization; binary programming; frequency assignment;
D O I
10.1016/S0166-218X(96)00139-4
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The frequency assignment problem is the problem of assigning frequencies to transmission links such that either no interference occurs, or the amount of interference is minimized. We present an approximation algorithm for this problem that is inspired by Karmarkar's interior point potential reduction approach to combinatorial optimization problems. A non convex quadratic model of the problem is developed, that is very compact as all interference constraints are incorporated in the objective function. Moreover, optimizing this model may result in finding multiple solutions to the problem simultaneouly. Several preprocessing techniques are discussed. We report on computational experience with both real-life and randomly generated instances.
引用
收藏
页码:251 / 282
页数:32
相关论文
共 22 条
[1]  
AARDAL K, 1995, BRANCH AND CUT ALGOR
[2]  
BLOEMEN AAF, 1992, MATH IND
[3]  
DIKIN II, 1967, DOKL AKAD NAUK SSSR+, V174, P747
[4]   Duality and sensitivity in nonconvex quadratic optimization over an ellipsoid [J].
Flippo, OE ;
Jansen, B .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 94 (01) :167-178
[5]  
Kamath A. P., 1990, Annals of Operations Research, V25, P43, DOI 10.1007/BF02283686
[6]  
KARISCH SE, 1995, 302 CDLDO TU GRAZ I
[7]   A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR-PROGRAMMING [J].
KARMARKAR, N .
COMBINATORICA, 1984, 4 (04) :373-395
[8]   AN INTERIOR POINT ALGORITHM TO SOLVE COMPUTATIONALLY DIFFICULT SET COVERING PROBLEMS [J].
KARMARKAR, N ;
RESENDE, MGC ;
RAMAKRISHNAN, KG .
MATHEMATICAL PROGRAMMING, 1991, 52 (03) :597-618
[9]  
KARMARKAR N., 1990, CONTEMPORARY MATH, V114, P297
[10]  
KHACHIIAN LG, 1979, DOKL AKAD NAUK SSSR+, V244, P1093