Netdesign | AC Group | TU Wienhttps://ac.tuwien.ac.at/tag/netdesign/NetdesignHugo Blox Builder (https://hugoblox.com)en-usFri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngNetdesignhttps://ac.tuwien.ac.at/tag/netdesign/A Memetic Algorithm for the Virtual Network Mapping Problemhttps://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/Optimization Challenges of the Future Federated Internethttps://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/Critical Links Detection using CUDAhttps://ac.tuwien.ac.at/publication/critical-links-detection-using-cuda/Mon, 01 Apr 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/critical-links-detection-using-cuda/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 Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problemhttps://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/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/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/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/Stabilizing Branch-and-Price for Constrained Tree Problemshttps://ac.tuwien.ac.at/publication/stabilizing-branch-and-price-for-constrained-tree-problems/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/stabilizing-branch-and-price-for-constrained-tree-problems/Using Optimized Virtual Network Embedding for Network Dimensioninghttps://ac.tuwien.ac.at/publication/using-optimized-virtual-network-embedding-for-network-dimensioning/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/using-optimized-virtual-network-embedding-for-network-dimensioning/On Solving Constrained Tree Problems and an Adaptive Layers Frameworkhttps://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/A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problemhttps://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/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-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-multilevel-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem-2/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-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archive-for-the-generalized-minimum-spanning-tree-problem-2/An Evolutionary Algorithm with Solution Archives and Bounding Extension for the Generalized Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archives-and-bounding-extension-for-the-generalized-minimum-spanning-tree-problem/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archives-and-bounding-extension-for-the-generalized-minimum-spanning-tree-problem/Automatic Generation of 2-AntWars Players with Genetic Programminghttps://ac.tuwien.ac.at/publication/automatic-generation-of-2-antwars-players-with-genetic-programming-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/automatic-generation-of-2-antwars-players-with-genetic-programming-2/Hybrid Heuristics for Multimodal Homecare Schedulinghttps://ac.tuwien.ac.at/publication/hybrid-heuristics-for-multimodal-homecare-scheduling/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-heuristics-for-multimodal-homecare-scheduling/On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problemhttps://ac.tuwien.ac.at/publication/on-solving-the-rooted-delay-and-delay-variation-constrained-steiner-tree-problem/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-solving-the-rooted-delay-and-delay-variation-constrained-steiner-tree-problem/Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Locationhttps://ac.tuwien.ac.at/publication/variable-neighborhood-and-greedy-randomized-adaptive-search-for-capacitated-connected-facility-location/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-and-greedy-randomized-adaptive-search-for-capacitated-connected-facility-location/Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Designhttps://ac.tuwien.ac.at/publication/variable-neighborhood-search-and-grasp-for-three-layer-hierarchical-ring-network-design/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-search-and-grasp-for-three-layer-hierarchical-ring-network-design/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/Ein Lösungsarchiv mit Branch-and-Bound-Erweiterung für das Generalized Minimum Spanning Tree Problemhttps://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/Heuristic Methods for the Hop Constrained Survivable Network Design Problemhttps://ac.tuwien.ac.at/publication/heuristic-methods-for-the-hop-constrained-survivable-network-design-problem/Thu, 01 Sep 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/heuristic-methods-for-the-hop-constrained-survivable-network-design-problem/Branch-and-Price for the Steiner Tree Problem with Revenues, Budget and Hop Constraintshttps://ac.tuwien.ac.at/publication/branch-and-price-for-the-steiner-tree-problem-with-revenues-budget-and-hop-constraints/Mon, 01 Aug 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/branch-and-price-for-the-steiner-tree-problem-with-revenues-budget-and-hop-constraints/Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problemhttps://ac.tuwien.ac.at/publication/stabilized-branch-and-price-for-the-rooted-delay-constrained-steiner-tree-problem/Wed, 01 Jun 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/stabilized-branch-and-price-for-the-rooted-delay-constrained-steiner-tree-problem/Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problemhttps://ac.tuwien.ac.at/publication/stabilized-column-generation-for-the-rooted-delay-constrained-steiner-tree-problem/Sun, 01 May 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/stabilized-column-generation-for-the-rooted-delay-constrained-steiner-tree-problem/A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problemshttps://ac.tuwien.ac.at/publication/a-layered-graph-model-and-an-adaptive-layers-framework-to-solve-delay-constrained-minimum-tree-problems/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-layered-graph-model-and-an-adaptive-layers-framework-to-solve-delay-constrained-minimum-tree-problems/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/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/Branch-and-Cut-and-Price for Capacitated Connected Facility Locationhttps://ac.tuwien.ac.at/publication/branch-and-cut-and-price-for-capacitated-connected-facility-location-2/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/branch-and-cut-and-price-for-capacitated-connected-facility-location-2/Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraintshttps://ac.tuwien.ac.at/publication/introducing-the-virtual-network-mapping-problem-with-delay-routing-and-location-constraints/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/introducing-the-virtual-network-mapping-problem-with-delay-routing-and-location-constraints/On Stabilized Branch-and-Price for Constrained Tree Problemshttps://ac.tuwien.ac.at/publication/on-stabilized-branch-and-price-for-constrained-tree-problems/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-stabilized-branch-and-price-for-constrained-tree-problems/Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniqueshttps://ac.tuwien.ac.at/publication/solving-the-minimum-label-spanning-tree-problem-by-mathematical-programming-techniques/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-minimum-label-spanning-tree-problem-by-mathematical-programming-techniques/Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/using-a-solution-archive-to-enhance-metaheuristics-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/using-a-solution-archive-to-enhance-metaheuristics-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/Variable Neighborhood Search for Capacitated Connected Facility Locationhttps://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-capacitated-connected-facility-location/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-capacitated-connected-facility-location/Ein neues Lösungsarchiv für das Generalized Minimum Spanning Tree-Problemhttps://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/Solving the k-Node Minimum Label Spanning Arborescence Problem with Exact and Heuristic Methodshttps://ac.tuwien.ac.at/publication/solving-the-k-node-minimum-label-spanning-arborescence-problem-with-exact-and-heuristic-methods/Sun, 01 Aug 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-k-node-minimum-label-spanning-arborescence-problem-with-exact-and-heuristic-methods/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/On the Minimum Label Spanning Tree Problem: Solution Methods and Applicationshttps://ac.tuwien.ac.at/publication/on-the-minimum-label-spanning-tree-problem-solution-methods-and-applications/Sat, 01 May 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-minimum-label-spanning-tree-problem-solution-methods-and-applications/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/Compressing Fingerprint Templates by Solving the k-Node Minimum Label Spanning Arborescence Problem by Branch-and-Pricehttps://ac.tuwien.ac.at/publication/compressing-fingerprint-templates-by-solving-the-k-node-minimum-label-spanning-arborescence-problem-by-branch-and-price/Mon, 01 Feb 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/compressing-fingerprint-templates-by-solving-the-k-node-minimum-label-spanning-arborescence-problem-by-branch-and-price/Heuristic methods for solving two Generalized Network Problemshttps://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/A Memetic Algorithm with Population Management for the Generalized Minimum Vertex-Biconnected Network Problemhttps://ac.tuwien.ac.at/publication/a-memetic-algorithm-with-population-management-for-the-generalized-minimum-vertex-biconnected-network-problem/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-with-population-management-for-the-generalized-minimum-vertex-biconnected-network-problem/Branch-and-Cut-and-Price for Capacitated Connected Facility Locationhttps://ac.tuwien.ac.at/publication/branch-and-cut-and-price-for-capacitated-connected-facility-location/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/branch-and-cut-and-price-for-capacitated-connected-facility-location/Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archivehttps://ac.tuwien.ac.at/publication/enhancing-genetic-algorithms-by-a-trie-based-complete-solution-archive/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/enhancing-genetic-algorithms-by-a-trie-based-complete-solution-archive/Multilevel Variable Neighborhood Search for Periodic Routing Problemshttps://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/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 Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Searchhttps://ac.tuwien.ac.at/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search-2/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search-2/Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/variable-neighborhood-search-and-ant-colony-optimization-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-search-and-ant-colony-optimization-for-the-rooted-delay-constrained-minimum-spanning-tree-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 Lösungsarchiv-unterstützter evolutionärer Algorithmus für das Generalized Minimum Spanning Tree-Problemhttps://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/Exact and Heuristic Approaches for Solving the Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/exact-and-heuristic-approaches-for-solving-the-bounded-diameter-minimum-spanning-tree-problem/Fri, 01 May 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-and-heuristic-approaches-for-solving-the-bounded-diameter-minimum-spanning-tree-problem/Accelerating Column Generation for a Survivable Network Design Problemhttps://ac.tuwien.ac.at/publication/accelerating-column-generation-for-a-survivable-network-design-problem/Wed, 01 Apr 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/accelerating-column-generation-for-a-survivable-network-design-problem/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/Solving a Multi-Constrained Network Design Problem by Lagrangean Decomposition and Column Generationhttps://ac.tuwien.ac.at/publication/solving-a-multi-constrained-network-design-problem-by-lagrangean-decomposition-and-column-generation/Wed, 01 Apr 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-a-multi-constrained-network-design-problem-by-lagrangean-decomposition-and-column-generation/Event Based Similarity Search and its Applications in Business Analyticshttps://ac.tuwien.ac.at/publication/event-based-similarity-search-and-its-applications-in-business-analytics/Sun, 01 Mar 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/event-based-similarity-search-and-its-applications-in-business-analytics/Similarity Searching in Complex Business Events and Sequences thereofhttps://ac.tuwien.ac.at/publication/similarity-searching-in-complex-business-events-and-sequences-thereof/Sun, 01 Mar 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/similarity-searching-in-complex-business-events-and-sequences-thereof/Enhancing a Genetic Algorithm by a Complete Solution Archive Based on a Trie Data Structurehttps://ac.tuwien.ac.at/publication/enhancing-a-genetic-algorithm-by-a-complete-solution-archive-based-on-a-trie-data-structure/Sun, 01 Feb 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/enhancing-a-genetic-algorithm-by-a-complete-solution-archive-based-on-a-trie-data-structure/(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 Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-kruskal-based-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem-2/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-kruskal-based-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem-2/A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-kruskal-based-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-kruskal-based-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/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/A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problemhttps://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-generalized-minimum-vertex-biconnected-network-problem/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-generalized-minimum-vertex-biconnected-network-problem/Cluster-Based (Meta-)Heuristics for the Euclidean Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/cluster-based-meta-heuristics-for-the-euclidean-bounded-diameter-minimum-spanning-tree-problem/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/cluster-based-meta-heuristics-for-the-euclidean-bounded-diameter-minimum-spanning-tree-problem/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/Exploiting Hierarchical Clustering for Finding Bounded Diameter Minimum Spanning Trees on Euclidean Instanceshttps://ac.tuwien.ac.at/publication/exploiting-hierarchical-clustering-for-finding-bounded-diameter-minimum-spanning-trees-on-euclidean-instances/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/exploiting-hierarchical-clustering-for-finding-bounded-diameter-minimum-spanning-trees-on-euclidean-instances/Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templateshttps://ac.tuwien.ac.at/publication/solving-an-extended-minimum-label-spanning-tree-problem-to-compress-fingerprint-templates-2/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-an-extended-minimum-label-spanning-tree-problem-to-compress-fingerprint-templates-2/Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristicshttps://ac.tuwien.ac.at/publication/solving-the-euclidean-bounded-diameter-minimum-spanning-tree-problem-by-clustering-based-meta-heuristics/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-euclidean-bounded-diameter-minimum-spanning-tree-problem-by-clustering-based-meta-heuristics/Design eines sicherheits-, zeit- und kostenkritischen Kommunikationsnetzwerkes mittels Lagrange Relaxierung und Spaltengenerierunghttps://ac.tuwien.ac.at/publication/design-eines-sicherheits-zeit-und-kostenkritischen-kommunikationsnetzwerkes-mittels-lagrange-relaxierung-und-spaltengenerierung/Mon, 01 Dec 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/design-eines-sicherheits-zeit-und-kostenkritischen-kommunikationsnetzwerkes-mittels-lagrange-relaxierung-und-spaltengenerierung/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/Combinatorial Optimization for the Compression of Biometric Templateshttps://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/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/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/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/Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problemhttps://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-a-prize-collecting-capacity-constrained-connected-facility-location-problem/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-a-prize-collecting-capacity-constrained-connected-facility-location-problem/Map-Matching und Wegsuche in einem geografischen Informationssystemhttps://ac.tuwien.ac.at/publication/map-matching-und-wegsuche-in-einem-geografischen-informationssystem/Sat, 01 Dec 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/map-matching-und-wegsuche-in-einem-geografischen-informationssystem/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 Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networkshttps://ac.tuwien.ac.at/publication/a-directed-cut-model-for-the-design-of-the-last-mile-in-real-world-fiber-optic-networks/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-directed-cut-model-for-the-design-of-the-last-mile-in-real-world-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/A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networkshttps://ac.tuwien.ac.at/publication/a-multi-commodity-flow-approach-for-the-design-of-the-last-mile-in-real-world-fiber-optic-networks/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-multi-commodity-flow-approach-for-the-design-of-the-last-mile-in-real-world-fiber-optic-networks/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/Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problemhttps://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/The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Searchhttps://ac.tuwien.ac.at/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search/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/Cluster Planarity Testing for the Case of Not Necessarily Connected Clustershttps://ac.tuwien.ac.at/publication/cluster-planarity-testing-for-the-case-of-not-necessarily-connected-clusters/Fri, 01 Dec 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/cluster-planarity-testing-for-the-case-of-not-necessarily-connected-clusters/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/An Ant Colony Optimisation Algorithm for the Bounded Diameter Minimum Spanning Tree Problemhttps://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/Biased Mutation Operators for Subgraph-Selection Problemshttps://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/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/Evolutionary Approach to Constrained Minimum Spanning Tree Problemhttps://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/Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACOhttps://ac.tuwien.ac.at/publication/neighborhood-searches-for-the-bounded-diameter-minimum-spanning-tree-problem-embedded-in-a-vns-ea-and-aco/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/neighborhood-searches-for-the-bounded-diameter-minimum-spanning-tree-problem-embedded-in-a-vns-ea-and-aco/Variable Neighborhood Descent with Self-Adaptive Neighborhood-Orderinghttps://ac.tuwien.ac.at/publication/variable-neighborhood-descent-with-self-adaptive-neighborhood-ordering/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-descent-with-self-adaptive-neighborhood-ordering/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/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/Variable Neighborhood Search for the Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-the-bounded-diameter-minimum-spanning-tree-problem/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-the-bounded-diameter-minimum-spanning-tree-problem/Ein Genetischer Algorithmus für das Optimum Communication Spanning Tree Problemhttps://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/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/Biased Mutation Operators for Subgraph-Selection Problemshttps://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/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/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/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 Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problemhttps://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/Edge-Sets: An Effective Evolutionary Coding of Spanning Treeshttps://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/Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problemhttps://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/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/Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edgeshttps://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/On Weight-Biased Mutation for Graph Problemshttps://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/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/Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Searchhttps://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/Weight-Biased Edge-Crossover in Evolutionary Algorithms for Two Graph Problemshttps://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/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/A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problemhttps://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/A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problemhttps://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/An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problemhttps://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/