Free Access
RAIRO-Oper. Res.
Volume 55, 2021
Regular articles published in advance of the transition of the journal to Subscribe to Open (S2O). Free supplement sponsored by the Fonds National pour la Science Ouverte
Page(s) S1949 - S1967
Published online 02 March 2021
  • G. Audhya, K. Sinha, S. Ghosh and B. Sinha, A survey on the channel assignment problem in wireless networks. Wireless Commun. Mobile Comput. 11 (2011) 583–609. [Google Scholar]
  • G. Chakraborty, An efficient heuristic algorithm for channel assignment problem in cellular radio networks. IEEE Trans. Veh. Technol. 50 (2001) 1528–1539. [Google Scholar]
  • D. Costa, On the use of some known methods for T-coloring of graphs. Ann. Oper. Res. 41 (1999) 343–358. [Google Scholar]
  • R. de Freitas, B. Dias, N. Maculan and J. Szwarcfiter, Distance geometry approach for special graph coloring problems. Preprint arXiv:1606.04978 (2016). [Google Scholar]
  • R. de Freitas, B. Dias, N. Maculan and J. Szwarcfiter, On distance graph coloring problems. Int. Trans. Oper. Res. (2019). DOI: 10.1111/itor.12626. [Google Scholar]
  • B. Dias, Theoretical models and algorithms for optimizing channel assignment in wireless mobile networks. Master’s thesis, Universidade Federal do Amazonas, Brazil (2014). In Portuguese. [Google Scholar]
  • B. Dias, R. de Freitas, N. Maculan and P. Michelon, Solving the bandwidth coloring problem applying constraint and integer programming techniques. Optim. Online (e-print) (2016). Available at [Google Scholar]
  • R. Dorne and J. Hao, Tabu search for graph coloring, T-coloring and set T-colorings, edited by S. Voss, S. Martello, I.H. Osman and C. Roucairol. In: Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization. Springer, New York, NY (1999) 77–92. [Google Scholar]
  • P. Galinier and A. Hertz, A survey of local search methods for graph coloring. Comput. Oper. Res. 33 (2006) 2547–2562. [Google Scholar]
  • M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co, New York, NY (1979). [Google Scholar]
  • A.I. Giortzis and L.F. Turner, Application of mathematical programming to the fixed channel assignment problem in mobile radio networks. IEE Proc. Commun. 144 (1997) 257–264. [Google Scholar]
  • A. Gueham, A. Nagih, H.A. Haddadene and M. Masmoudi, Graph coloring approach with new upper bounds for the chromatic number: team building application. RAIRO:OR 52 (2018) 807–818. [Google Scholar]
  • W. Hale, Frequency assignment: theory and applications. Proc. IEEE 25 (1980) 1497–1514. [Google Scholar]
  • R. Karp, Reducibility among combinatorial problems, edited by R.E. Miller and J.W. Thatcher. In: Complexity of Computer Computations. Plenum Press, New York, NY (1972) 85–103. [Google Scholar]
  • G. Kendall and M. Mohamad, Solving the fixed channel assignment problem in cellular communications using an adaptive local search, edited by E. Burke and M. Trick. In: Vol. 3616 of 5th International Conference for the Practice and Theory of Automated Timetabling (PATAT 2004). Lecture Notes in Computer Science. Springer, Heidelberg (2005). [Google Scholar]
  • S. Kim, A.E. Smith and J. Lee, A memetic algorithm for channel assignment in wireless fdma systems. Comput. Oper. Res. 34 (2007) 1842–1856. [Google Scholar]
  • A. Koster, Frequency assignment: models and algorithms. Ph.D. thesis, Universiteit Maastricht (1999). [Google Scholar]
  • X. Lai and Z. Lü, Multistart iterated tabu search for bandwidth coloring problem. Comput. Oper. Res. 40 (2013) 1401–1409. [Google Scholar]
  • V. Mak, Polyhedral studies for minimum-span graph labelling with integer distance constraints. Int. Trans. Oper. Res. 14 (2007) 105–121. [Google Scholar]
  • E. Malaguti and P. Toth, An evolutionary approach for bandwidth multicoloring problems. Eur. J. Oper. Res. 189 (2008) 638–651. [Google Scholar]
  • E. Malaguti and P. Toth, A survey on vertex coloring problems. Int. Trans. Oper. Res. 17 (2010) 1–34. [Google Scholar]
  • A. Mehrotra and M. Trick, A branch-and-price approach for graph multi-coloring, edited by E.K. Baker, A. Joseph, A. Mehrotra and M. Trick. In: Vol. 37 of Extending the Horizons: Advances in Computing, Optimization, and Decision Technologies. Operations Research/Computer Science Interfaces Series. Springer, New York, NY (2007) 15–29. [Google Scholar]
  • I. Méndez-Díaz and P. Zabala, A Branch-and-Cut algorithm for graph coloring. Dis. Appl. Math. 154 (2006) 826–847. [Google Scholar]
  • V. Phan and S. Skiena, Coloring graphs with a general heuristic search engine. In: Proceedings of the Computational Symposium on Graph Coloring and Its Generalizations. Ithaca, NY (2002) 92–99. [Google Scholar]
  • J.B. Saxe, Embeddability of weighted graphs in k-space is strongly NP-hard. In: Proceedings of 17th Allerton Conference in Communications, Control and Computing. (1979) 480–489. [Google Scholar]
  • M. Trick, A. Mehrotra, and D. Johnson. COLOR02/03/04: Graph coloring and its generalizations. In: Proceedings of the Computational Symposium on Graph Coloring and Its Generalizations. Ithaca, NY (2002). [Google Scholar]
  • S. Varone and N. Zufferey, Three tabu search methods for the MI-FAP applied to 802.11 networks. RAIRO:OR 42 (2008) 501–514. [Google Scholar]
  • M. Vasquez, A. Dupont and D. Habet, Consistency checking within local search applied to the frequency assignment with polarization problem. RAIRO:OR 37 (2003) 311–323. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.