Lower bounding techniques for frequency assignment
From MaRDI portal
Publication:1292811
DOI10.1016/S0012-365X(99)90037-7zbMATH Open0956.90057OpenAlexW4210471073MaRDI QIDQ1292811FDOQ1292811
Publication date: 18 March 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90037-7
Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)
Cites Work
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Symmetric traveling salesman problems
- Title not available (Why is that?)
- Improving heuristics for the frequency assignment problem
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
- On the use of some known methods for \(T\)-colorings of graphs
- A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph
- Bounds for the frequency assignment problem
Cited In (8)
- Generation of lower bounds for minimum span frequency assignment
- Upper and lower bounds for the fixed spectrum frequency assignment problem. (Abstract of thesis)
- Optimized planning of frequency hopping in cellular networks
- Models and solution techniques for frequency assignment problems
- Lower Bounds from Tile Covers for the Channel Assignment Problem
- Lower bounds for fixed spectrum frequency assignment
- On interference graphs
- An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Improving heuristics for the frequency assignment problem 👍 👎
- An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem 👍 👎
- Generation of lower bounds for minimum span frequency assignment 👍 👎
- Lower bounds for fixed spectrum frequency assignment 👍 👎
This page was built for publication: Lower bounding techniques for frequency assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292811)
