Pages that link to "Item:Q2473031"
From MaRDI portal
The following pages link to An improved ant colony optimisation heuristic for graph colouring (Q2473031):
Displaying 19 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)
- Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
- An improved hybrid ant-local search algorithm for the partition graph coloring problem (Q747914) (← 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)
- A new ant colony optimization algorithm for the lower bound of sum coloring problem (Q1951174) (← links)
- On the performance of scatter search for post-enrolment course timetabling problems (Q2015784) (← links)
- Graph based twin cost matrices for unbalanced assignment problem with improved ant colony algorithm (Q2063304) (← 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)
- An ant colony algorithm for graph coloring and labeling problems (Q2858214) (← links)
- Ant Local Search and its efficient adaptation to graph colouring (Q3582660) (← links)
- Ants can colour graphs (Q4367017) (← links)
- Online Optimization of a Color Sorting Assembly Buffer Using Ant Colony Optimization (Q5391957) (← links)