<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Packing | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/tag/packing/</link><atom:link href="https://ac.tuwien.ac.at/tag/packing/index.xml" rel="self" type="application/rss+xml"/><description>Packing</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Tue, 01 Jan 2019 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Packing</title><link>https://ac.tuwien.ac.at/tag/packing/</link></image><item><title>Metaheuristic Hybrids</title><link>https://ac.tuwien.ac.at/publication/metaheuristic-hybrids-2/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/metaheuristic-hybrids-2/</guid><description/></item><item><title>A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables</title><link>https://ac.tuwien.ac.at/publication/a-timeslot-filling-based-heuristic-approach-to-construct-high-school-timetables-2/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-timeslot-filling-based-heuristic-approach-to-construct-high-school-timetables-2/</guid><description/></item><item><title>A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables</title><link>https://ac.tuwien.ac.at/publication/a-timeslot-filling-based-heuristic-approach-to-construct-high-school-timetables/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-timeslot-filling-based-heuristic-approach-to-construct-high-school-timetables/</guid><description/></item><item><title>Tackling the Loading Aspect of the Vehicle Routing Problem with Compartments</title><link>https://ac.tuwien.ac.at/publication/tackling-the-loading-aspect-of-the-vehicle-routing-problem-with-compartments/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/tackling-the-loading-aspect-of-the-vehicle-routing-problem-with-compartments/</guid><description/></item><item><title>Metaheuristic Hybrids</title><link>https://ac.tuwien.ac.at/publication/metaheuristic-hybrids/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/metaheuristic-hybrids/</guid><description/></item><item><title>The Multidimensional Knapsack Problem: Structure and Algorithms</title><link>https://ac.tuwien.ac.at/publication/the-multidimensional-knapsack-problem-structure-and-algorithms-2/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-multidimensional-knapsack-problem-structure-and-algorithms-2/</guid><description/></item><item><title>Ein hybrides Verfahren zur automatischen Rekonstruktion von handzerrissenen Dokumentenseiten mittels geometrischer Informationen</title><link>https://ac.tuwien.ac.at/publication/ein-hybrides-verfahren-zur-automatischen-rekonstruktion-von-handzerrissenen-dokumentenseiten-mittels-geometrischer-informationen/</link><pubDate>Mon, 01 Sep 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/ein-hybrides-verfahren-zur-automatischen-rekonstruktion-von-handzerrissenen-dokumentenseiten-mittels-geometrischer-informationen/</guid><description/></item><item><title>A Complete Archive Genetic Algorithm for the Multidimensional Knapsack Problem</title><link>https://ac.tuwien.ac.at/publication/a-complete-archive-genetic-algorithm-for-the-multidimensional-knapsack-problem/</link><pubDate>Thu, 01 May 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-complete-archive-genetic-algorithm-for-the-multidimensional-knapsack-problem/</guid><description/></item><item><title>Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search</title><link>https://ac.tuwien.ac.at/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search-2/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search-2/</guid><description/></item><item><title>Combining Forces to Reconstruct Strip Shredded Text Documents</title><link>https://ac.tuwien.ac.at/publication/combining-forces-to-reconstruct-strip-shredded-text-documents/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/combining-forces-to-reconstruct-strip-shredded-text-documents/</guid><description/></item><item><title>Models and Algorithms for Three-Stage Two-Dimensional Bin Packing</title><link>https://ac.tuwien.ac.at/publication/models-and-algorithms-for-three-stage-two-dimensional-bin-packing-2/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/models-and-algorithms-for-three-stage-two-dimensional-bin-packing-2/</guid><description/></item><item><title>The Multidimensional Knapsack Problem: Structure and Algorithms</title><link>https://ac.tuwien.ac.at/publication/the-multidimensional-knapsack-problem-structure-and-algorithms/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-multidimensional-knapsack-problem-structure-and-algorithms/</guid><description/></item><item><title>Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search</title><link>https://ac.tuwien.ac.at/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search/</guid><description/></item><item><title>Combining Metaheuristics and Integer Programming for Solving Cutting and Packing Problems</title><link>https://ac.tuwien.ac.at/publication/combining-metaheuristics-and-integer-programming-for-solving-cutting-and-packing-problems/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/combining-metaheuristics-and-integer-programming-for-solving-cutting-and-packing-problems/</guid><description/></item><item><title>The Core Concept for the Multidimensional Knapsack Problem</title><link>https://ac.tuwien.ac.at/publication/the-core-concept-for-the-multidimensional-knapsack-problem/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-core-concept-for-the-multidimensional-knapsack-problem/</guid><description/></item><item><title>An Extended Local Branching Framework and its Application to the Multidimensional Knapsack Problem</title><link>https://ac.tuwien.ac.at/publication/an-extended-local-branching-framework-and-its-application-to-the-multidimensional-knapsack-problem/</link><pubDate>Tue, 01 Mar 2005 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-extended-local-branching-framework-and-its-application-to-the-multidimensional-knapsack-problem/</guid><description/></item><item><title>Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem</title><link>https://ac.tuwien.ac.at/publication/empirical-analysis-of-locality-heritability-and-heuristic-bias-in-evolutionary-algorithms-a-case-study-for-the-multidimensional-knapsack-problem-2/</link><pubDate>Sat, 01 Jan 2005 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/empirical-analysis-of-locality-heritability-and-heuristic-bias-in-evolutionary-algorithms-a-case-study-for-the-multidimensional-knapsack-problem-2/</guid><description/></item><item><title>Relaxation Guided Variable Neighborhood Search</title><link>https://ac.tuwien.ac.at/publication/relaxation-guided-variable-neighborhood-search/</link><pubDate>Sat, 01 Jan 2005 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/relaxation-guided-variable-neighborhood-search/</guid><description/></item><item><title>An Evolutionary Algorithm for Column Generation in Integer Programming: an Effective Approach for 2D Bin Packing</title><link>https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-column-generation-in-integer-programming-an-effective-approach-for-2d-bin-packing/</link><pubDate>Thu, 01 Jan 2004 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-column-generation-in-integer-programming-an-effective-approach-for-2d-bin-packing/</guid><description/></item><item><title>Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem</title><link>https://ac.tuwien.ac.at/publication/empirical-analysis-of-locality-heritability-and-heuristic-bias-in-evolutionary-algorithms-a-case-study-for-the-multidimensional-knapsack-problem/</link><pubDate>Thu, 01 Jan 2004 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/empirical-analysis-of-locality-heritability-and-heuristic-bias-in-evolutionary-algorithms-a-case-study-for-the-multidimensional-knapsack-problem/</guid><description/></item><item><title>Models and Algorithms for Three-Stage Two-Dimensional Bin Packing</title><link>https://ac.tuwien.ac.at/publication/models-and-algorithms-for-three-stage-two-dimensional-bin-packing/</link><pubDate>Thu, 01 Jan 2004 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/models-and-algorithms-for-three-stage-two-dimensional-bin-packing/</guid><description/></item><item><title>Solving a Real-World Glass Cutting Problem</title><link>https://ac.tuwien.ac.at/publication/solving-a-real-world-glass-cutting-problem/</link><pubDate>Thu, 01 Jan 2004 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-a-real-world-glass-cutting-problem/</guid><description/></item><item><title>Verfahren zur Lösung eines Glasverschnittproblems</title><link>https://ac.tuwien.ac.at/publication/verfahren-zur-losung-eines-glasverschnittproblems/</link><pubDate>Thu, 01 May 2003 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/verfahren-zur-losung-eines-glasverschnittproblems/</guid><description/></item><item><title>Letting Ants Labeling Point Features</title><link>https://ac.tuwien.ac.at/publication/letting-ants-labeling-point-features/</link><pubDate>Tue, 01 Jan 2002 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/letting-ants-labeling-point-features/</guid><description/></item><item><title>The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search</title><link>https://ac.tuwien.ac.at/publication/the-effects-of-locality-on-the-dynamics-of-decoder-based-evolutionary-search/</link><pubDate>Sat, 01 Jan 2000 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-effects-of-locality-on-the-dynamics-of-decoder-based-evolutionary-search/</guid><description/></item><item><title>A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem</title><link>https://ac.tuwien.ac.at/publication/a-weight-coded-genetic-algorithm-for-the-multiple-container-packing-problem/</link><pubDate>Fri, 01 Jan 1999 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-weight-coded-genetic-algorithm-for-the-multiple-container-packing-problem/</guid><description/></item><item><title>An Evolutionary Approach to Point-Feature Label Placement</title><link>https://ac.tuwien.ac.at/publication/an-evolutionary-approach-to-point-feature-label-placement/</link><pubDate>Fri, 01 Jan 1999 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-evolutionary-approach-to-point-feature-label-placement/</guid><description/></item><item><title>On the Importance of Phenotypic Duplicate Elimination in Decoder-Based Evolutionary Algorithms</title><link>https://ac.tuwien.ac.at/publication/on-the-importance-of-phenotypic-duplicate-elimination-in-decoder-based-evolutionary-algorithms/</link><pubDate>Fri, 01 Jan 1999 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-the-importance-of-phenotypic-duplicate-elimination-in-decoder-based-evolutionary-algorithms/</guid><description/></item><item><title>The Multiple Container Packing Problem: A Genetic Algorithm Approach with Weighted Codings</title><link>https://ac.tuwien.ac.at/publication/the-multiple-container-packing-problem-a-genetic-algorithm-approach-with-weighted-codings/</link><pubDate>Fri, 01 Jan 1999 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-multiple-container-packing-problem-a-genetic-algorithm-approach-with-weighted-codings/</guid><description/></item><item><title>Weight-Codings in a Genetic Algorithm for the Multiconstraint Knapsack Problem</title><link>https://ac.tuwien.ac.at/publication/weight-codings-in-a-genetic-algorithm-for-the-multiconstraint-knapsack-problem/</link><pubDate>Fri, 01 Jan 1999 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/weight-codings-in-a-genetic-algorithm-for-the-multiconstraint-knapsack-problem/</guid><description/></item><item><title>A Genetic Algorithm for Labeling Point Features</title><link>https://ac.tuwien.ac.at/publication/a-genetic-algorithm-for-labeling-point-features/</link><pubDate>Thu, 01 Jan 1998 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-genetic-algorithm-for-labeling-point-features/</guid><description/></item><item><title>An Improved Genetic Algorithm for the Multiconstrained 0–1 Knapsack Problem</title><link>https://ac.tuwien.ac.at/publication/an-improved-genetic-algorithm-for-the-multiconstrained-0-1-knapsack-problem/</link><pubDate>Thu, 01 Jan 1998 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-improved-genetic-algorithm-for-the-multiconstrained-0-1-knapsack-problem/</guid><description/></item><item><title>Genetic Algorithms for the Multiple Container Packing Problem</title><link>https://ac.tuwien.ac.at/publication/genetic-algorithms-for-the-multiple-container-packing-problem/</link><pubDate>Thu, 01 Jan 1998 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/genetic-algorithms-for-the-multiple-container-packing-problem/</guid><description/></item></channel></rss>