Zobrazeno 1 - 3
of 3
pro vyhledávání: '"branch and bound simulated annealing"'
Autor:
Karami, Morteza
Quadratic Assignment Problem (QAP) is known as one of the most difficult combinatorial optimization problems that is classified in the category of NP-hard problems. Quadratic Assignment Problem Library (QAPLIB) is full database of QAPs which contains
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2789::a4cecef488680f27fa84615aeed2a99e
https://hdl.handle.net/11129/1534
https://hdl.handle.net/11129/1534
Autor:
Antkowiak, Łukasz
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
Externí odkaz:
http://urn.kb.se/resolve?urn=urn:nbn:se:bth-6083
Autor:
Antkowiak, Łukasz
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::567217921ddd5679f1b90ff98bdd30f4
http://urn.kb.se/resolve?urn=urn:nbn:se:bth-6083
http://urn.kb.se/resolve?urn=urn:nbn:se:bth-6083