Pages that link to "Item:Q5524918"

The following pages link to An upper bound for the chromatic number of a graph and its application to timetabling problems (Q5524918):

Displayed 50 items.

• A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816) ‎ (← links)
• Elective course student sectioning at Danish high schools (Q284401) ‎ (← links)
• Operational research in education (Q319179) ‎ (← links)
• A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) ‎ (← links)
• Vertex arboricity and vertex degrees (Q343708) ‎ (← links)
• Best monotone degree conditions for graph properties: a survey (Q489335) ‎ (← links)
• A generalization of interval edge-colorings of graphs (Q602763) ‎ (← links)
• A multiobjective framework for heavily constrained examination timetabling problems (Q613763) ‎ (← links)
• An introduction to timetabling (Q759645) ‎ (← links)
• Three new upper bounds on the chromatic number (Q765327) ‎ (← links)
• Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks (Q780266) ‎ (← links)
• Lower bounds for the clique and the chromatic numbers of a graph (Q790829) ‎ (← links)
• \((p,k)\)-coloring problems in line graphs (Q817821) ‎ (← links)
• A survey of search methodologies and automated system development for examination timetabling (Q835639) ‎ (← links)
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) ‎ (← links)
• Minimum partition of an independence system into independent sets (Q1013303) ‎ (← links)
• Decomposition, reformulation, and diving in university course timetabling (Q1038298) ‎ (← links)
• A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) ‎ (← links)
• Numerical experiences with graph coloring algorithms (Q1070239) ‎ (← links)
• Welsh-Powell opposition graphs (Q1115450) ‎ (← links)
• An existential problem of a weight-controlled subset and its application to school timetable construction (Q1115806) ‎ (← links)
• Sequential coloring versus Welsh-Powell bound (Q1121275) ‎ (← links)
• A comparison of bounds for the chromatic number of a graph (Q1159685) ‎ (← links)
• Chromatic optimisation: Limitations, objectives, uses, references (Q1162931) ‎ (← links)
• The smallest hard-to-color graph (Q1185079) ‎ (← links)
• Approximation algorithms for combinatorial problems (Q1213733) ‎ (← links)
• Some observations on the determination of an upper bound for the clique number of a graph (Q1220089) ‎ (← links)
• A randomised heuristical algorithm for estimating the chromatic number of a graph (Q1262784) ‎ (← links)
• A sequential coloring algorithm for finite sets (Q1297462) ‎ (← links)
• Periodic assignment and graph colouring (Q1329789) ‎ (← links)
• Mutual exclusion scheduling (Q1365931) ‎ (← links)
• On the closure of graphs under substitution (Q1377871) ‎ (← links)
• On the equality of the partial Grundy and upper ochromatic numbers of graphs (Q1415544) ‎ (← links)
• An integer programming formulation for a case study in university timetabling. (Q1417497) ‎ (← links)
• Developing a scalable hybrid MPI/OpenMP unstructured finite element model (Q1645631) ‎ (← links)
• Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581) ‎ (← links)
• Online algorithms for the maximum \(k\)-colorable subgraph problem (Q1652561) ‎ (← links)
• A cellular memetic algorithm for the examination timetabling problem (Q1652614) ‎ (← links)
• Partially concurrent open shop scheduling with integral preemptions (Q1698281) ‎ (← links)
• Practices in timetabling in higher education institutions: a systematic review (Q1730752) ‎ (← links)
• Solving the examination timetabling problem in GPUs (Q1736620) ‎ (← links)
• CasADi: a software framework for nonlinear optimization and optimal control (Q1741124) ‎ (← links)
• A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) ‎ (← links)
• A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) ‎ (← links)
• Linear combinations of heuristics for examination timetabling (Q1761893) ‎ (← links)
• An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem (Q1761902) ‎ (← links)
• A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) ‎ (← links)
• Hybrid heuristics for examination timetabling problem (Q1774877) ‎ (← links)
• Recognition of some perfectly orderable graph classes (Q1811119) ‎ (← links)
• Comparison of metaheuristic algorithms for examination timetabling problem (Q1885092) ‎ (← links)