Hybrid | AC Group | TU Wienhttps://ac.tuwien.ac.at/tag/hybrid/HybridHugo Blox Builder (https://hugoblox.com)en-usTue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngHybridhttps://ac.tuwien.ac.at/tag/hybrid/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/Advances in Decomposition Approaches for Mixed Integer Linear Programminghttps://ac.tuwien.ac.at/publication/advances-in-decomposition-approaches-for-mixed-integer-linear-programming/Thu, 01 Nov 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/advances-in-decomposition-approaches-for-mixed-integer-linear-programming/Parallel Hybrid Metaheuristics for Solving the Firefighter Problem Using the GPUhttps://ac.tuwien.ac.at/publication/parallel-hybrid-metaheuristics-for-solving-the-firefighter-problem-using-the-gpu/Fri, 01 Jun 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/parallel-hybrid-metaheuristics-for-solving-the-firefighter-problem-using-the-gpu/Semi-Automated Location Planning for Urban Bike-Sharing Systemshttps://ac.tuwien.ac.at/publication/semi-automated-location-planning-for-urban-bike-sharing-systems/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/semi-automated-location-planning-for-urban-bike-sharing-systems/An Iterative Time-Bucket Refinement Algorithm for High Resolution Scheduling Problemshttps://ac.tuwien.ac.at/publication/an-iterative-time-bucket-refinement-algorithm-for-high-resolution-scheduling-problems/Sun, 01 Oct 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-iterative-time-bucket-refinement-algorithm-for-high-resolution-scheduling-problems/Complete Solution Archives for Evolutionary Combinatorial Optimization: Application to a Competitive Facility Location and Stochastic Vehicle Routing Problemhttps://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/Hybrid Metaheuristics – Powerful Tools for Optimizationhttps://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/Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristicshttps://ac.tuwien.ac.at/publication/time-bucket-relaxation-based-mixed-integer-programming-models-for-scheduling-problems-a-promising-starting-point-for-matheuristics/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/time-bucket-relaxation-based-mixed-integer-programming-models-for-scheduling-problems-a-promising-starting-point-for-matheuristics/Decomposition Based Hybrid Metaheuristicshttps://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/PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systemshttps://ac.tuwien.ac.at/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems-2/A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problemhttps://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-using-very-large-neighborhood-structures-for-the-3-staged-2-dimensional-cutting-stock-problem/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-using-very-large-neighborhood-structures-for-the-3-staged-2-dimensional-cutting-stock-problem/Speeding up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problemhttps://ac.tuwien.ac.at/publication/speeding-up-logic-based-benders-decomposition-by-a-metaheuristic-for-a-bi-level-capacitated-vehicle-routing-problem/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/speeding-up-logic-based-benders-decomposition-by-a-metaheuristic-for-a-bi-level-capacitated-vehicle-routing-problem/A Memetic Algorithm for the Virtual Network Mapping Problemhttps://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-virtual-network-mapping-problem/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-virtual-network-mapping-problem/A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetableshttps://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/An Optimization Model for Integrated Timetable Based Design of Railway Infrastructurehttps://ac.tuwien.ac.at/publication/an-optimization-model-for-integrated-timetable-based-design-of-railway-infrastructure/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-optimization-model-for-integrated-timetable-based-design-of-railway-infrastructure/Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operationshttps://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-improving-a-vns-by-efficiently-determining-optimal-loading-operations/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-improving-a-vns-by-efficiently-determining-optimal-loading-operations/Clique and Independent Set Based GRASP Approaches for the Regenerator Location Problemhttps://ac.tuwien.ac.at/publication/clique-and-independent-set-based-grasp-approaches-for-the-regenerator-location-problem/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/clique-and-independent-set-based-grasp-approaches-for-the-regenerator-location-problem/GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problemhttps://ac.tuwien.ac.at/publication/grasp-and-variable-neighborhood-search-for-the-virtual-network-mapping-problem/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/grasp-and-variable-neighborhood-search-for-the-virtual-network-mapping-problem/PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systemshttps://ac.tuwien.ac.at/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems/Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descenthttps://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/Hybrid Metaheuristics and Matheuristics for Problems in Bioinformatics and Transportationhttps://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/Metaheuristics for a Multimodal Home-Health Care Scheduling Problemhttps://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/A Multilevel Refinement Approach to the Rooted Delay-Constrained Steiner Tree Problemhttps://ac.tuwien.ac.at/publication/a-multilevel-refinement-approach-to-the-rooted-delay-constrained-steiner-tree-problem/Thu, 01 Sep 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-multilevel-refinement-approach-to-the-rooted-delay-constrained-steiner-tree-problem/Anwendung von kombinatorischen Optimierungsmethoden zur Rekonstruktion von in Streifen geschnittenen Papierdokumentenhttps://ac.tuwien.ac.at/publication/anwendung-von-kombinatorischen-optimierungsmethoden-zur-rekonstruktion-von-in-streifen-geschnittenen-papierdokumenten/Fri, 01 Jul 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/anwendung-von-kombinatorischen-optimierungsmethoden-zur-rekonstruktion-von-in-streifen-geschnittenen-papierdokumenten/Optimierung der periodischen Tourenplanung in der Müllentsorgunghttps://ac.tuwien.ac.at/publication/optimierung-der-periodischen-tourenplanung-in-der-mullentsorgung/Fri, 01 Jul 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimierung-der-periodischen-tourenplanung-in-der-mullentsorgung/Verbrauchsminimierung eines Hybridfahrzeuges im Neuen Europäischen Fahrzyklushttps://ac.tuwien.ac.at/publication/verbrauchsminimierung-eines-hybridfahrzeuges-im-neuen-europaischen-fahrzyklus/Fri, 01 Jul 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/verbrauchsminimierung-eines-hybridfahrzeuges-im-neuen-europaischen-fahrzyklus/A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-multilevel-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-multilevel-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetableshttps://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/An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archive-for-the-generalized-minimum-spanning-tree-problem/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archive-for-the-generalized-minimum-spanning-tree-problem/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/Improved Packing and Routing of Vehicles with Compartmentshttps://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/Tackling the Loading Aspect of the Vehicle Routing Problem with Compartmentshttps://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/A Timeslot-Based Heuristic Approach to Construct High-School Timetableshttps://ac.tuwien.ac.at/publication/a-timeslot-based-heuristic-approach-to-construct-high-school-timetables/Wed, 01 Dec 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-timeslot-based-heuristic-approach-to-construct-high-school-timetables/Multilevel Heuristiken für das Rooted Delay-Constrained Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/multilevel-heuristiken-fur-das-rooted-delay-constrained-minimum-spanning-tree-problem/Thu, 01 Jul 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/multilevel-heuristiken-fur-das-rooted-delay-constrained-minimum-spanning-tree-problem/Solving Two Network Design Problems by Mixed Integer Programming and Hybrid Optimization Methodshttps://ac.tuwien.ac.at/publication/solving-two-network-design-problems-by-mixed-integer-programming-and-hybrid-optimization-methods/Sat, 01 May 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-two-network-design-problems-by-mixed-integer-programming-and-hybrid-optimization-methods/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/A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documentshttps://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-reconstructing-cross-cut-shredded-text-documents/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-reconstructing-cross-cut-shredded-text-documents/Matheuristics for the Periodic Vehicle Routing Problem with Time Windowshttps://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/Metaheuristic Hybridshttps://ac.tuwien.ac.at/publication/metaheuristic-hybrids/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristic-hybrids/Strong Lower Bounds for a Survivable Network Design Problemhttps://ac.tuwien.ac.at/publication/strong-lower-bounds-for-a-survivable-network-design-problem/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/strong-lower-bounds-for-a-survivable-network-design-problem/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/Variable Neighborhood Search Coupled with ILP-based Large Neighborhood Searches for the (Periodic) Location-Routing Problemhttps://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/Hybrid Optimization Methods for Warehouse Logistics and the Reconstruction of Destroyed Paper Documentshttps://ac.tuwien.ac.at/publication/hybrid-optimization-methods-for-warehouse-logistics-and-the-reconstruction-of-destroyed-paper-documents/Tue, 01 Dec 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-optimization-methods-for-warehouse-logistics-and-the-reconstruction-of-destroyed-paper-documents/Ein hybrides Verfahren basierend auf Variabler Nachbarschaftssuche und Dynamischer Programmierung zur Tourenfindung in einem Ersatzteillager mit domänenspezifischen Nebenbedingungenhttps://ac.tuwien.ac.at/publication/ein-hybrides-verfahren-basierend-auf-variabler-nachbarschaftssuche-und-dynamischer-programmierung-zur-tourenfindung-in-einem-ersatzteillager-mit-domanenspezifischen-nebenbedingungen/Wed, 01 Apr 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/ein-hybrides-verfahren-basierend-auf-variabler-nachbarschaftssuche-und-dynamischer-programmierung-zur-tourenfindung-in-einem-ersatzteillager-mit-domanenspezifischen-nebenbedingungen/Exakte und heuristische Optimierungsmethoden zur Lösung von Video Server Load Re-Balancinghttps://ac.tuwien.ac.at/publication/exakte-und-heuristische-optimierungsmethoden-zur-losung-von-video-server-load-re-balancing/Wed, 01 Apr 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/exakte-und-heuristische-optimierungsmethoden-zur-losung-von-video-server-load-re-balancing/(Meta-)Heuristic Separation of Jump Cuts in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/meta-heuristic-separation-of-jump-cuts-in-a-branch-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem-2/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/meta-heuristic-separation-of-jump-cuts-in-a-branch-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem-2/A Column Generation Approach for the Periodic Vehicle Routing Problem with Time Windowshttps://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/A Hybrid Algorithm for Computing Tours in a Spare Parts Warehousehttps://ac.tuwien.ac.at/publication/a-hybrid-algorithm-for-computing-tours-in-a-spare-parts-warehouse/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-hybrid-algorithm-for-computing-tours-in-a-spare-parts-warehouse/A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Locationhttps://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-based-heuristic-for-capacitated-connected-facility-location/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-based-heuristic-for-capacitated-connected-facility-location/Boosting a Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows by ILP Techniqueshttps://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/Combining Lagrangian Decomposition with Very Large Scale Neighborhood Search for Capacitated Connected Facility Locationhttps://ac.tuwien.ac.at/publication/combining-lagrangian-decomposition-with-very-large-scale-neighborhood-search-for-capacitated-connected-facility-location/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-lagrangian-decomposition-with-very-large-scale-neighborhood-search-for-capacitated-connected-facility-location/Computing Optimized Stock (Re-)Placements in Last-In, First-Out Warehouseshttps://ac.tuwien.ac.at/publication/computing-optimized-stock-re-placements-in-last-in-first-out-warehouses/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-optimized-stock-re-placements-in-last-in-first-out-warehouses/Hybrid Metaheuristicshttps://ac.tuwien.ac.at/publication/hybrid-metaheuristics/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-metaheuristics/Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documentshttps://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/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/Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windowshttps://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/Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Searchhttps://ac.tuwien.ac.at/publication/solving-a-video-server-load-re-balancing-problem-by-mixed-integer-programming-and-hybrid-variable-neighborhood-search/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-a-video-server-load-re-balancing-problem-by-mixed-integer-programming-and-hybrid-variable-neighborhood-search/Generierung von Ein- und Umlagervorschlägen in Lagern mit einer Last-In First-Out Strategie und kundenspezifischen Auslagerpräferenzenhttps://ac.tuwien.ac.at/publication/generierung-von-ein-und-umlagervorschlagen-in-lagern-mit-einer-last-in-first-out-strategie-und-kundenspezifischen-auslagerpraferenzen/Mon, 01 Dec 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/generierung-von-ein-und-umlagervorschlagen-in-lagern-mit-einer-last-in-first-out-strategie-und-kundenspezifischen-auslagerpraferenzen/Hybrid Metaheuristics for Generalized Network Design Problemshttps://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/Parallel Variable Neighborhood Search for the Car Sequencing Problemhttps://ac.tuwien.ac.at/publication/parallel-variable-neighborhood-search-for-the-car-sequencing-problem/Wed, 01 Oct 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/parallel-variable-neighborhood-search-for-the-car-sequencing-problem/Ein hybrides Verfahren zur automatischen Rekonstruktion von handzerrissenen Dokumentenseiten mittels geometrischer Informationenhttps://ac.tuwien.ac.at/publication/ein-hybrides-verfahren-zur-automatischen-rekonstruktion-von-handzerrissenen-dokumentenseiten-mittels-geometrischer-informationen/Mon, 01 Sep 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/ein-hybrides-verfahren-zur-automatischen-rekonstruktion-von-handzerrissenen-dokumentenseiten-mittels-geometrischer-informationen/A Complete Archive Genetic Algorithm for the Multidimensional Knapsack Problemhttps://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/Lagrangian Relax-and-Cut and Hybrid methods for the Bounded Diameter and the Hop Constrained Minimum Spanning Tree Problemshttps://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/(Meta-)Heuristic Separation of Jump Cuts for the Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/meta-heuristic-separation-of-jump-cuts-for-the-bounded-diameter-minimum-spanning-tree-problem/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/meta-heuristic-separation-of-jump-cuts-for-the-bounded-diameter-minimum-spanning-tree-problem/(Meta-)Heuristic Separation of Jump Cuts in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/meta-heuristic-separation-of-jump-cuts-in-a-branch-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/meta-heuristic-separation-of-jump-cuts-in-a-branch-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/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/A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-lagrangian-relax-and-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-lagrangian-relax-and-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problemhttps://ac.tuwien.ac.at/publication/an-integer-linear-programming-approach-and-a-hybrid-variable-neighborhood-search-for-the-car-sequencing-problem-2/Tue, 01 Jan 2008 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-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/Combining Forces to Reconstruct Strip Shredded Text Documentshttps://ac.tuwien.ac.at/publication/combining-forces-to-reconstruct-strip-shredded-text-documents/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-forces-to-reconstruct-strip-shredded-text-documents/Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem-2/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem-2/Effective Neighborhood Structures for the Generalized Traveling Salesman Problemhttps://ac.tuwien.ac.at/publication/effective-neighborhood-structures-for-the-generalized-traveling-salesman-problem/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/effective-neighborhood-structures-for-the-generalized-traveling-salesman-problem/Finding Consensus Trees by Evolutionary, Variable Neighborhood Search, and Hybrid Algorithmshttps://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/Heuristic Cut Separation in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/heuristic-cut-separation-in-a-branch-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/heuristic-cut-separation-in-a-branch-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networkshttps://ac.tuwien.ac.at/publication/lagrangian-decomposition-metaheuristics-and-hybrid-approaches-for-the-design-of-the-last-mile-in-fiber-optic-networks/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/lagrangian-decomposition-metaheuristics-and-hybrid-approaches-for-the-design-of-the-last-mile-in-fiber-optic-networks/Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problemhttps://ac.tuwien.ac.at/publication/solving-the-railway-traveling-salesman-problem-via-a-transformation-into-the-classical-traveling-salesman-problem/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-railway-traveling-salesman-problem-via-a-transformation-into-the-classical-traveling-salesman-problem/Algorithmic Approaches to the String Barcoding Problemhttps://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/Subgradient Optimization Based Lagrangian Relaxation and Relax-and-Cut Approaches for the Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/subgradient-optimization-based-lagrangian-relaxation-and-relax-and-cut-approaches-for-the-bounded-diameter-minimum-spanning-tree-problem/Mon, 01 Oct 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/subgradient-optimization-based-lagrangian-relaxation-and-relax-and-cut-approaches-for-the-bounded-diameter-minimum-spanning-tree-problem/Metaheuristic Approaches for Designing Survivable Fiber-Optic Networkshttps://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/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/Compressing Fingerprint Templates by Solving an Extended Minimum Label Spanning Tree Problemhttps://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/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/Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problemhttps://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-the-generalized-minimum-edge-biconnected-network-problem/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-the-generalized-minimum-edge-biconnected-network-problem/A Lagrangian Decomposition Approach Combined with Metaheuristics for the Knapsack Constrained Maximum Spanning Tree Problemhttps://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/A Unified View on Hybrid Metaheuristicshttps://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/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/Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem/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/Dynamische Reihenfolgeoptimierung mittels Simulation und Meta-Heuristikenhttps://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/Exact and Heuristic Methods for Solving the Car Sequencing Problemhttps://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/An Extended Local Branching Framework and its Application to the Multidimensional Knapsack Problemhttps://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/A New 0–1 ILP Approach for the Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-new-0-1-ilp-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-new-0-1-ilp-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/A Variable Neighborhood Search Approach for Solving the Car Sequencing Problemhttps://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/An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problemhttps://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/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/Computing Generalized Minimum Spanning Trees with Variable Neighborhood Searchhttps://ac.tuwien.ac.at/publication/computing-generalized-minimum-spanning-trees-with-variable-neighborhood-search/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-generalized-minimum-spanning-trees-with-variable-neighborhood-search/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 Alignment Graph based Evolutionary Algorithm for the Multiple Sequence Alignment Problemhttps://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/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/An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problemhttps://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/An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problemhttps://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/Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problemhttps://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/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/Ein evolutionärer Algorithmus zur Lösung des Vertex-Biconnectivity Augmentation Problemshttps://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/Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problemhttps://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/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/Ein Genetischer Algorithmus für das Generalized Assignment Problemhttps://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/Hybrid Evolutionary Algorithms for Combinatorial Optimizationhttps://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/A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphshttps://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/A Memetic Algorithm for Vertex-Biconnectivity Augmentationhttps://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/Evolutionary Local Search for the Edge-Biconnectivity Augmentation Problemhttps://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/An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problemhttps://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/A Hybrid GA for the Edge-Biconnectivity Augmentation Problemhttps://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/Weight-Codings in a Genetic Algorithm for the Multiconstraint Knapsack Problemhttps://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/An Improved Genetic Algorithm for the Multiconstrained 0–1 Knapsack Problemhttps://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/