Pages that link to "Item:Q610967"

The following pages link to A supernodal formulation of vertex colouring with applications in course timetabling (Q610967):

Displaying 24 items.

• Operational research in education (Q319179) (← links)
• A new lower bound for curriculum-based course timetabling (Q336544) (← links)
• Generating new test instances by evolving in instance space (Q342041) (← links)
• Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem (Q342121) (← links)
• Fractional programming formulation for the vertex coloring problem (Q402376) (← links)
• A column generation based algorithm for the robust graph coloring problem (Q516837) (← links)
• Quality recovering of university timetables (Q666944) (← links)
• Variable neighborhood descent search based algorithms for course timetabling problem: application to a Tunisian university (Q1687659) (← links)
• \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming (Q1730740) (← links)
• Polyhedral studies of vertex coloring problems: the standard formulation (Q1751160) (← links)
• A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← links)
• Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling (Q1991148) (← links)
• Grouping products for the optimization of production processes: a case in the steel manufacturing industry (Q2184105) (← links)
• The minimum chromatic violation problem: a polyhedral approach (Q2184668) (← links)
• Symmetry-breaking inequalities for ILP with structured sub-symmetry (Q2196292) (← links)
• Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem (Q2281613) (← links)
• An overview of curriculum-based course timetabling (Q2355018) (← links)
• An integer programming approach to b-coloring (Q2419584) (← links)
• Multi-coloring and job-scheduling with assignment and incompatibility costs (Q2449346) (← links)
• Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions (Q2668751) (← links)
• The maximum-impact coloring polytope (Q2968505) (← links)
• Answer set programming as a modeling language for course timetabling (Q5398311) (← links)
• Comments on: ``An overview of curriculum-based course timetabling'' (Q5971109) (← links)
• Mobility offer allocations in corporate settings (Q6114908) (← links)