1 |
S. Paul, M. Pal & A. Pal. (2015). L(2, 1)-labeling of interval graphs. Journal of Applied Mathematics and Computing, 49(1). 419-432.
DOI
|
2 |
M. R. Cerioli & D. F. Posner. (2012). On L(2, 1)-coloring split, chordal bipartite, and weakly chordal graphs. Discrete Applied Mathematics, 160(18). 2655-2661.
DOI
|
3 |
D. H. Smith, S. Hurley & S. U. Thiel (1998). Improving heuristics for the frequency assignment problem. European Journal of Operational Research, 107(1). 76-86.
DOI
|
4 |
J. R. Griggs, & R. K. Yeh. (1992). Labelling graphs with a condition at distance 2. SIAM Journal on Discrete Mathematics, 5(4). 586-595.
DOI
|
5 |
F. Harary, & M. Plantholt. (1999). Graphs Whose Radio Coloring Number Equals the Number. Graph Colouring and Applications, 23(23). 99.
|
6 |
L. Liwei & F. Rongshuang. (2010, August). Simulated annealing algorithm in solving frequency assignment problem. In 2010 3rd International Conference on Advanced Computer Theory and Engineering (ICACTE) (Vol. 1, pp. V1-361). IEEE.
|
7 |
V. Maniezzo & A. Carbonaro. (2000). An ANTS heuristic for the frequency assignment problem. Future Generation Computer Systems, 16(8). 927-935.
DOI
|
8 |
G. J. Chang & D. Kuo. (1996). The L(2,1)-labeling problem on graphs. SIAM Journal on Discrete Mathematics, 9(2). 309-316.
DOI
|
9 |
E. K. Burke, E. K. Burke, G. Kendall & G. Kendall. (2014). Search methodologies: introductory tutorials in optimization and decision support techniques. Springer.
|
10 |
F. Glover (1977) Heuristics for Integer programming using surrogate constraints, Decision Sciences, 8(1). 156-166
DOI
|
11 |
H. L. Bodlaender, T. Kloks, R. B. Tan & J. Van Leeuwen (2004). Approximations for λ-colorings of graphs. The Computer Journal, 47(2). 193-204.
DOI
|
12 |
W. K. Hale. (1980). Frequency assignment: Theory and applications. Proceedings of the IEEE, 68(12). 1497-1514.
DOI
|
13 |
S. Vollala, S. Indrajeet, A. D. Joshi, P. S. Tamizharasan & J. Jose. (2017, July). Implementation of algorithms for L (2, 1)-coloring problems. In 2017 8th International Conference on Computing, Communication and Networking Technologies (ICCCNT) (pp. 1-6). IEEE.
|
14 |
K. I. Aardal, A. Hipolito, C. P. M. Van Hoesel, B. Jansen, C. Roos & T. Terlaky. (1996). A branch-and-cut algorithm for the frequency assignment problem. Research Memorandum, 96(011). 3-7.
|
15 |
F. W. Glover & M. Laguna. (1998). Tabu Search. Springer Science & Business Media.
|
16 |
K. I. Aardal, S. P. M. Van Hoesel, A. M. Koster, C. Mannino & A. Sassano. (2007). Models and solution techniques for frequency assignment problems. Annals of Operations Research, 153(1). 79-129.
DOI
|
17 |
T. Park & C. Y. Lee. (1996). Application of the graph coloring algorithm to the frequency assignment problem. Journal of the Operations Research society of Japan, 39(2). 258-265.
DOI
|
18 |
M. Alabau, L. Idoumghar & R. Schott. (2002). New hybrid genetic algorithms for the frequency assignment problem. IEEE Transactions on Broadcasting, 48(1). 27-34.
DOI
|
19 |
J. K. Hao & R. Dorne. (1995, September). Study of genetic search for the frequency assignment problem. In European Conference on Artificial Evolution. (pp. 333-344). Berlin:Springer
|