A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem (Q339653): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048957381 / 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: Efficient solutions for a university timetabling problem through integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The teacher assignment problem: A special case of the fixed charge transportation problem / 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: Decomposition, reformulation, and diving in university course timetabling / 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: Application of a real-world university-course timetabling model solved by integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic approach to simultaneous course/student timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: New integer linear programming approaches for course timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposed metaheuristic approach for a real-world university timetabling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive tabu search for course timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and implementation of a course scheduling system using Tabu Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective hybrid algorithm for university course timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean Relaxation Approach to Course Timetabling / 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: Computerised decision aid for timetabling --- a case analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2779799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian relaxation approach to multi-period inventory/distribution planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search embedded simulated annealing for the shortest route cut and fill problem / 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: Applied simulated annealing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:05, 12 July 2024

scientific article
Language Label Description Also known as
English
A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
scientific article

    Statements

    A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem (English)
    0 references
    0 references
    0 references
    0 references
    11 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    timetabling
    0 references
    mathematical programming
    0 references
    Lagrangian relaxation
    0 references
    simulated annealing
    0 references
    0 references
    0 references