Sprache:     










































Medien


Kunden



Wissenschaftliche Publikationen

  1. Clemens Nothegger, Alfred Mayer, Andreas M. Chwatal, and Günther R. Raidl. Solving the post enrolment course timetabling problem by ant colony optimization. Annals of Operations Research (2012) 194:325-339  (pdf)
  2. Andreas M. Chwatal and Sandro Pirkwieser. Solving the two-dimensional bin-packing problem with variable bin sizes by greedy randomized adaptive search procedures and variable neighborhood search. In Alexis Quesada-Arencibia et al., editors, Proceedings of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory, Las Palmas de Gran Canaria, Spain, February 6-11, 2011, pages 320-321, 2011.(pdf)
  3. Sandro Pirkwieser, Günther R. Raidl, and Jens Gottlieb. Improved packing and routing of vehicles with compartments. In Alexis Quesada-Arencibia et al., editors, Proceedings of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory, Las Palmas de Gran Canaria, Spain, February 6-11, 2011, pages 302-304, 2011.
  4. Sandro Pirkwieser and Günther R. Raidl. Variable neighborhood search coupled with ILP-based very large neighborhood searches for the (periodic) location-routing problem. In M. J. Blesa et al., editors, Proceedings of Hybrid Metaheuristics - Seventh International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010, volume 6373 of LNCS, pages 174-189. Springer, 2010. (pdf)
  5. Andreas M. Chwatal and Günther R. Raidl. Solving the minimum label spanning tree problem by mathematical programming techniques. Advances in Operations Research, vol. 2011, Article ID 143732, 38 pages, 2011. doi:10.1155/2011/143732 (pdf)
  6. Andreas M. Chwatal and Günther R. Raidl. Solving the minimum label spanning tree problem by ant colony optimization. In Proceedings of GEM 2010, Las Vegas, Nevada, 2010. (pdf)
  7. Andreas M. Chwatal and Günther R. Raidl. Fitting multi-planet transit models to photometric time-data series by evolution strategies. In GECCO '10: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, Portland, Oregon, 2010. ACM Press. (pdf)
  8. Sandro Pirkwieser and Günther R. Raidl. Matheuristics for the periodic vehicle routing problem with time windows. In Proceedings of Matheuristics 2010: third international workshop on model-based metaheuristics, Vienna, Austria, June 28-30, 2010. (pdf)
  9. Sandro Pirkwieser and Günther R. Raidl. Multilevel variable neighborhood search for periodic routing problems. In Peter Cowling and Peter Merz, editors, Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2010, volume 6022 of LNCS, pages 226-238. Springer, 2010. (pdf)
  10. Sandro Pirkwieser and Günther R. Raidl. Multiple variable neighborhood search enriched with ILP techniques for the periodic vehicle routing problem with time windows. In M. J. Blesa et al., editors, Proceedings of Hybrid Metaheuristics - Sixth International Workshop, HM 2009, Udine, Italy, October 16-17, 2009, volume 5818 of LNCS, pages 45-59. Springer, 2009. (pdf)
  11. Andreas M. Chwatal, Günther R. Raidl, and Karin Oberlechner. Solving a $k$-node minimum label spanning arborescence problem to compress fingerprint templates. Journal of Mathematical Modelling and Algorithms, 8:293-334, 2009.(pdf)
  12. Sandro Pirkwieser and Günther R. Raidl. Boosting a variable neighborhood search for the periodic vehicle routing problem with time windows by ILP techniques. In Stefan Voss and Marco Caserta, editors, Proceedings of the 8th Metaheuristic International Conference (MIC 2009), Hamburg, Germany, 13-16 July 2009. (pdf)
  13. Andreas M. Chwatal, Nina Musil, and Günther R. Raidl. Solving a multi-constrained network design problem by lagrangean decomposition and column generation. In M. G. Scutellá et al., editor, Proceedings of the International Network Optimization Conference 2009, Pisa, Italy, April 2009. International Network Optimization Conference 2009. (pdf)
  14. Sandro Pirkwieser and Günther R. Raidl. A column generation approach for the periodic vehicle routing problem with time windows. In Maria Grazia Scutellà et al., editors, Proceedings of the International Network Optimization Conference 2009, Pisa, Italy, 26-29 April 2009. (pdf)
  15. Andreas M. Chwatal and Günther R. Raidl. Fitting rectangular signals to time series data by metaheuristic algorithms. In R. Moreno-Díaz et al., editor, Computer Aided Systems Theory - EUROCAST 2009, volume LNCS 5717 of LNCS, pages 649-656, 2009. Twelfth International Conference on Computer Aided Systems Theory. (pdf)
  16. Sandro Pirkwieser and Günther R. Raidl. A variable neighborhood search for the periodic vehicle routing problem with time windows. In Caroline Prodhon et al., editors, Proceedings of the 9th EU/MEeting on Metaheuristics for Logistics and Vehicle Routing, Troyes, France, 23-24 October 2008. (pdf)
  17. Sandro Pirkwieser, Ruben Ruiz-Torrubiano, and Günther R. Raidl. Exact methods and metaheuristic approaches for deriving high quality fully resolved consensus trees. In Josef Küng, Kristan Schneider, and Roland Wagner, editors, Proceedings of BIRD'08, 2nd International Conference on Bioinformatics Research and Development, Poster Presentations, volume 26 of Schriftenreihe Informatik, pages 115-124, Technical University of Vienna, Austria, 7-9 July 2008. Trauner Verlag. (pdf)
  18. Alfred Mayer, Clemens Nothegger, Andreas M. Chwatal, and Günther R. Raidl. Solving the post enrolment course timetabling problem by ant colony optimization. In Edmund Burke, Michel Gendreau, Bernard Gendron, and Louis-Martin Rousseau, editors, Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling, Montreal, Canada, 2008. (pdf)
  19. Sandro Pirkwieser and Günther R. Raidl. Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms. In Maarten Keijzer et al., editors, GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation, pages 323-330, Atlanta, GA, USA, 12-16 July 2008. ACM. (pdf)
  20. Sandro Pirkwieser, Günther R. Raidl, and Jakob Puchinger. A Lagrangian decomposition/evolutionary algorithm hybrid for the knapsack constrained maximum spanning tree problem. In C. Cotta and J. van Hemert, editors, Recent Advances in Evolutionary Computation for Combinatorial Optimization, volume 153 of Studies in Computational Intelligence, pages 69-85. Springer, 2008.  (pdf)
  21. Andreas M. Chwatal and Günther R. Raidl. Determining orbital elements of extrasolar planets by evolution strategies. In R. Moreno-Díaz et al., editor, Computer Aided Systems Theory - EUROCAST 2007, volume LNCS 4739 of LNCS, pages 870-877, 2007. Eleventh International Conference on Computer Aided Systems Theory.(pdf)
  22. Sandro Pirkwieser, Günther R. Raidl, and Jakob Puchinger. Combining Lagrangian decomposition with an evolutionary algorithm for the knapsack constrained maximum spanning tree problem. In Carlos Cotta and Jano van Hemert, editors, Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2007, volume 4446 of LNCS, pages 176-187. Springer, 2007. (pdf)