Improving heuristics for the frequency assignment problem
From MaRDI portal
(Redirected from Publication:1296060)
Recommendations
Cites work
- scientific article; zbMATH DE number 1008454 (Why is no real title available?)
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
- A tabu search algorithm for frequency assignment
- An exact algorithm for the maximum clique problem
- Bounds for the frequency assignment problem
- Improving heuristics for the frequency assignment problem
- On the use of some known methods for \(T\)-colorings of graphs
- Solving the maximum clique problem using a tabu search approach
- Sur le coloriage des graphs
- \(T\)-colorings of graphs: recent results and open problems
Cited in
(24)- Domination analysis of greedy heuristics for the frequency assignment problem.
- An extraction and expansion approach for graph coloring
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- Models and methods for frequency assignment with cumulative interference constraints
- Coloring large graphs based on independent set extraction
- Graph imperfection. I
- Improving heuristics for the frequency assignment problem
- An heuristic search technique for fixed frequency assignment in non-homogeneous demand systems
- An enumerative algorithm for the frequency assignment problem
- New variable neighborhood search method for minimum sum coloring problem on simple graphs
- Optimal multiple interval assignments in frequency assignment and traffic phasing
- Polyhedral studies for minimum‐span graph labelling with integer distance constraints
- \(L(3,2,1)\)-labeling of triangular and toroidal grids
- A memetic algorithm for graph coloring
- Improving the extraction and expansion method for large graph coloring
- Upper and lower bounds for the fixed spectrum frequency assignment problem. (Abstract of thesis)
- Lower bounding techniques for frequency assignment
- Characteristics of good meta-heuristic algorithms for the frequency assignment problem
- Generation of lower bounds for minimum span frequency assignment
- Algorithms for the generalized weighted frequency assignment problem
- An exact algorithm with learning for the graph coloring problem
- Optimized planning of frequency hopping in cellular networks
- Models and solution techniques for frequency assignment problems
- An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
This page was built for publication: Improving heuristics for the frequency assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296060)
