Sökning: "branch and bound simulated annealing"

Hittade 1 uppsats innehållade orden branch and bound simulated annealing.

  1. 1. Parallel algorithms of timetable generation

    Master-uppsats, Blekinge Tekniska Högskola/Sektionen för datavetenskap och kommunikation

    Författare :Łukasz Antkowiak; [2013]
    Nyckelord :school timetable; branch and bound simulated annealing; parallel algorithms;

    Sammanfattning : Context: Most of the problem of generating timetable for a school belongs to the class of NP-hard problems. Complexity and practical value makes this kind of problem interesting for parallel computing. Objectives: This paper focuses on Class-Teacher problem with weighted time slots and proofs that it is NP-complete problem. LÄS MER