Professur für Informatik (Effiziente Algorithmen und Kombinatorische Optimierung)

Address:
Cauerstraße 11
91058 Erlangen


Related Project(s)


AlKoP: Algorithmen für kombinatorische Probleme
Prof. Dr. Rolf Wanka
(13/03/2017)


Timetabling: Timetabling at the School of Engineering
Prof. Dr. Rolf Wanka
(01/04/2009 - 31/03/2018)


PSO: Partikelschwarm-Optimierung
Prof. Dr. Rolf Wanka
(24/07/2008 - 28/08/2020)



Publications (Download BibTeX)

Go to first page Go to previous page 1 of 3 Go to next page Go to last page

Mühlenthaler, M., Raß, A., Schmitt, M., Siegling, A., & Wanka, R. (2017). Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax. In ACM New York, NY, USA (Eds.), Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (pp. 13-24). Copenhagen, Denmark, DK.
Raß, A., Schmitt, M., & Wanka, R. (2015). Explanation of Stagnation at Points that are not Local Optima in Particle Swarm Optimization by Potential Analysis. In ACM New York, NY, USA (Eds.), Companion of Proc. 17th Genetic and Evolutionary Computation Conference (GECCO) (pp. 1463-1464). Madrid, Spain, ES.
Raß, A., Schmitt, M., & Wanka, R. (2015). Explanation of Stagnation at Points that are not Local Optima in Particle Swarm Optimization by Potential Analysis [Extended Version].
Schmitt, M., & Wanka, R. (2015). Particle Swarm Optimization Almost Surely Finds Local Optima. Theoretical Computer Science, 561A, 57-72. https://dx.doi.org/10.1016/j.tcs.2014.05.017
Schmitt, M., Wanka, R., & Schwab, L. (2015). Multimodal Medical Image Registration Using Particle Swarm Optimization with Influence of the Data's Initial Orientation. In Proc. 12th IEEE Conf. on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB) (pp. 403-410). Niagara Falls, CA.
Mühlenthaler, M., & Wanka, R. (2014). Fairness in Academic Course Timetabling. Annals of Operations Research. https://dx.doi.org/10.1007/s10479-014-1553-2
Lange, V., Schmitt, M., & Wanka, R. (2014). Towards a Better Understanding of the Local Attractor in Particle Swarm Optimization: Speed and Solution Quality. In Proc. International Conference on Adaptive and Intelligent Systems (ICAIS) (pp. 90-99). Bournemouth, UK: Springer Verlag.
Bassimir, B., Schmitt, M., & Wanka, R. (2014). How Much Forcing is Necessary to Let the Results of Particle Swarms Converge? In Proc. Int. Conf. on Swarm Intelligence Based Optimization (ICSIBO) (pp. 98-105).
Mühlenthaler, M., & Wanka, R. (2014). The Connectedness of Clash-free Timetables. In Proc. 10th Int. Conf. on the Practice and Theory of Automated Timetabling (PATAT) (pp. 330-346). York, UK.
Aliee, H., Glaß, M., Wanka, R., & Teich, J. (2014). Automatic Graph-based Success Tree Construction and Analysis. In Proc. 60th Annual Reliability and Maintainability Symposium (RAMS) (pp. 563-569). Colorado Springs, Colorado, USA.
Mühlenthaler, M., & Wanka, R. (2013). A Decomposition of the Max-min Fair Curriculum-based Course Timetabling Problem: The Impact of Solving Subproblems to Optimality. In Proc. 6th Multidisciplinary International Scheduling Conference: Theory and Applications (pp. 300-313). Gent, BE.
Schmitt, M., & Wanka, R. (2013). Exploiting Independent Subformulas: A Faster Approximation Scheme for #k-SAT. Information Processing Letters, 113, 337-344. https://dx.doi.org/10.1016/j.ipl.2013.02.013
Schmitt, M., & Wanka, R. (2013). Particles Prefer Walking Along the Axes: Experimental Insights into the Behavior of a Particle Swarm. In Companion of Proc. 15th Genetic and Evolutionary Computation Conference (pp. 17-18). Amsterdam, NL.
Schmitt, M., & Wanka, R. (2013). Particle Swarm Optimization Almost Surely Finds Local Optima. In Proc. 15th Genetic and Evolutionary Computation Conference (pp. 1629-1636). Amsterdam, NL: Elsevier.
Riess, C., Strehl, V., & Wanka, R. (2012). The Spectral Relation between the Cube-Connected Cycles and the Shuffle-Exchange Network. In GI (Eds.), Proc. 10th Workshop on Parallel Systems and Algorithms (PASA) of the 25th Int. Conf. on Architecture of Computing Systems (ARCS) (pp. 505-516). München, DE.
Mühlenthaler, M., & Wanka, R. (2012). Fairness in Academic Timetabling. In Proc. 9th Int. Conf. on the Practice and Theory of Automated Timetabling (PATAT) (pp. 114-130). Son, NO.
Helwig, S., Neumann, F., & Wanka, R. (2011). Velocity Adaptation in Particle Swarm Optimization. In Handbook of Swarm Intelligence (pp. 155-173). Heidelberg: Springer.
Omeltschuk, L., Helwig, S., Mühlenthaler, M., & Wanka, R. (2011). Heterogeneous Constraint Handling for Particle Swarm Optimization. In Proc. IEEE Swarm Intelligence Symposium (SIS) (pp. 37-43). Paris, FR: New York, NY, USA: IEEE Press.
Angermeier, J., Sibirko, E., Wanka, R., & Teich, J. (2011). Bitonic Sorting on Dynamically Reconfigurable Architectures. In Proc. IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW) (pp. 314-317). Anchorage, AL, US: New York, NY, USA: IEEE Press.
Hoffmann, M., Mühlenthaler, M., Helwig, S., & Wanka, R. (2011). Discrete Particle Swarm Optimization for TSP: Theoretical Results and Experimental Evaluations. In Bouchachia A. (Eds.), Proc. International Conference on Adaptive and Intelligent Systems (ICAIS) (pp. 416-427). Klagenfurt: Berlin, Heidelberg: Springer-Verlag.

Last updated on 2016-05-05 at 04:59