Packing

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
Cite
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.
PDF Cite
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.
PDF Cite
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
PDF Cite
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.
PDF Cite
An Extended Local Branching Framework and its Application to the Multidimensional Knapsack Problem
March 2005, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and J.~Puchinger
PDF Cite
Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem
Evolutionary Computation Journal, volume 13, number 4, pages 441-475, 2005.
PDF Cite
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.
PDF Cite
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.
PDF Cite
Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem
2004, Technical report TR 186-1-04-05, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
PDF Cite