https://ac.tuwien.ac.at/team/sandro-pirkwieser/Sandro PirkwieserHugo Blox Builder (https://hugoblox.com)en-usTue, 01 May 2012 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pnghttps://ac.tuwien.ac.at/team/sandro-pirkwieser/https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-and-matheuristics-for-problems-in-bioinformatics-and-transportation/Tue, 01 May 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-and-matheuristics-for-problems-in-bioinformatics-and-transportation/https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-approach-for-the-two-echelon-location-routing-problem/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-approach-for-the-two-echelon-location-routing-problem/https://ac.tuwien.ac.at/publication/improved-packing-and-routing-of-vehicles-with-compartments-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/improved-packing-and-routing-of-vehicles-with-compartments-2/https://ac.tuwien.ac.at/publication/improved-packing-and-routing-of-vehicles-with-compartments/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/improved-packing-and-routing-of-vehicles-with-compartments/https://ac.tuwien.ac.at/publication/tackling-the-loading-aspect-of-the-vehicle-routing-problem-with-compartments/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/tackling-the-loading-aspect-of-the-vehicle-routing-problem-with-compartments/https://ac.tuwien.ac.at/publication/matheuristics-for-the-periodic-vehicle-routing-problem-with-time-windows/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/matheuristics-for-the-periodic-vehicle-routing-problem-with-time-windows/https://ac.tuwien.ac.at/publication/multilevel-variable-neighborhood-search-for-periodic-routing-problems/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/multilevel-variable-neighborhood-search-for-periodic-routing-problems/https://ac.tuwien.ac.at/publication/variable-neighborhood-search-coupled-with-ilp-based-large-neighborhood-searches-for-the-periodic-location-routing-problem/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-search-coupled-with-ilp-based-large-neighborhood-searches-for-the-periodic-location-routing-problem/https://ac.tuwien.ac.at/publication/a-column-generation-approach-for-the-periodic-vehicle-routing-problem-with-time-windows/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-column-generation-approach-for-the-periodic-vehicle-routing-problem-with-time-windows/https://ac.tuwien.ac.at/publication/boosting-a-variable-neighborhood-search-for-the-periodic-vehicle-routing-problem-with-time-windows-by-ilp-techniques/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/boosting-a-variable-neighborhood-search-for-the-periodic-vehicle-routing-problem-with-time-windows-by-ilp-techniques/https://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/https://ac.tuwien.ac.at/publication/multiple-variable-neighborhood-search-enriched-with-ilp-techniques-for-the-periodic-vehicle-routing-problem-with-time-windows/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/multiple-variable-neighborhood-search-enriched-with-ilp-techniques-for-the-periodic-vehicle-routing-problem-with-time-windows/https://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/https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-for-the-periodic-vehicle-routing-problem-with-time-windows/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-for-the-periodic-vehicle-routing-problem-with-time-windows/https://ac.tuwien.ac.at/publication/exact-methods-and-metaheuristic-approaches-for-deriving-high-quality-fully-resolved-consensus-trees/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-methods-and-metaheuristic-approaches-for-deriving-high-quality-fully-resolved-consensus-trees/https://ac.tuwien.ac.at/publication/finding-consensus-trees-by-evolutionary-variable-neighborhood-search-and-hybrid-algorithms/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-consensus-trees-by-evolutionary-variable-neighborhood-search-and-hybrid-algorithms/https://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/https://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/https://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-approach-combined-with-metaheuristics-for-the-knapsack-constrained-maximum-spanning-tree-problem/Sun, 01 Oct 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-approach-combined-with-metaheuristics-for-the-knapsack-constrained-maximum-spanning-tree-problem/