scientific article; zbMATH DE number 6118222
From MaRDI portal
Publication:3145804
zbMATH Open1253.90137MaRDI QIDQ3145804FDOQ3145804
Authors: Robert Murphey, Panos M. Pardalos, Mauricio G. C. Resende 
Publication date: 23 December 2012
Title of this publication is not available (Why is that?)
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cited In (19)
- Absolute and asymptotic bounds for online frequency allocation in cellular networks
- Labeling trees with a condition at distance two
- Three results on frequency assignment in linear cellular networks
- Minimizing interference in satellite communications using transiently chaotic neural networks
- A column generation and branch-and-cut algorithm for the channel assignment problem
- T-Coloring of product graphs
- Theory of computational complexity. Part 7. Transl. from the Russian
- Better bounds for incremental frequency allocation in bipartite graphs
- A hybrid neural-genetic algorithm for the frequency assignment problem in satellite communications
- Models and solution techniques for frequency assignment problems
- On distance constrained labeling of disk graphs
- Heuristic manipulation, tabu search and frequency assignment
- Systems of pairs of \(q\)-distant representatives, and graph colorings
- Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph
- Frequency assignment problem in satellite communications using differential evolution
- Bandwidth allocation in cellular networks with multiple interferences
- Hierarchical cellular network design with channel allocation
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems
- On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3145804)
