Decomposition, reformulation, and diving in university course timetabling (Q1038298): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2009.02.023 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of very large-scale neighborhood search techniques / 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 local search algorithms for Italian high-school timetabling / 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: Formulating a Mixed Integer Programming Problem to Improve Solvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics of the Branch-Cut-and-Price-Framework SCIP / 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: Q5465123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable colorings of bounded treewidth graphs / 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: Recent research directions in automated timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of evolutionary algorithms in combinatorial optimization / 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: Vehicle routing problem with elementary shortest path based column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring relaxation induced neighborhoods to improve MIP solutions / 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: Neighborhood portfolio approach for local search applied to timetabling problems / 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: Record breaking optimization results using the ruin and recreate principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary Multi-Criterion Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / 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: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general heuristic for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and dynamic cut generation in integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for solving biobjective integer programs / 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: Formulations and Reformulations in Integer Programming / 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: The reformulation of two mixed integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4346087 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2009.02.023 / rank
 
Normal rank

Latest revision as of 14:17, 10 December 2024

scientific article
Language Label Description Also known as
English
Decomposition, reformulation, and diving in university course timetabling
scientific article

    Statements

    Decomposition, reformulation, and diving in university course timetabling (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 November 2009
    0 references
    integer programming
    0 references
    decomposition
    0 references
    reformulation
    0 references
    diving
    0 references
    heuristic
    0 references
    metaheuristic
    0 references
    university course timetabling
    0 references
    soft constraints
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references