A branch-and-cut procedure for the Udine course timetabling problem
From MaRDI portal
(Redirected from Publication:1761891)
Recommendations
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- A computational study of a cutting plane algorithm for university course timetabling
- A new adjustment of the branch and price algorithm for university course timetabling
- Strong bounds with cut and column generation for class-teacher timetabling
- A computational approach to enhancing course timetabling with integer programming
Cites work
- scientific article; zbMATH DE number 166078 (Why is no real title available?)
- A Lagrangian Relaxation Approach To The Classroom Assignment Problem*
- A branch-and-cut algorithm for graph coloring
- A computational approach to enhancing course timetabling with integer programming
- A computational study of a cutting plane algorithm for university course timetabling
- A cutting plane algorithm for graph coloring
- A mixed-integer programming approach to a class timetabling problem: a case study with gender policies and traffic considerations
- A supernodal formulation of vertex colouring with applications in course timetabling
- An Algorithm for the Three-Index Assignment Problem
- An automated university course timetabling system developed in a distributed environment: a case study.
- An integer programming formulation for a case study in university timetabling.
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Application of a real-world university-course timetabling model solved by integer programming
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- Brick decompositions and the matching rank of graphs
- Cliques, holes and the vertex coloring polytope
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- Decomposition, reformulation, and diving in university course timetabling
- Edmonds polytopes and a hierarchy of combinatorial problems
- Efficient solutions for a university timetabling problem through integer programming
- Facets of the graph coloring polytope
- Facets of the three-index assignment polytope
- Finding a heaviest triangle is not harder than matrix multiplication
- ITC2007 solver description: a hybrid approach
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Linear-time separation algorithms for the three-index assignment polytope
- Maximum matching and a polyhedron with 0,1-vertices
- Neighborhood portfolio approach for local search applied to timetabling problems
- Network flows. Theory, algorithms, and applications.
- On unions and dominants of polytopes
- Penalising patterns in timetables: novel integer programming formulations
- Properties of some ILP formulations of a class of partitioning problems
- Recent research directions in automated timetabling
- School Timetabling—A Case in Large Binary Integer Linear Programming
- Setting the research agenda in automated timetabling: the second international timetabling competition
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Towards improving the utilization of university teaching space
Cited in
(25)- Integer programming ensemble of temporal relations classifiers
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
- An overview of curriculum-based course timetabling
- A new adjustment of the branch and price algorithm for university course timetabling
- Fairness in academic course timetabling
- Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
- Timetable construction: the algorithms and complexity perspective
- Facet-generating procedures for the maximum-impact coloring polytope
- Facet-generating procedures for the maximum-impact coloring polytope
- An exact algorithm for the edge coloring by total labeling problem
- A computational study of a cutting plane algorithm for university course timetabling
- Preprocessing and cutting planes with conflict graphs
- Operational research in education
- Preprocessing and an improved MIP model for examination timetabling
- Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling
- The maximum-impact coloring polytope
- A new lower bound for curriculum-based course timetabling
- Flow formulations for curriculum-based course timetabling
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
- An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
- The generalized balanced academic curriculum problem with heterogeneous classes
- Adaptive tabu search for course timetabling
- Answer set programming as a modeling language for course timetabling
- Benders decomposition for curriculum-based course timetabling
- Optimized planning of nursing curricula in dual vocational schools focusing on the German health care system
This page was built for publication: A branch-and-cut procedure for the Udine course timetabling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761891)
