Jakob Puchinger

From PubADS

Jump to: navigation, search

Please visit my new website.



You can find an archival version of my old website below.







Univ.Ass. Dipl.-Ing. Dr.techn.

Jakob Puchinger
Jakob Puchinger

Contents

Address

Algorithms and Data Structures Group
Institute of Computer Graphics and Algorithms (E186)
Vienna University of Technology
Favoritenstraße 9-11 / 1861
A-1040 Vienna, Austria

Contact Information

Email : puchinger (at) ads.tuwien.ac.at

Research Interests

Teaching Responsibilities / Lehre

Please note: All pages related to teaching are written in German.

  • Praktika und Diplomarbeiten zu aktuellen Forschungsthemen
  • Supverised Theses
  1. Daniel Lichtenberger.
    An extended local branching framework and its application to the multidimensional knapsack problem.
    Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, March 2005.
    supervised by G. Raidl and J. Puchinger.
    (PDF-file).


Other Interests in the Field of Computer Science

  • Computer Graphics (scientific visualization and photorealistic rendering)
  • Medical Computer Science
  • Artificial Intelligence (knowledge bases, neural networks)

Publications

Refereed Journal Articles

  1. Jakob Puchinger and Günther R. Raidl.
    Models and algorithms for three-stage two-dimensional bin packing.
    European Journal of Operational Research, Feature Issue on Cutting and Packing, to appear 2006.
    (a previous technical report version: PDF-file).


Refereed Conference Papers

  1. Jakob Puchinger, Günther R. Raidl, and Gabriele Koller.
    Solving a real-world glass cutting problem.
    In Jens Gottlieb and Günther R. Raidl, editors, Evolutionary Computation in Combinatorial Optimization - EvoCOP 2004, volume 3004 of LNCS, pages 162-173. Springer, 2004.
    (web page at Springer, PDF-file © Springer-Verlag).

  2. Jakob Puchinger and Günther R. Raidl.
    An evolutionary algorithm for column generation in integer programming: an effective approach for 2D bin packing.
    In X. Yao et. al, editor, Parallel Problem Solving from Nature - PPSN VIII, volume 3242 of LNCS, pages 642-651. Springer, 2004.
    (web page at Springer, PDF-file © Springer-Verlag).

  3. Jakob Puchinger and Günther R. Raidl.
    Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification.
    In Proceedings of the First International Work-Conference on the Interplay Between Natural and Artificial Computation, volume 3562 of LNCS, pages 41-53. Springer, 2005.
    (web page at Springer, PDF-file © Springer-Verlag).

  4. Jakob Puchinger, Günther R. Raidl, and Martin Gruber.
    Cooperating memetic and branch-and-cut algorithms for solving the multidimensional knapsack problem.
    In Proceedings of MIC2005, the 6th Metaheuristics International Conference, pages 775-780, Vienna, Austria, 2005.
    (PDF-file).

  5. Jakob Puchinger and Günther R. Raidl.
    Relaxation guided variable neighborhood search.
    In Proceedings of the XVIII Mini EURO Conference on VNS, Tenerife, Spain, 2005.
    (PDF-file).


Theses

  1. Jakob Puchinger.
    Verfahren zur Lösung eines Glasverschnittproblems.
    Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, May 2003.
    supervised by G. Raidl and G. Koller.
    (PDF-file).

  2. Jakob Puchinger.
    Combining Metaheuristics and Integer Programming for Solving Cutting and Packing Problems.
    PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, January 2006.
    supervised by G. R. Raidl and U. Pferschy.
    (PDF-file).


Research Reports

  1. Jakob Puchinger and Günther R. Raidl.
    Models and algorithms for three-stage two-dimensional bin packing.
    Technical Report TR 186-1-04-04, Institute of Computer Graphics and Algorithms, Vienna University of Technology, 2004.
    submitted to EJOR.
    (PDF-file).

  2. Jakob Puchinger and Günther R. Raidl.
    Bringing order into the neighborhoods: Relaxation guided variable neighborhood search.
    Technical Report TR 186-1-06-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology, 2006.
    submitted to Journal of Heuristics.
    (PDF-file).


Conference Posters and Presentations

  1. Let's Bring Order Into the Neighborhoods: Guiding Variable Neighborhood Search.
    Third Joint Operations Research Days. September 15-16 2005, IBM Zürich Research Lab, Rüschlikon, Switzerland.
  2. Cooperating memetic and branch-and-cut algorithms for solving the multidimensional knapsack problem.
    Sixth Metaheuristics International Conference (MIC).Vienna, Austria, August 22-26, 2005.
  3. Combining metaheuristics and exact algorithms for solving Combinatorial optimization problems. Poster
    Einsteins in the City. A Student Research Conference at The City College of New York, USA, April 11-12, 2005.
  4. Algorithmen zur Lösung von Glasverschnittproblemen.
    Third Workshop of the Austrian Working Group on Metaheuristics, Vienna University of Technology, Austria, April 6, 2004.
  5. An evolutionary algorithm for column generation in integer programming: an effective approach for 2D bin packing.
    8th International Conference on Parallel Problem Solving from Nature (PPSN VIII), Birmingham, UK, September 2004.
  6. Solving a real-world glass cutting problem.
    Evolutionary Computation in Combinatorial Optimization - EvoCOP 2004, Coimbra, Portugal, April 2004.

Visited Events

  1. EvoNet Summer School 2003 in evolutionary computing,
    University of Parma, Italy, 24-31 August 2003.
  2. ADONET DOCTORAL SCHOOL IN DISCRETE SYSTEMS OPTIMIZATION,
    EPFL, Chair of Operations Research (ROSO), Lausanne, Switzerland, June 21 to July 2, 2004.

Organizational Activities

  • Program commitee member of:
    • 4th European Conference on
      Evolutionary Computation in Combinatorial Optimization (EvoCOP 2004), Coimbra, Portugal, April 2004.
    • 5th European Conference on
      Evolutionary Computation in Combinatorial Optimization (EvoCOP 2005), Lausanne, Switzerland, March/April 2005.
    • 6th European Conference on
      Evolutionary Computation in Combinatorial Optimization (EvoCOP 2006), Budapest, Hungary, April 2006.
    • Evolutionary Computation and Optimization Track
      at the 19th ACM Symposium on Applied Computing - SAC 2004, Nicosia, Cyprus, March 2004.
    • Evolutionary Computation and Optimization Track
      at the 20th ACM Symposium on Applied Computing - SAC 2005, Santa Fe, New Mexico (USA), March 2005.
    • Evolutionary Computation and Optimization Track
      at the 21th ACM Symposium on Applied Computing - SAC 2006, Dijon, France, April 2006.
    • Evolutionary Combinatorial Optimization Track
      at the Genetic and Evolutionary Computation Conference - GECCO 2005 Washington, D.C., USA, June 2005.
    • Evolutionary Combinatorial Optimization Track
      at the Genetic and Evolutionary Computation Conference - GECCO 2006 Seattle, WA, USA, July 2006.
  • Reviewer for:
    • Central European Journal of Operations Research, since May 2004.
Views
Personal tools