Markus Leitner | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/markus-leitner/Markus LeitnerHugo Blox Builder (https://hugoblox.com)en-usMon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngMarkus Leitnerhttps://ac.tuwien.ac.at/team/markus-leitner/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/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/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/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/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/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/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/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/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/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/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/Combining Lagrangian Decomposition with Very Large Scale Neighborhoood Search for Capacitated Connected Facility Locationhttps://ac.tuwien.ac.at/publication/combining-lagrangian-decomposition-with-very-large-scale-neighborhoood-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-neighborhoood-search-for-capacitated-connected-facility-location/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/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/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/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/Solving Two Generalized Network Design Problems with Exact and Heuristic Methodshttps://ac.tuwien.ac.at/publication/solving-two-generalized-network-design-problems-with-exact-and-heuristic-methods/Mon, 01 May 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-two-generalized-network-design-problems-with-exact-and-heuristic-methods/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/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/