https://ac.tuwien.ac.at/team/martin-gruber/Martin GruberHugo Blox Builder (https://hugoblox.com)en-usFri, 01 May 2009 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pnghttps://ac.tuwien.ac.at/team/martin-gruber/https://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/https://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/https://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/https://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/https://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/https://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/https://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/https://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/https://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/https://ac.tuwien.ac.at/publication/cooperating-memetic-and-branch-and-cut-algorithms-for-solving-the-multidimensional-knapsack-problem/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/cooperating-memetic-and-branch-and-cut-algorithms-for-solving-the-multidimensional-knapsack-problem/https://ac.tuwien.ac.at/publication/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/