CALMA

Algorithms for radio link frequency assignment: The CALMA project The radio link frequency assignment problem occurs when a network of radio links has to be established. Each link must be assigned an operating frequency from a given domain. The assignment has to satisfy certain restrictions so as to limit the interference between links. The number of frequencies used is to be minimized. Problems of this type were investigated within the CALMA project by a consortium consisting of research groups from Delft, Eindhoven, London, Maastricht, Norwich, and Toulouse. The participants developed optimization algorithms based on branch-and-cut and constraint satisfaction, and approximation techniques including a variety of local search methods, genetic algorithms, neural networks, and potential reduction. These algorithms were tested and compared on a set of real-life instances.


References in zbMATH (referenced in 84 articles , 1 standard article )

Showing results 1 to 20 of 84.
Sorted by year (citations)

1 2 3 4 5 next

  1. Srivastav, Anand; Shirazi Sheykhdarabadi, Elmira; Kliemann, Lasse: Price of anarchy for graph coloring games with concave payoff (2017)
  2. Chaudhry, Aizaz U.; Chinneck, John W.; Hafez, Roshdy H.M.: Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks (2016)
  3. Liberti, Leo; Marchant, Thierry; Martello, Silvano: Twelve surveys in operations research (2016)
  4. Orden, David; Marsa-Maestre, Ivan; Gimenez-Guzman, Jose Manuel; de la Hoz, Enrique: Bounds on spectrum graph coloring (2016)
  5. Clautiaux, François; Dell’Amico, Mauro; Iori, Manuel; Khanafer, Ali: Lower and upper bounds for the bin packing problem with fragile objects (2014)
  6. Kranjc, Jaka; Lužar, Borut; Mockovčiaková, Martina; Soták, Roman: Note on coloring of double disk graphs (2014)
  7. Blöchliger, Ivo; Zufferey, Nicolas: Multi-coloring and job-scheduling with assignment and incompatibility costs (2013)
  8. Calamoneri, Tiziana: Optimal $L(\delta_1,\delta_2,1)$-labeling of eight-regular grids (2013)
  9. Calamoneri, T.; Sinaimeri, B.: $L(2,1)$-labeling of oriented planar graphs (2013)
  10. Chrobak, Marek; Jeż, Łukasz; Sgall, Jiří: Better bounds for incremental frequency allocation in bipartite graphs (2013)
  11. Kiatmanaroj, Kata; Artigues, Christian; Houssin, Laurent; Messine, Frédéric: Frequency assignment in a SDMA satellite communication system with beam decentring feature (2013)
  12. Segura, Carlos; Segredo, Eduardo; León, Coromoto: Scalability and robustness of parallel hyperheuristics applied to a multiobjectivised frequency assignment problem (2013)
  13. Araujo, J.; Bermond, J-C.; Giroire, F.; Havet, F.; Mazauric, D.; Modrzejewski, R.: Weighted improper colouring (2012)
  14. Blair, Jean R.S.; Manne, Fredrik: An efficient self-stabilizing distance-2 coloring algorithm (2012)
  15. Cornillier, Fabien; Pécora, José Eduardo jun.; Charles, Vincent: A variable depth search branching (2012)
  16. Gualandi, Stefano; Malucelli, Federico: A simple branching scheme for vertex coloring problems (2012)
  17. Lewis, Rhydian; Thompson, Jonathan M.; Mumford, Christine L.; Gillard, Jonathan: A wide-ranging computational comparison of high-performance graph colouring algorithms (2012)
  18. Chicano, Francisco; Whitley, L.Darrell; Alba, Enrique; Luna, Francisco: Elementary landscape decomposition of the frequency assignment problem (2011)
  19. Delle Donne, Diego; Marenco, Javier: A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (2011)
  20. Lewis, R.; Song, X.; Dowsland, K.; Thompson, J.: An investigation into two bin packing problems with ordering and orientation implications (2011)

1 2 3 4 5 next