Pages that link to "Item:Q2473031"

The following pages link to An improved ant colony optimisation heuristic for graph colouring (Q2473031):

Displaying 11 items.

• Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem (Q300032) (← links)
• Towards objective measures of algorithm performance across instance space (Q336954) (← links)
• An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
• On the application of graph colouring techniques in round-robin sports scheduling (Q709125) (← links)
• A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing (Q1013410) (← links)
• Strong valid inequalities for Boolean logical pattern generation (Q1675646) (← links)
• A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
• On the performance of scatter search for post-enrolment course timetabling problems (Q2015784) (← links)
• Simple decentralized graph coloring (Q2397096) (← links)
• A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
• INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING (Q2853412) (← links)