Pages that link to "Item:Q1013410"

The following pages link to A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing (Q1013410):

Displaying 13 items.

• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• Towards objective measures of algorithm performance across instance space (Q336954) (← links)
• A grouping genetic algorithm with controlled gene transmission for the bin packing problem (Q337402) (← links)
• An investigation into two bin packing problems with ordering and orientation implications (Q421577) (← links)
• On the application of graph colouring techniques in round-robin sports scheduling (Q709125) (← links)
• A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
• Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
• Grouping evolution strategies: an effective approach for grouping problems (Q2009978) (← links)
• A 3/2-approximation for big two-bar charts packing (Q2045041) (← links)
• Two-bar charts packing problem (Q2047190) (← links)
• An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs (Q2670556) (← links)
• Exact and approximate methods for the score-constrained packing problem (Q2672111) (← links)
• A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)