Pages that link to "Item:Q1273650"

The following pages link to Graph coloring with adaptive evolutionary algorithms (Q1273650):

Displaying 12 items.

• A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing (Q1013410) (← links)
• Combinatorial optimization in system configuration design (Q1027725) (← links)
• Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art (Q1348274) (← links)
• Spectrum graph coloring and applications to Wi-Fi channel assignment (Q1657008) (← links)
• A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
• Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
• The maximum happy induced subgraph problem: bounds and algorithms (Q2026981) (← links)
• Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173) (← links)
• CHECKCOL: improved local search for graph coloring (Q2458929) (← links)
• Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
• Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
• A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)