Mip | AC Group | TU Wienhttps://ac.tuwien.ac.at/tag/mip/MipHugo Blox Builder (https://hugoblox.com)en-usTue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngMiphttps://ac.tuwien.ac.at/tag/mip/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/Exact approaches for the directed network design problem with relayshttps://ac.tuwien.ac.at/publication/exact-approaches-for-the-directed-network-design-problem-with-relays-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-approaches-for-the-directed-network-design-problem-with-relays-2/Exact approaches for the directed network design problem with relayshttps://ac.tuwien.ac.at/publication/exact-approaches-for-the-directed-network-design-problem-with-relays/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-approaches-for-the-directed-network-design-problem-with-relays/Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decompositionhttps://ac.tuwien.ac.at/publication/solving-a-selective-dial-a-ride-problem-with-logic-based-benders-decomposition/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-a-selective-dial-a-ride-problem-with-logic-based-benders-decomposition/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/Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problemhttps://ac.tuwien.ac.at/publication/hierarchical-clustering-and-multilevel-refinement-for-the-bike-sharing-station-planning-problem/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/hierarchical-clustering-and-multilevel-refinement-for-the-bike-sharing-station-planning-problem/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/Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decompositionhttps://ac.tuwien.ac.at/publication/solving-a-selective-dial-a-ride-problem-with-logic-based-benders-decomposition-2/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-a-selective-dial-a-ride-problem-with-logic-based-benders-decomposition-2/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/Solving the Travelling Thief Problem with an Evolutionary Algorithmhttps://ac.tuwien.ac.at/publication/solving-the-travelling-thief-problem-with-an-evolutionary-algorithm/Tue, 01 Sep 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-travelling-thief-problem-with-an-evolutionary-algorithm/Electric Vehicles Recharge Scheduling with Logic-Based Benders Decompositionhttps://ac.tuwien.ac.at/publication/electric-vehicles-recharge-scheduling-with-logic-based-benders-decomposition/Wed, 01 Jul 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/electric-vehicles-recharge-scheduling-with-logic-based-benders-decomposition/Optimization Approaches for Recreational Bicycle Tour Planninghttps://ac.tuwien.ac.at/publication/optimization-approaches-for-recreational-bicycle-tour-planning/Wed, 01 Apr 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimization-approaches-for-recreational-bicycle-tour-planning/Exact Approaches for Network Design Problems with Relayshttps://ac.tuwien.ac.at/publication/exact-approaches-for-network-design-problems-with-relays-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-approaches-for-network-design-problems-with-relays-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/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/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/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/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/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/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/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/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/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/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 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/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/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/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/(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 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/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/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/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/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 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/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 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/Exact Methods and Metaheuristic Approaches for Deriving High Quality Fully Resolved Consensus Treeshttps://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/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/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 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/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/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/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 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/