default search action
Michael Sampels
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1998
- [b1]Michael Sampels:
Algebraische Konstruktion effizienter Verbindungsnetzwerke. University of Oldenburg, Germany, Logos Verlag 1998, ISBN 978-3-89722-051-5, pp. I-VIII, 1-208
Journal Articles
- 2006
- [j3]Christian Blum, Andrea Roli, Michael Sampels:
Editorial. J. Math. Model. Algorithms 5(1): 1-3 (2006) - 2004
- [j2]Michael Sampels:
Vertex-symmetric generalized Moore graphs. Discret. Appl. Math. 138(1-2): 195-202 (2004) - [j1]Christian Blum, Michael Sampels:
An Ant Colony Optimization Algorithm for Shop Scheduling Problems. J. Math. Model. Algorithms 3(3): 285-308 (2004)
Conference and Workshop Papers
- 2003
- [c13]Krzysztof Socha, Michael Sampels, Max Manfrin:
Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art. EvoWorkshops 2003: 334-345 - [c12]Michael Sampels:
On Generalized Moore Digraphs. PPAM 2003: 42-49 - 2002
- [c11]Krzysztof Socha, Joshua D. Knowles, Michael Sampels:
A MAX-MIN Ant System for the University Course Timetabling Problem. Ant Algorithms 2002: 1-13 - [c10]Christian Blum, Michael Sampels:
Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations. IEEE Congress on Evolutionary Computation 2002: 1558-1563 - [c9]Christian Blum, Michael Sampels, Mark Zlochin:
On A Particularity In Model-based Search. GECCO 2002: 35-42 - [c8]Olivia Rossi-Doria, Michael Sampels, Mauro Birattari, Marco Chiarandini, Marco Dorigo, Luca Maria Gambardella, Joshua D. Knowles, Max Manfrin, Monaldo Mastrolilli, Ben Paechter, Luís Paquete, Thomas Stützle:
A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem. PATAT 2002: 329-354 - [c7]Michael Sampels, Christian Blum, Monaldo Mastrolilli, Olivia Rossi-Doria:
Metaheuristics for Group Shop Scheduling. PPSN 2002: 631-640 - [c6]Christian Blum, Michael Sampels:
When Model Bias Is Stronger than Selection Pressure. PPSN 2002: 893-902 - 2001
- [c5]Michael Sampels:
Visualization of Automorphisms and Vertex-Symmetry. PPAM 2001: 35-41 - 1999
- [c4]Michael Sampels, Mykhailo Vilents:
Symmetric Interconnection Networks in the Design of Switches for WANs and LANs. MMB (Kurzvorträge) 1999: 43-47 - 1997
- [c3]Michael Sampels:
Massively parallel architectures and systolic communication. PDP 1997: 322-334 - [c2]Michael Sampels:
Large Networks with Small Diameter. WG 1997: 288-302 - 1996
- [c1]Michael Sampels:
Cayley Graphs as Interconnection Networks: A Case Study. Parcella 1996: 67-76
Editorship
- 2013
- [e10]Maria J. Blesa, Christian Blum, Paola Festa, Andrea Roli, Michael Sampels:
Hybrid Metaheuristics - 8th International Workshop, HM 2013, Ischia, Italy, May 23-25, 2013. Proceedings. Lecture Notes in Computer Science 7919, Springer 2013, ISBN 978-3-642-38515-5 [contents] - 2010
- [e9]Maria J. Blesa, Christian Blum, Günther R. Raidl, Andrea Roli, Michael Sampels:
Hybrid Metaheuristics - 7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010. Proceedings. Lecture Notes in Computer Science 6373, Springer 2010, ISBN 978-3-642-16053-0 [contents] - 2009
- [e8]Maria J. Blesa, Christian Blum, Luca Di Gaspero, Andrea Roli, Michael Sampels, Andrea Schaerf:
Hybrid Metaheuristics, 6th International Workshop, HM 2009, Udine, Italy, October 16-17, 2009. Proceedings. Lecture Notes in Computer Science 5818, Springer 2009, ISBN 978-3-642-04917-0 [contents] - 2008
- [e7]Maria J. Blesa, Christian Blum, Carlos Cotta, Antonio J. Fernández, José E. Gallardo, Andrea Roli, Michael Sampels:
Hybrid Metaheuristics, 5th International Workshop, HM 2008, Málaga, Spain, October 8-9, 2008. Proceedings. Lecture Notes in Computer Science 5296, Springer 2008, ISBN 978-3-540-88438-5 [contents] - [e6]Christian Blum, María J. Blesa Aguilera, Andrea Roli, Michael Sampels:
Hybrid Metaheuristics, An Emerging Approach to Optimization. Studies in Computational Intelligence 114, Springer 2008, ISBN 978-3-540-78294-0 [contents] - 2007
- [e5]Thomas Bartz-Beielstein, María J. Blesa Aguilera, Christian Blum, Boris Naujoks, Andrea Roli, Günter Rudolph, Michael Sampels:
Hybrid Metaheuristics, 4th International Workshop, HM 2007, Dortmund, Germany, October 8-9, 2007, Proceedings. Lecture Notes in Computer Science 4771, Springer 2007, ISBN 978-3-540-75513-5 [contents] - 2006
- [e4]Francisco Almeida, María J. Blesa Aguilera, Christian Blum, J. Marcos Moreno-Vega, Melquíades Pérez Pérez, Andrea Roli, Michael Sampels:
Hybrid Metaheuristics, Third International Workshop, HM 2006, Gran Canaria, Spain, October 13-15, 2006, Proceedings. Lecture Notes in Computer Science 4030, Springer 2006, ISBN 3-540-46384-4 [contents] - 2005
- [e3]Maria J. Blesa, Christian Blum, Andrea Roli, Michael Sampels:
Hybrid Metaheuristics, Second International Workshop, HM 2005, Barcelona, Spain, August 29-30, 2005, Proceedings. Lecture Notes in Computer Science 3636, Springer 2005, ISBN 3-540-28535-0 [contents] - 2004
- [e2]Christian Blum, Andrea Roli, Michael Sampels:
Hybrid Metaheuristics, First International Workshop, HM 2004, Valencia, Spain, August 22-23, 2004, Proceedings. 2004, ISBN 3-00-015331-4 [contents] - 2002
- [e1]Marco Dorigo, Gianni Di Caro, Michael Sampels:
Ant Algorithms, Third International Workshop, ANTS 2002, Brussels, Belgium, September 12-14, 2002, Proceedings. Lecture Notes in Computer Science 2463, Springer 2002, ISBN 3-540-44146-8 [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint