Generation of lower bounds for minimum span frequency assignment
From MaRDI portal
Recommendations
Cites work
- A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph
- An exact algorithm for the maximum clique problem
- Bounds for the frequency assignment problem
- scientific article; zbMATH DE number 1865936 (Why is no real title available?)
- Improving heuristics for the frequency assignment problem
- Lower bounding techniques for frequency assignment
Cited in
(7)- Lower bounding techniques for frequency assignment
- Upper and lower bounds for the fixed spectrum frequency assignment problem. (Abstract of thesis)
- Lower bounds for fixed spectrum frequency assignment
- An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
- scientific article; zbMATH DE number 1488080 (Why is no real title available?)
- Price of anarchy for graph coloring games with concave payoff
- Polyhedral studies for minimum‐span graph labelling with integer distance constraints
This page was built for publication: Generation of lower bounds for minimum span frequency assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1602703)