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

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

Latest revision as of 22:02, 5 July 2024

scientific article
Language Label Description Also known as
English
A branch-and-cut procedure for the Udine course timetabling problem
scientific article

    Statements

    A branch-and-cut procedure for the Udine course timetabling problem (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    integer programming
    0 references
    branch-and-cut
    0 references
    cutting planes
    0 references
    soft constraints
    0 references
    educational timetabling
    0 references
    university course timetabling
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references