Jakob Puchinger | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/jakob-puchinger/Jakob PuchingerHugo Blox Builder (https://hugoblox.com)en-usTue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngJakob Puchingerhttps://ac.tuwien.ac.at/team/jakob-puchinger/Metaheuristic Hybridshttps://ac.tuwien.ac.at/publication/metaheuristic-hybrids-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristic-hybrids-2/Metaheuristics for Solving a Multimodal Home-Healthcare Scheduling Problemhttps://ac.tuwien.ac.at/publication/metaheuristics-for-solving-a-multimodal-home-healthcare-scheduling-problem/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristics-for-solving-a-multimodal-home-healthcare-scheduling-problem/Hybrid Heuristics for Multimodal Homecare Schedulinghttps://ac.tuwien.ac.at/publication/hybrid-heuristics-for-multimodal-homecare-scheduling/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-heuristics-for-multimodal-homecare-scheduling/Hybrid Metaheuristics in Combinatorial Optimization: A Surveyhttps://ac.tuwien.ac.at/publication/hybrid-metaheuristics-in-combinatorial-optimization-a-survey/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-in-combinatorial-optimization-a-survey/A Brief Survey on Hybrid Metaheuristicshttps://ac.tuwien.ac.at/publication/a-brief-survey-on-hybrid-metaheuristics/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-brief-survey-on-hybrid-metaheuristics/Metaheuristic Hybridshttps://ac.tuwien.ac.at/publication/metaheuristic-hybrids/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristic-hybrids/The Multidimensional Knapsack Problem: Structure and Algorithmshttps://ac.tuwien.ac.at/publication/the-multidimensional-knapsack-problem-structure-and-algorithms-2/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-multidimensional-knapsack-problem-structure-and-algorithms-2/Hybrid Metaheuristicshttps://ac.tuwien.ac.at/publication/hybrid-metaheuristics/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-metaheuristics/MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristicshttps://ac.tuwien.ac.at/publication/metaboosting-enhancing-integer-programming-techniques-by-metaheuristics/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaboosting-enhancing-integer-programming-techniques-by-metaheuristics/A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-evolutionary-algorithm-hybrid-for-the-knapsack-constrained-maximum-spanning-tree-problem-2/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-evolutionary-algorithm-hybrid-for-the-knapsack-constrained-maximum-spanning-tree-problem-2/Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Searchhttps://ac.tuwien.ac.at/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search-2/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search-2/Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimizationhttps://ac.tuwien.ac.at/publication/combining-integer-linear-programming-techniques-and-metaheuristics-for-combinatorial-optimization/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-integer-linear-programming-techniques-and-metaheuristics-for-combinatorial-optimization/A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-evolutionary-algorithm-hybrid-for-the-knapsack-constrained-maximum-spanning-tree-problem/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-evolutionary-algorithm-hybrid-for-the-knapsack-constrained-maximum-spanning-tree-problem/Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/combining-lagrangian-decomposition-with-an-evolutionary-algorithm-for-the-knapsack-constrained-maximum-spanning-tree-problem/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-lagrangian-decomposition-with-an-evolutionary-algorithm-for-the-knapsack-constrained-maximum-spanning-tree-problem/Models and Algorithms for Three-Stage Two-Dimensional Bin Packinghttps://ac.tuwien.ac.at/publication/models-and-algorithms-for-three-stage-two-dimensional-bin-packing-2/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/models-and-algorithms-for-three-stage-two-dimensional-bin-packing-2/The Multidimensional Knapsack Problem: Structure and Algorithmshttps://ac.tuwien.ac.at/publication/the-multidimensional-knapsack-problem-structure-and-algorithms/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-multidimensional-knapsack-problem-structure-and-algorithms/Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Searchhttps://ac.tuwien.ac.at/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search/Combining Metaheuristics and Integer Programming for Solving Cutting and Packing Problemshttps://ac.tuwien.ac.at/publication/combining-metaheuristics-and-integer-programming-for-solving-cutting-and-packing-problems/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-metaheuristics-and-integer-programming-for-solving-cutting-and-packing-problems/The Core Concept for the Multidimensional Knapsack Problemhttps://ac.tuwien.ac.at/publication/the-core-concept-for-the-multidimensional-knapsack-problem/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-core-concept-for-the-multidimensional-knapsack-problem/Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classificationhttps://ac.tuwien.ac.at/publication/combining-metaheuristics-and-exact-algorithms-in-combinatorial-optimization-a-survey-and-classification/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-metaheuristics-and-exact-algorithms-in-combinatorial-optimization-a-survey-and-classification/Cooperating Memetic and Branch-and-Cut Algorithms for Solving the Multidimensional Knapsack Problemhttps://ac.tuwien.ac.at/publication/cooperating-memetic-and-branch-and-cut-algorithms-for-solving-the-multidimensional-knapsack-problem/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/cooperating-memetic-and-branch-and-cut-algorithms-for-solving-the-multidimensional-knapsack-problem/Relaxation Guided Variable Neighborhood Searchhttps://ac.tuwien.ac.at/publication/relaxation-guided-variable-neighborhood-search/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/relaxation-guided-variable-neighborhood-search/An Evolutionary Algorithm for Column Generation in Integer Programming: an Effective Approach for 2D Bin Packinghttps://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-column-generation-in-integer-programming-an-effective-approach-for-2d-bin-packing/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-column-generation-in-integer-programming-an-effective-approach-for-2d-bin-packing/Models and Algorithms for Three-Stage Two-Dimensional Bin Packinghttps://ac.tuwien.ac.at/publication/models-and-algorithms-for-three-stage-two-dimensional-bin-packing/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/models-and-algorithms-for-three-stage-two-dimensional-bin-packing/Solving a Real-World Glass Cutting Problemhttps://ac.tuwien.ac.at/publication/solving-a-real-world-glass-cutting-problem/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-a-real-world-glass-cutting-problem/Verfahren zur Lösung eines Glasverschnittproblemshttps://ac.tuwien.ac.at/publication/verfahren-zur-losung-eines-glasverschnittproblems/Thu, 01 May 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/verfahren-zur-losung-eines-glasverschnittproblems/