C. Blum, J. Puchinger, G.R. Raidl, A. Roli.A Brief Survey on Hybrid Metaheuristics.In B. Filipic and J. Silc (Eds.). Proceedings of BIOMA 2010 -- 4th International Conference on Bioinspired Optimization Methods and their Applications, 2010.
Jakob Puchinger, Peter J. Stuckey, Mark Wallace, and Sebastian Brand. Dantzig-Wolfe Decomposition and Branch-and-Price Solving in G12. Research Report, January 2009. Submitted.
Sam Huston, Jakob Puchinger, and Peter J. Stuckey.The Core Concept for 0/1 Integer Programming.In J. Harland and P. Manyem, editors, Proceedings of the Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), CRPIT 77, pages 39-47. ACS, 2008.
Sebastian Brand, Gregory J. Duck, Jakob Puchinger, and Peter J. Stuckey.A Rule-based System for Model Transformation.ModRef'07: 6th International Workshop on Constraint Modelling and Reformulation 2007.
Jakob Puchinger, Peter J. Stuckey, Mark Wallace, and Sebastian Brand.From High-Level Model to Branch-and-Price Solution in G12.CPAIOR 2008: The Fifth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, volume 5015 of LNCS, pages 218-232. Springer, 2008.
A. Rendl, M. Prandtstetter, and Jakob Puchinger.
Multimodal Home Healthcare Scheduling using a novel CP-VND-DP Approach.
Late Breaking Abstract at CPAIOR 2011: The 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011.
Christian Blum, Jakob Puchinger, Günther R. Raidl, and Andrea Roli. Hybrid Metaheuristics in Combinatorial Optimization: A Survey. Applied Soft Computing, In Press, Accepted Manuscript, Available online 15 March 2011.
U. Ritzinger, J. Puchinger, and R.F. Hartl
A restricted dynamic programming algorithm for the dial-a-ride problem.
MIC 2011: 9th Metaheuristic International Conference, 2011.
C. Burt and J. Puchinger.
Models and Algorithms for Intermodal Transportation and Equipment Selection.
OR 2011 International Conference on Operations Research, 2011.
Sebastian Brand, Gregory J.Duck, Jakob Puchinger, and Peter J. Stuckey.Flexible, Rule-based Constraint Model Linearisation.In P. Hudak and D.S. Warren, editors, Practical Aspects of Declarative Languages, 10th International Symposium, PADL 2008, volume 4902 of LNCS, pages 68-83. Springer, 2008.
Jakob Puchinger and Peter J. Stuckey.Automating branch-and-bound for dynamic programming.PEPM '08: Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, pages 81-89. ACM. 2008.
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 C. Cotta and J. van Hemert editors, Evolutionary Computation in Combinatorial Optimization - EvoCOP 2007, volume 4446 of LNCS, pages 176-187. Springer, 2007.
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.
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.
Jakob Puchinger, Günther R. Raidl, and Gabriele Koller.Solving a real-world glass cutting problem.In J. Gottlieb and G.R. Raidl, editors, Evolutionary Computation in Combinatorial Optimization - EvoCOP 2004, volume 3004 of LNCS, pages 162-173. Springer, 2004.
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.
Jakob Puchinger and Günther R. Raidl.Models and algorithms for three-stage two-dimensional bin packing.European Journal of Operational Research, Volume 183, Issue 3, 16 December 2007, Pages 1304-1327.
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.
Jakob Puchinger and Günther R. Raidl.Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification.In J. Mira and J. Alvarez, editors, Proceedings of the First International Work-Conference on the Interplay Between Natural and Artificial Computation, volume 3562 of LNCS, pages 41-53. Springer, 2005.
Jakob Puchinger and Günther R. Raidl.Bringing order into the neighborhoods: Relaxation guided variable neighborhood search.Journal of Heuristics, Volume 14, Issue 5, 1 October 2008, Pages 457-472.
Jakob Puchinger, Günther R. Raidl, and Ulrich Pferschy.The core concept for the multidimensional knapsack problem.In J. Gottlieb and G. R. Raidl, editors, Evolutionary Computation in Combinatorial Optimization - EvoCOP 2006, volume 3906 of LNCS, pages 195-208. Springer, 2006.
Jakob Puchinger and Günther R. Raidl.Bringing order into the neighborhoods: Relaxation guided variable neighborhood search.Journal of Heuristics, accepted for publication.
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.
Ralph Becket, Sebastian Brand, Mark Brown, Gregory J. Duck, Thibaut Feydy, Julien Fischer, Jinbo Huang, Kim Marriott, Nicholas Nethercote, Jakob Puchinger, Reza Rafeh, Peter J. Stuckey, and Mark G. Wallace. The Many Roads Leading to Rome: Solving Zinc Models by Various Solvers. ModRef'08: 7th International Workshop on Constraint Modelling and Reformulation 2008.
