Pages that link to "Item:Q1162931"

The following pages link to Chromatic optimisation: Limitations, objectives, uses, references (Q1162931):

Displaying 13 items.

• A generalization of interval edge-colorings of graphs (Q602763) (← links)
• Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
• Bounded vertex colorings of graphs (Q686481) (← links)
• An introduction to timetabling (Q759645) (← links)
• Equitable colorings of bounded treewidth graphs (Q817768) (← links)
• On equitable \(\Delta\)-coloring of graphs with low average degree (Q817775) (← links)
• Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
• Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths (Q1179200) (← links)
• Weighted graphs and university course timetabling (Q1185992) (← links)
• What is my objective function? (Q1278819) (← links)
• The mutual exclusion scheduling problem for permutation and comparability graphs. (Q1401918) (← links)
• Linear combinations of heuristics for examination timetabling (Q1761893) (← links)
• A generalized class-teacher model for some timetabling problems (Q1848400) (← links)