Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Michael Sampels"'
Autor:
Michael Sampels
Publikováno v:
Discrete Applied Mathematics. 138:195-202
The transmission of a connected graph G is defined as the sum of all distances in G. A lower bound for the transmission, which can be regarded as a generalization of the Moore bound, was derived by Cerf et al. Graphs with a transmission attaining thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::086cbde40cbac408e1e68b28d55b0524
https://doi.org/10.1016/s0166-218x(03)00294-4
https://doi.org/10.1016/s0166-218x(03)00294-4
Autor:
Michael Sampels, Christian Blum
Publikováno v:
Journal of Mathematical Modelling and Algorithms. 3:285-308
We deal with the application of ant colony optimization to group shop scheduling, which is a general shop scheduling problem that includes, among others, the open shop scheduling problem and the job shop scheduling problem as special cases. The contr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ddc1b25fb8b2ab5af5b6e3bd07b5277
https://doi.org/10.1023/b:jmma.0000038614.39977.6f
https://doi.org/10.1023/b:jmma.0000038614.39977.6f
This book constitutes the refereed proceedings of the 8th International Workshop on Hybrid Metaheuristics, HM 2013, held in Ischia, Italy, in May 2013. The 16 revised full papers presented were carefully reviewed and selected from 30 submissions. The
Publikováno v:
Journal of Mathematical Modelling and Algorithms. 5:1-3
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2eeb61110774469a5e5042ff55abba7f
https://doi.org/10.1007/s10852-005-9028-8
https://doi.org/10.1007/s10852-005-9028-8
Autor:
Michael Sampels
Publikováno v:
Parallel Processing and Applied Mathematics ISBN: 9783540219460
PPAM
PPAM
The transmission of a strongly connected digraph D is defined as the sum of all distances in D. A lower bound for the transmission in terms of the order n and the maximal outdegree Δ + of D can be regarded as a generalization of the Moore bound for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::46c8d8ecacde6072b43df20746dd7418
https://doi.org/10.1007/978-3-540-24669-5_6
https://doi.org/10.1007/978-3-540-24669-5_6
The International Workshop on Hybrid Metaheuristics was established with the aim of providing researchers and scholars with a forum for discussing new ideas and research on metaheuristics and their integration with techniques typical of other?elds. T
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540009764
EvoWorkshops
EvoWorkshops
Two ant algorithms solving a simplified version of a typical university course timetabling problem are presented -Ant Colony System and MAX-MIN Ant System. The algorithms are tested over a set of instances from three classes of the problem. Results a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b5a2ab6ca2ad205aa0a490752a2d56fc
https://doi.org/10.1007/3-540-36605-9_31
https://doi.org/10.1007/3-540-36605-9_31
Autor:
Ben Paechter, Joshua Knowles, Michael Sampels, Luís Paquete, Mauro Birattari, Marco Dorigo, Max Manfrin, Olivia Rossi-Doria, Luca Maria Gambardella, Monaldo Mastrolilli, Marco Chiarandini, Thomas Stützle
Publikováno v:
Practice and Theory of Automated Timetabling IV ISBN: 9783540406990
PATAT
PATAT
The main goal of this paper is to attempt an unbiased comparison of the performance of straightforward implementations of five different metaheuristics on a university course timetabling problem. In particular, the metaheuristics under consideration
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b3905a59d3ea3501ac6e0851d3b5fcae
https://doi.org/10.1007/978-3-540-45157-0_22
https://doi.org/10.1007/978-3-540-45157-0_22