Polyhedral studies for minimum‐span graph labelling with integer distance constraints
From MaRDI portal
Publication:5438551
DOI10.1111/j.1475-3995.2007.00577.xzbMath1146.90083MaRDI QIDQ5438551
Publication date: 24 January 2008
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2007.00577.x
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- \(T\)-colorings of graphs: recent results and open problems
- Improving heuristics for the frequency assignment problem
- Bounds for the frequency assignment problem
- Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
- On the monotonization of polyhedra
- Frequency assignment in cellular phone networks
- Channel loading in private mobile radio networks
- Characteristics of good meta-heuristic algorithms for the frequency assignment problem
- Generation of lower bounds for minimum span frequency assignment
- Facets of the graph coloring polytope
- Optimising channel assignments for private mobile radio networks in the UHF 2 band
- A channel assignment problem for optical networks modelled by Cayley graphs
- Generalised graph colouring by a hybrid of local search and constraint programming
- Models and solution techniques for frequency assignment problems
- Minimizing the span \(d\)-walks to compute optimum frequency assignments.
