Jakob Puchinger

Recent Publications

Metaheuristic Hybrids
Chapter in Handbook of Metaheuristics (Michel Gendreau and Jean Yves Potvin), pages 385-417, 2019, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-19.pdf
Metaheuristics for Solving a Multimodal Home-Healthcare Scheduling Problem
Central European Journal of Operations Research, volume 23, number 1, pages 89-113, 2015.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/hiermann-13.pdf
Hybrid Metaheuristics in Combinatorial Optimization: A Survey
Applied Soft Computing, volume 11, pages 4135-4151, 2011.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/blum-11.pdf
A Brief Survey on Hybrid Metaheuristics
Proceedings of BIOMA 2010 – 4th International Conference on Bioinspired Optimization Methods and their Applications (B. Filipic and J. Silc), pages 3-16, 2010.
Metaheuristic Hybrids
Chapter in Handbook of Metaheuristics (Michel Gendreau and Jean Yves Potvin), volume 146 of International Series in Operations Research & Management Science, pages 469-496, 2010, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-08a.pdf
The Multidimensional Knapsack Problem: Structure and Algorithms
INFORMS Journal on Computing, volume 22, number 2, pages 250-265, 2010.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/puchinger-07.pdf
Hybrid Metaheuristics
Chapter in CPAIOR 10th Anniversary (M. Milano and P. Van Hentenryck), 2009, Springer.
Note: to appear
MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics
Chapter in Matheuristics – Hybridizing Metaheuristics and Mathematical Programming (V. Maniezzo and T. Stützle and S. Voss), volume 10 of Annals of Information Systems, pages 71-102, 2009, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/puchinger-09.pdf
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem
Chapter in Recent Advances in Evolutionary Computation for Combinatorial Optimization (C. Cotta and J. van~Hemert), volume 153 of Studies in Computational Intelligence, pages 69-85, 2008, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/pirkwieser-07a.pdf
Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
Chapter in Hybrid Metaheuristics – An Emergent Approach for Combinatorial Optimization (C. Blum and M. J. Blesa Augilera and A. Roli and M. Sampels), volume 114 of Studies in Computational Intelligence, pages 31-62, 2008, Springer.
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem
2007, Technical report TR 186-1-07-03, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem
Evolutionary Computation in Combinatorial Optimization – EvoCOP~2007 (Carlos Cotta and Jano van~Hemert), volume 4446 of LNCS, pages 176-187, 2007, Springer.
Models and Algorithms for Three-Stage Two-Dimensional Bin Packing
European Journal of Operational Research, volume 183, number 3, pages 1304-1327, 2007.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/puchinger-04b.pdf
The Multidimensional Knapsack Problem: Structure and Algorithms
2007, Technical report TR 186-1-07-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search
2006, Technical report TR 186-1-06-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
Combining Metaheuristics and Integer Programming for Solving Cutting and Packing Problems
January 2006, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~R.~Raidl and U.~Pferschy
The Core Concept for the Multidimensional Knapsack Problem
Evolutionary Computation in Combinatorial Optimization – EvoCOP~2006 (Jens Gottlieb and Günther R. Raidl), volume 3906 of LNCS, pages 195-208, 2006, Springer.
Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification
Proceedings of the First International Work-Conference on the Interplay Between Natural and Artificial Computation, Part II, volume 3562 of LNCS, pages 41-53, 2005, Springer.
Relaxation Guided Variable Neighborhood Search
Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen and Nenad Mladenović and José A. Moreno Pérez and Belén Melián Batista and J. Marcos Moreno-Vega), 2005.
An Evolutionary Algorithm for Column Generation in Integer Programming: an Effective Approach for 2D Bin Packing
Parallel Problem Solving from Nature – PPSN~VIII (X. Yao et. al), volume 3242 of LNCS, pages 642-651, 2004, Springer.
Models and Algorithms for Three-Stage Two-Dimensional Bin Packing
2004, Technical report TR 186-1-04-04, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
Solving a Real-World Glass Cutting Problem
Evolutionary Computation in Combinatorial Optimization – EvoCOP~2004 (Jens Gottlieb and Günther R. Raidl), volume 3004 of LNCS, pages 162-173, 2004, Springer.
Verfahren zur Lösung eines Glasverschnittproblems
May 2003, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and G. Koller