SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Decomposition, reformulation, and diving in university course timetabling · Study

ArticleShelves

ArticleDecomposition, reformulation, and diving in university course timetabling

Edmund K. Burke2009

OA

Articlegreen2009

Decomposition, reformulation, and diving in university course timetabling

Edmund K. Burke · Jakub Mareček · Andrew J. Parkes · Hana Rudová

80 citations·0/0 files stored·Computers & Operations Research

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Scheduling and Timetabling Solutions Healthcare Operations and Scheduling Optimization Constraint Satisfaction and Optimization

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 80 citations exist upstream.

References

1999A Survey of Automated Timetabling 2002Recent research directions in automated timetabling 2007Replenishment Planning for Stochastic Inventory Systems with Shortage Cost 2003An integer programming formulation for a case study in university timetabling 1998Recent developments in practical course timetabling 2014The practice and theory of automated timetabling 1997Automated University Timetabling: The State of the Art 1999A multistage evolutionary algorithm for the timetable problem

Cited by

2022Educational timetabling: Problems, benchmarks, and state-of-the-art results 2014A fix-and-optimize heuristic for the high school timetabling problem 2011Solution approaches to the course timetabling problem 2014Integer programming methods for large-scale practical classroom assignment problems 2011A branch-and-cut procedure for the Udine Course Timetabling problem 2016Adaptive large neighborhood search for the curriculum-based course timetabling problem

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

2011A branch-and-cut procedure for the Udine Course Timetabling problemarticle · 15 shared references 2015An overview of curriculum-based course timetablingarticle · 10 shared references 2010Curriculum based course timetabling: new solutions to Udine benchmark instancesarticle · 9 shared references 2010Complex university course timetablingarticle · 8 shared references 2005A Computational Study of a Cutting Plane Algorithm for University Course Timetablingarticle · 8 shared references 2010A supernodal formulation of vertex colouring with applications in course timetablingarticle · 7 shared references

Details

Year2009

Typearticle

Published2009-03-14

VenueComputers & Operations Research

ISSN-L0305-0548

Languageen

Citations80

Files0 public / 0

ShelfScheduling and Timetabling Solutions

Identifiers

doi10.1016/j.cor.2009.02.023

openalex_workW2070313595

Links

Imported from OpenAlex (CC0) — nothing here is generated.

2012A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem

2011Solving effectively the school timetabling problem using particle swarm optimization