https://ac.tuwien.ac.at/tag/evolcomp/EvolcompHugo Blox Builder (https://hugoblox.com)en-usTue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pnghttps://ac.tuwien.ac.at/tag/evolcomp/https://ac.tuwien.ac.at/publication/metaheuristic-hybrids-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristic-hybrids-2/https://ac.tuwien.ac.at/publication/metaheuristics-for-the-districting-and-routing-problem-for-security-control/Sun, 01 May 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristics-for-the-districting-and-routing-problem-for-security-control/https://ac.tuwien.ac.at/publication/complete-solution-archives-for-evolutionary-combinatorial-optimization-application-to-a-competitive-facility-location-and-stochastic-vehicle-routing-problem/Fri, 01 Apr 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/complete-solution-archives-for-evolutionary-combinatorial-optimization-application-to-a-competitive-facility-location-and-stochastic-vehicle-routing-problem/https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-virtual-network-mapping-problem-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-virtual-network-mapping-problem-2/https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-powerful-tools-for-optimization/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-powerful-tools-for-optimization/https://ac.tuwien.ac.at/publication/models-and-algorithms-for-competitive-facility-location-problems-with-different-customer-behavior/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/models-and-algorithms-for-competitive-facility-location-problems-with-different-customer-behavior/https://ac.tuwien.ac.at/publication/visibility-based-obstacle-placing-automated-obstacle-placing-based-on-circularity/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/visibility-based-obstacle-placing-automated-obstacle-placing-based-on-circularity/https://ac.tuwien.ac.at/publication/a-hybrid-genetic-algorithm-with-solution-archive-for-the-discrete-r-p-centroid-problem/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-hybrid-genetic-algorithm-with-solution-archive-for-the-discrete-r-p-centroid-problem/https://ac.tuwien.ac.at/publication/a-new-type-of-metamodel-for-longitudinal-dynamics-optimization-of-hybrid-electric-vehicles-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-new-type-of-metamodel-for-longitudinal-dynamics-optimization-of-hybrid-electric-vehicles-2/https://ac.tuwien.ac.at/publication/decomposition-based-hybrid-metaheuristics/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/decomposition-based-hybrid-metaheuristics/https://ac.tuwien.ac.at/publication/heuristic-approaches-for-the-probabilistic-traveling-salesman-problem-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/heuristic-approaches-for-the-probabilistic-traveling-salesman-problem-2/https://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/https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-the-leader-follower-facility-location-problem-with-proportional-customer-behavior/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-the-leader-follower-facility-location-problem-with-proportional-customer-behavior/https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-an-analysis-of-path-relinking-and-recombination-within-a-grasp-hybrid/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-an-analysis-of-path-relinking-and-recombination-within-a-grasp-hybrid/https://ac.tuwien.ac.at/publication/optimization-challenges-of-the-future-federated-internet/Tue, 01 Oct 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimization-challenges-of-the-future-federated-internet/https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-partition-graph-coloring-problem/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-partition-graph-coloring-problem/https://ac.tuwien.ac.at/publication/a-memetic-algorithm-with-two-distinct-solution-representations-for-the-partition-graph-coloring-problem/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-with-two-distinct-solution-representations-for-the-partition-graph-coloring-problem/https://ac.tuwien.ac.at/publication/a-mixed-integer-model-for-the-stamina-aware-sightseeing-tour-problem/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-mixed-integer-model-for-the-stamina-aware-sightseeing-tour-problem/https://ac.tuwien.ac.at/publication/a-pilot-vnd-grasp-hybrid-for-balancing-bicycle-sharing-systems/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-pilot-vnd-grasp-hybrid-for-balancing-bicycle-sharing-systems/https://ac.tuwien.ac.at/publication/a-pilot-vnd-grasp-hybrid-for-the-static-balancing-of-public-bicycle-sharing-systems/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-pilot-vnd-grasp-hybrid-for-the-static-balancing-of-public-bicycle-sharing-systems/https://ac.tuwien.ac.at/publication/a-timeslot-filling-based-heuristic-approach-to-construct-high-school-timetables-2/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-timeslot-filling-based-heuristic-approach-to-construct-high-school-timetables-2/https://ac.tuwien.ac.at/publication/reconstructing-cross-cut-shredded-documents-with-a-genetic-algorithm-with-solution-archive/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/reconstructing-cross-cut-shredded-documents-with-a-genetic-algorithm-with-solution-archive/https://ac.tuwien.ac.at/publication/solving-the-virtual-network-mapping-problem-with-construction-heuristics-local-search-and-variable-neighborhood-descent/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-virtual-network-mapping-problem-with-construction-heuristics-local-search-and-variable-neighborhood-descent/https://ac.tuwien.ac.at/publication/solving-multimodal-resource-constrained-project-scheduling-problems/Sat, 01 Sep 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-multimodal-resource-constrained-project-scheduling-problems/https://ac.tuwien.ac.at/publication/enhancing-an-evolutionary-algorithm-with-a-solution-archive-to-reconstruct-cross-cut-shredded-text-documents/Tue, 01 May 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/enhancing-an-evolutionary-algorithm-with-a-solution-archive-to-reconstruct-cross-cut-shredded-text-documents/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/metaheuristics-for-a-multimodal-home-health-care-scheduling-problem/Tue, 01 May 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristics-for-a-multimodal-home-health-care-scheduling-problem/https://ac.tuwien.ac.at/publication/on-solving-constrained-tree-problems-and-an-adaptive-layers-framework/Tue, 01 May 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-solving-constrained-tree-problems-and-an-adaptive-layers-framework/https://ac.tuwien.ac.at/publication/a-memetic-algorithm-and-a-solution-archive-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-and-a-solution-archive-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/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/applying-hybrid-metaheuristics-to-fuel-consumption-optimization-of-hybrid-electric-vehicles/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/applying-hybrid-metaheuristics-to-fuel-consumption-optimization-of-hybrid-electric-vehicles/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/solving-the-post-enrolment-course-timetabling-problem-by-ant-colony-optimization-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-post-enrolment-course-timetabling-problem-by-ant-colony-optimization-2/https://ac.tuwien.ac.at/publication/ein-losungsarchiv-mit-branch-and-bound-erweiterung-fur-das-generalized-minimum-spanning-tree-problem/Thu, 01 Sep 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/ein-losungsarchiv-mit-branch-and-bound-erweiterung-fur-das-generalized-minimum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/a-timeslot-filling-based-heuristic-approach-to-construct-high-school-timetables/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-timeslot-filling-based-heuristic-approach-to-construct-high-school-timetables/https://ac.tuwien.ac.at/publication/ein-neues-losungsarchiv-fur-das-generalized-minimum-spanning-tree-problem/Wed, 01 Sep 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/ein-neues-losungsarchiv-fur-das-generalized-minimum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/automatic-generation-of-2-antwars-players-with-genetic-programming-3/Thu, 01 Jul 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/automatic-generation-of-2-antwars-players-with-genetic-programming-3/https://ac.tuwien.ac.at/publication/reconstructing-cross-cut-shredded-documents-by-means-of-evolutionary-algorithms/Sat, 01 May 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/reconstructing-cross-cut-shredded-documents-by-means-of-evolutionary-algorithms/https://ac.tuwien.ac.at/publication/heuristic-methods-for-solving-two-generalized-network-problems/Mon, 01 Feb 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/heuristic-methods-for-solving-two-generalized-network-problems/https://ac.tuwien.ac.at/publication/fitting-multi-planet-transit-models-to-photometric-time-data-series-by-evolution-strategies/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/fitting-multi-planet-transit-models-to-photometric-time-data-series-by-evolution-strategies/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/metaheuristic-hybrids/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristic-hybrids/https://ac.tuwien.ac.at/publication/ein-losungsarchiv-unterstutzter-evolutionarer-algorithmus-fur-das-generalized-minimum-spanning-tree-problem/Wed, 01 Jul 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/ein-losungsarchiv-unterstutzter-evolutionarer-algorithmus-fur-das-generalized-minimum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/fitting-multi-planet-transit-models-to-corot-time-data-series-by-evolutionary-algorithms/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/fitting-multi-planet-transit-models-to-corot-time-data-series-by-evolutionary-algorithms/https://ac.tuwien.ac.at/publication/fitting-rectangular-signals-to-time-series-data-by-metaheuristic-algorithms-2/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/fitting-rectangular-signals-to-time-series-data-by-metaheuristic-algorithms-2/https://ac.tuwien.ac.at/publication/fitting-rectangular-signals-to-time-series-data-by-metaheuristic-algorithms/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/fitting-rectangular-signals-to-time-series-data-by-metaheuristic-algorithms/https://ac.tuwien.ac.at/publication/gecco-2009-proceedings-of-the-11th-annual-conference-on-genetic-and-evolutionary-computation/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/gecco-2009-proceedings-of-the-11th-annual-conference-on-genetic-and-evolutionary-computation/https://ac.tuwien.ac.at/publication/meta-heuristics-for-reconstructing-cross-cut-shredded-text-documents/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/meta-heuristics-for-reconstructing-cross-cut-shredded-text-documents/https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-for-generalized-network-design-problems/Mon, 01 Dec 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-for-generalized-network-design-problems/https://ac.tuwien.ac.at/publication/a-complete-archive-genetic-algorithm-for-the-multidimensional-knapsack-problem/Thu, 01 May 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-complete-archive-genetic-algorithm-for-the-multidimensional-knapsack-problem/https://ac.tuwien.ac.at/publication/combinatorial-optimization-for-the-compression-of-biometric-templates/Thu, 01 May 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/combinatorial-optimization-for-the-compression-of-biometric-templates/https://ac.tuwien.ac.at/publication/lagrangian-relax-and-cut-and-hybrid-methods-for-the-bounded-diameter-and-the-hop-constrained-minimum-spanning-tree-problems/Thu, 01 May 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/lagrangian-relax-and-cut-and-hybrid-methods-for-the-bounded-diameter-and-the-hop-constrained-minimum-spanning-tree-problems/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/solving-the-post-enrolment-course-timetabling-problem-by-ant-colony-optimization/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-post-enrolment-course-timetabling-problem-by-ant-colony-optimization/https://ac.tuwien.ac.at/publication/algorithmic-approaches-to-the-string-barcoding-problem/Mon, 01 Oct 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithmic-approaches-to-the-string-barcoding-problem/https://ac.tuwien.ac.at/publication/metaheuristic-approaches-for-designing-survivable-fiber-optic-networks/Thu, 01 Mar 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristic-approaches-for-designing-survivable-fiber-optic-networks/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/compressing-fingerprint-templates-by-solving-an-extended-minimum-label-spanning-tree-problem/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/compressing-fingerprint-templates-by-solving-an-extended-minimum-label-spanning-tree-problem/https://ac.tuwien.ac.at/publication/fingerprint-template-compression-by-solving-a-minimum-label-k-node-subtree-problem/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/fingerprint-template-compression-by-solving-a-minimum-label-k-node-subtree-problem/https://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/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/https://ac.tuwien.ac.at/publication/solving-two-generalized-network-design-problems-with-exact-and-heuristic-methods/Mon, 01 May 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-two-generalized-network-design-problems-with-exact-and-heuristic-methods/https://ac.tuwien.ac.at/publication/a-unified-view-on-hybrid-metaheuristics/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-unified-view-on-hybrid-metaheuristics/https://ac.tuwien.ac.at/publication/an-ant-colony-optimisation-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-ant-colony-optimisation-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/bestimmung-der-bahnelemente-von-extrasolaren-planeten-aufgrund-von-radialgeschwindigkeitsmessdaten-mittels-evolutionarer-algorithmen/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/bestimmung-der-bahnelemente-von-extrasolaren-planeten-aufgrund-von-radialgeschwindigkeitsmessdaten-mittels-evolutionarer-algorithmen/https://ac.tuwien.ac.at/publication/biased-mutation-operators-for-subgraph-selection-problems-2/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/biased-mutation-operators-for-subgraph-selection-problems-2/https://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/https://ac.tuwien.ac.at/publication/evolutionary-approach-to-constrained-minimum-spanning-tree-problem/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/evolutionary-approach-to-constrained-minimum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/evolutionary-computation-in-combinatorial-optimization-evocop-2006/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/evolutionary-computation-in-combinatorial-optimization-evocop-2006/https://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/https://ac.tuwien.ac.at/publication/dynamische-reihenfolgeoptimierung-mittels-simulation-und-meta-heuristiken/Mon, 01 Aug 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/dynamische-reihenfolgeoptimierung-mittels-simulation-und-meta-heuristiken/https://ac.tuwien.ac.at/publication/eine-generische-bibliothek-fur-metaheuristiken-und-ihre-anwendung-auf-das-quadratic-assignment-problem/Mon, 01 Aug 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/eine-generische-bibliothek-fur-metaheuristiken-und-ihre-anwendung-auf-das-quadratic-assignment-problem/https://ac.tuwien.ac.at/publication/exact-and-heuristic-methods-for-solving-the-car-sequencing-problem/Mon, 01 Aug 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-and-heuristic-methods-for-solving-the-car-sequencing-problem/https://ac.tuwien.ac.at/publication/an-application-of-dijkstra-s-algorithm-for-a-on-board-route-re-planning-module/Fri, 01 Jul 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-application-of-dijkstra-s-algorithm-for-a-on-board-route-re-planning-module/https://ac.tuwien.ac.at/publication/an-extended-local-branching-framework-and-its-application-to-the-multidimensional-knapsack-problem/Tue, 01 Mar 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-extended-local-branching-framework-and-its-application-to-the-multidimensional-knapsack-problem/https://ac.tuwien.ac.at/publication/option-pricing-by-means-of-genetic-programming/Tue, 01 Feb 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/option-pricing-by-means-of-genetic-programming/https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-approach-for-solving-the-car-sequencing-problem/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-approach-for-solving-the-car-sequencing-problem/https://ac.tuwien.ac.at/publication/an-integer-linear-programming-approach-and-a-hybrid-variable-neighborhood-search-for-the-car-sequencing-problem/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-integer-linear-programming-approach-and-a-hybrid-variable-neighborhood-search-for-the-car-sequencing-problem/https://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/https://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/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/Sat, 01 Jan 2005 00:00:00 +0000https://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/https://ac.tuwien.ac.at/publication/evolutionary-computation-in-combinatorial-optimization-evocop-2005/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/evolutionary-computation-in-combinatorial-optimization-evocop-2005/https://ac.tuwien.ac.at/publication/proceedings-of-the-genetic-and-evolutionary-computation-conference-gecco-2005/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/proceedings-of-the-genetic-and-evolutionary-computation-conference-gecco-2005/https://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/https://ac.tuwien.ac.at/publication/ein-genetischer-algorithmus-fur-das-optimum-communication-spanning-tree-problem/Mon, 01 Nov 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/ein-genetischer-algorithmus-fur-das-optimum-communication-spanning-tree-problem/https://ac.tuwien.ac.at/publication/an-alignment-graph-based-evolutionary-algorithm-for-the-multiple-sequence-alignment-problem/Sun, 01 Feb 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-alignment-graph-based-evolutionary-algorithm-for-the-multiple-sequence-alignment-problem/https://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/https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-the-maximum-weight-trace-formulation-of-the-multiple-sequence-alignment-problem/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-the-maximum-weight-trace-formulation-of-the-multiple-sequence-alignment-problem/https://ac.tuwien.ac.at/publication/an-improved-hybrid-genetic-algorithm-for-the-generalized-assignment-problem/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-improved-hybrid-genetic-algorithm-for-the-generalized-assignment-problem/https://ac.tuwien.ac.at/publication/applications-of-evolutionary-computing-evoworkshops-2004/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/applications-of-evolutionary-computing-evoworkshops-2004/https://ac.tuwien.ac.at/publication/biased-mutation-operators-for-subgraph-selection-problems/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/biased-mutation-operators-for-subgraph-selection-problems/https://ac.tuwien.ac.at/publication/combining-a-memetic-algorithm-with-integer-programming-to-solve-the-prize-collecting-steiner-tree-problem/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-a-memetic-algorithm-with-integer-programming-to-solve-the-prize-collecting-steiner-tree-problem/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/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/empirical-analysis-of-locality-heritability-and-heuristic-bias-in-evolutionary-algorithms-a-case-study-for-the-multidimensional-knapsack-problem/https://ac.tuwien.ac.at/publication/evolutionary-computation-in-combinatorial-optimization-evocop-2004/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/evolutionary-computation-in-combinatorial-optimization-evocop-2004/https://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/https://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/https://ac.tuwien.ac.at/publication/special-issue-on-evolutionary-computation-in-combinatorial-optimization/Thu, 01 Jan 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/special-issue-on-evolutionary-computation-in-combinatorial-optimization/https://ac.tuwien.ac.at/publication/ein-evolutionarer-algorithmus-zur-losung-des-vertex-biconnectivity-augmentation-problems/Mon, 01 Sep 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/ein-evolutionarer-algorithmus-zur-losung-des-vertex-biconnectivity-augmentation-problems/https://ac.tuwien.ac.at/publication/neue-heuristische-losungsansatze-fur-das-multiple-sequence-alignment-problem/Thu, 01 May 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/neue-heuristische-losungsansatze-fur-das-multiple-sequence-alignment-problem/https://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/https://ac.tuwien.ac.at/publication/ein-genetischer-algorithmus-fur-das-generalized-assignment-problem/Tue, 01 Apr 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/ein-genetischer-algorithmus-fur-das-generalized-assignment-problem/https://ac.tuwien.ac.at/publication/hybrid-evolutionary-algorithms-for-combinatorial-optimization/Sat, 01 Mar 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-evolutionary-algorithms-for-combinatorial-optimization/https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-minimum-cost-vertex-biconnectivity-augmentation-of-graphs/Wed, 01 Jan 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-minimum-cost-vertex-biconnectivity-augmentation-of-graphs/https://ac.tuwien.ac.at/publication/a-permutation-coded-evolutionary-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/Wed, 01 Jan 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-permutation-coded-evolutionary-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/applications-of-evolutionary-computing-evoworkshops-2003/Wed, 01 Jan 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/applications-of-evolutionary-computing-evoworkshops-2003/https://ac.tuwien.ac.at/publication/edge-sets-an-effective-evolutionary-coding-of-spanning-trees/Wed, 01 Jan 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/edge-sets-an-effective-evolutionary-coding-of-spanning-trees/https://ac.tuwien.ac.at/publication/greedy-heuristics-and-an-evolutionary-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/Wed, 01 Jan 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/greedy-heuristics-and-an-evolutionary-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-vertex-biconnectivity-augmentation/Tue, 01 Jan 2002 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-vertex-biconnectivity-augmentation/https://ac.tuwien.ac.at/publication/applications-of-evolutionary-computing-evoworkshops-2002/Tue, 01 Jan 2002 00:00:00 +0000https://ac.tuwien.ac.at/publication/applications-of-evolutionary-computing-evoworkshops-2002/https://ac.tuwien.ac.at/publication/evolutionary-local-search-for-the-edge-biconnectivity-augmentation-problem/Tue, 01 Jan 2002 00:00:00 +0000https://ac.tuwien.ac.at/publication/evolutionary-local-search-for-the-edge-biconnectivity-augmentation-problem/https://ac.tuwien.ac.at/publication/initialization-is-robust-in-evolutionary-algorithms-that-encode-spanning-trees-as-sets-of-edges/Tue, 01 Jan 2002 00:00:00 +0000https://ac.tuwien.ac.at/publication/initialization-is-robust-in-evolutionary-algorithms-that-encode-spanning-trees-as-sets-of-edges/https://ac.tuwien.ac.at/publication/letting-ants-labeling-point-features/Tue, 01 Jan 2002 00:00:00 +0000https://ac.tuwien.ac.at/publication/letting-ants-labeling-point-features/https://ac.tuwien.ac.at/publication/on-weight-biased-mutation-for-graph-problems/Tue, 01 Jan 2002 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-weight-biased-mutation-for-graph-problems/https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-stochastic-hill-climbing-for-the-edge-biconnectivity-augmentation-problem/Mon, 01 Jan 2001 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-stochastic-hill-climbing-for-the-edge-biconnectivity-augmentation-problem/https://ac.tuwien.ac.at/publication/applications-of-evolutionary-computing-evoworkshops-2001/Mon, 01 Jan 2001 00:00:00 +0000https://ac.tuwien.ac.at/publication/applications-of-evolutionary-computing-evoworkshops-2001/https://ac.tuwien.ac.at/publication/prufer-numbers-a-poor-representation-of-spanning-trees-for-evolutionary-search/Mon, 01 Jan 2001 00:00:00 +0000https://ac.tuwien.ac.at/publication/prufer-numbers-a-poor-representation-of-spanning-trees-for-evolutionary-search/https://ac.tuwien.ac.at/publication/weight-biased-edge-crossover-in-evolutionary-algorithms-for-two-graph-problems/Mon, 01 Jan 2001 00:00:00 +0000https://ac.tuwien.ac.at/publication/weight-biased-edge-crossover-in-evolutionary-algorithms-for-two-graph-problems/https://ac.tuwien.ac.at/publication/a-hybrid-ga-for-the-edge-biconnectivity-augmentation-problem/Sat, 01 Jan 2000 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-hybrid-ga-for-the-edge-biconnectivity-augmentation-problem/https://ac.tuwien.ac.at/publication/a-predecessor-coding-in-an-evolutionary-algorithm-for-the-capacitated-minimum-spanning-tree-problem/Sat, 01 Jan 2000 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-predecessor-coding-in-an-evolutionary-algorithm-for-the-capacitated-minimum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/a-weighted-coding-in-a-genetic-algorithm-for-the-degree-constrained-minimum-spanning-tree-problem/Sat, 01 Jan 2000 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-weighted-coding-in-a-genetic-algorithm-for-the-degree-constrained-minimum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/an-efficient-evolutionary-algorithm-for-the-degree-constrained-minimum-spanning-tree-problem/Sat, 01 Jan 2000 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-efficient-evolutionary-algorithm-for-the-degree-constrained-minimum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/the-effects-of-locality-on-the-dynamics-of-decoder-based-evolutionary-search/Sat, 01 Jan 2000 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-effects-of-locality-on-the-dynamics-of-decoder-based-evolutionary-search/https://ac.tuwien.ac.at/publication/a-weight-coded-genetic-algorithm-for-the-multiple-container-packing-problem/Fri, 01 Jan 1999 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-weight-coded-genetic-algorithm-for-the-multiple-container-packing-problem/https://ac.tuwien.ac.at/publication/an-evolutionary-approach-to-point-feature-label-placement/Fri, 01 Jan 1999 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-approach-to-point-feature-label-placement/https://ac.tuwien.ac.at/publication/characterizing-locality-in-decoder-based-eas-for-the-multidimensional-knapsack-problem/Fri, 01 Jan 1999 00:00:00 +0000https://ac.tuwien.ac.at/publication/characterizing-locality-in-decoder-based-eas-for-the-multidimensional-knapsack-problem/https://ac.tuwien.ac.at/publication/on-the-importance-of-phenotypic-duplicate-elimination-in-decoder-based-evolutionary-algorithms/Fri, 01 Jan 1999 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-importance-of-phenotypic-duplicate-elimination-in-decoder-based-evolutionary-algorithms/https://ac.tuwien.ac.at/publication/the-multiple-container-packing-problem-a-genetic-algorithm-approach-with-weighted-codings/Fri, 01 Jan 1999 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-multiple-container-packing-problem-a-genetic-algorithm-approach-with-weighted-codings/https://ac.tuwien.ac.at/publication/weight-codings-in-a-genetic-algorithm-for-the-multiconstraint-knapsack-problem/Fri, 01 Jan 1999 00:00:00 +0000https://ac.tuwien.ac.at/publication/weight-codings-in-a-genetic-algorithm-for-the-multiconstraint-knapsack-problem/https://ac.tuwien.ac.at/publication/a-genetic-algorithm-for-labeling-point-features/Thu, 01 Jan 1998 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-genetic-algorithm-for-labeling-point-features/https://ac.tuwien.ac.at/publication/a-hybrid-gp-approach-for-numerically-robust-symbolic-regression/Thu, 01 Jan 1998 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-hybrid-gp-approach-for-numerically-robust-symbolic-regression/https://ac.tuwien.ac.at/publication/an-improved-genetic-algorithm-for-the-multiconstrained-0-1-knapsack-problem/Thu, 01 Jan 1998 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-improved-genetic-algorithm-for-the-multiconstrained-0-1-knapsack-problem/https://ac.tuwien.ac.at/publication/approximation-with-evolutionary-optimized-tensor-product-bernstein-polynomials/Thu, 01 Jan 1998 00:00:00 +0000https://ac.tuwien.ac.at/publication/approximation-with-evolutionary-optimized-tensor-product-bernstein-polynomials/https://ac.tuwien.ac.at/publication/evolutionary-optimized-tensor-product-bernstein-polynomials-versus-backpropagation-networks/Thu, 01 Jan 1998 00:00:00 +0000https://ac.tuwien.ac.at/publication/evolutionary-optimized-tensor-product-bernstein-polynomials-versus-backpropagation-networks/https://ac.tuwien.ac.at/publication/genetic-algorithms-for-the-multiple-container-packing-problem/Thu, 01 Jan 1998 00:00:00 +0000https://ac.tuwien.ac.at/publication/genetic-algorithms-for-the-multiple-container-packing-problem/https://ac.tuwien.ac.at/publication/transforming-an-analytically-defined-color-space-to-match-psychophysically-gained-color-distances/Thu, 01 Jan 1998 00:00:00 +0000https://ac.tuwien.ac.at/publication/transforming-an-analytically-defined-color-space-to-match-psychophysically-gained-color-distances/