A branch-and-cut procedure for the Udine course timetabling problem (Q1761891): Difference between revisions

@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+A mixed-integer programming approach to a class timetabling problem: a case study with gender policies and traffic considerations
+Normal rank
@@ Property / cites work @@
+A computational study of a cutting plane algorithm for university course timetabling
+Normal rank
@@ Property / cites work @@
+On unions and dominants of polytopes
@@ Property / cites work: On unions and dominants of polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time separation algorithms for the three-index assignment polytope
+Normal rank
@@ Property / cites work @@
+Facets of the three-index assignment polytope
@@ Property / cites work: Facets of the three-index assignment polytope / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Three-Index Assignment Problem
+Normal rank
@@ Property / cites work @@
+Towards improving the utilization of university teaching space
+Normal rank
@@ Property / cites work @@
+Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
+Normal rank
@@ Property / cites work @@
+Recent research directions in automated timetabling
+Normal rank
@@ Property / cites work @@
+A supernodal formulation of vertex colouring with applications in course timetabling
+Normal rank
@@ Property / cites work @@
+Penalising Patterns in Timetables: Novel Integer Programming Formulations
+Normal rank
@@ Property / cites work @@
+Decomposition, reformulation, and diving in university course timetabling
+Normal rank
@@ Property / cites work @@
+Cliques, holes and the vertex coloring polytope
@@ Property / cites work: Cliques, holes and the vertex coloring polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Properties of some ILP formulations of a class of partitioning problems
+Normal rank
@@ Property / cites work @@
+A Lagrangian Relaxation Approach To The Classroom Assignment Problem<sup>*</sup>
+Normal rank
@@ Property / cites work @@
+Edmonds polytopes and a hierarchy of combinatorial problems
+Normal rank
@@ Property / cites work @@
+Facets of the graph coloring polytope
@@ Property / cites work: Facets of the graph coloring polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934691
@@ Property / cites work: Q2934691 / rank @@
+Normal rank
@@ Property / cites work @@
+An integer programming formulation for a case study in university timetabling.
+Normal rank
@@ Property / cites work @@
+Efficient solutions for a university timetabling problem through integer programming
+Normal rank
@@ Property / cites work @@
+An automated university course timetabling system developed in a distributed environment: a case study.
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Brick decompositions and the matching rank of graphs
+Normal rank
@@ Property / cites work @@
+Neighborhood portfolio approach for local search applied to timetabling problems
+Normal rank
@@ Property / cites work @@
+Q4033689
@@ Property / cites work: Q4033689 / rank @@
+Normal rank
@@ Property / cites work @@
+Curriculum based course timetabling: new solutions to Udine benchmark instances
+Normal rank
@@ Property / cites work @@
+Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
+Normal rank
@@ Property / cites work @@
+A cutting plane algorithm for graph coloring
@@ Property / cites work: A cutting plane algorithm for graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+A computational approach to enhancing course timetabling with integer programming
+Normal rank
@@ Property / cites work @@
+ITC2007 solver description: a hybrid approach
@@ Property / cites work: ITC2007 solver description: a hybrid approach / rank @@
+Normal rank
@@ Property / cites work @@
+Application of a real-world university-course timetabling model solved by integer programming
+Normal rank
@@ Property / cites work @@
+The worst-case time complexity for generating all maximal cliques and computational experiments
+Normal rank
@@ Property / cites work @@
+School Timetabling—A Case in Large Binary Integer Linear Programming
+Normal rank
@@ Property / cites work @@
+An upper bound for the chromatic number of a graph and its application to timetabling problems
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for graph coloring
@@ Property / cites work: A branch-and-cut algorithm for graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002782
@@ Property / cites work: Q3002782 / rank @@
+Normal rank