Pages that link to "Item:Q2367012"
From MaRDI portal
The following pages link to On the use of some known methods for \(T\)-colorings of graphs (Q2367012):
Displaying 10 items.
- Algorithms for the generalized weighted frequency assignment problem (Q339680) (← links)
- Lower bounding techniques for frequency assignment (Q1292811) (← links)
- Improving heuristics for the frequency assignment problem (Q1296060) (← links)
- A tabu search algorithm for computing an operational timetable (Q1331550) (← links)
- Bounds for the frequency assignment problem (Q1356496) (← links)
- An enumerative algorithm for the frequency assignment problem (Q1399116) (← links)
- A tabu search algorithm for frequency assignment (Q1919845) (← links)
- An evolutionary approach for bandwidth multicoloring problems (Q2482742) (← links)
- Models and methods for frequency assignment with cumulative interference constraints (Q3499441) (← links)
- Models and solution techniques for frequency assignment problems (Q5920489) (← links)
