Search

AC Group | TU Wien
AC Group | TU Wien
  • People
  • Research
  • Courses
  • Updates
  • Jobs
  • Contact
  • Internal
  • Light Dark Automatic

Martin Gruber

    Recent Publications

    Exact and Heuristic Approaches for Solving the Bounded Diameter Minimum Spanning Tree Problem

    2009

    (Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

    2009

    Exploiting Hierarchical Clustering for Finding Bounded Diameter Minimum Spanning Trees on Euclidean Instances

    2009

    (Meta-)Heuristic Separation of Jump Cuts for the Bounded Diameter Minimum Spanning Tree Problem

    2008

    A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

    2008

    Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

    2008

    Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACO

    2006

    A New 0--1 ILP Approach for the Bounded Diameter Minimum Spanning Tree Problem

    2005

    Cooperating Memetic and Branch-and-Cut Algorithms for Solving the Multidimensional Knapsack Problem

    2005

    Variable Neighborhood Search for the Bounded Diameter Minimum Spanning Tree Problem

    2005

    TU Wien Informatics
    © 2026 Algorithms and Complexity Group
    Legal Notice · Privacy Policy

    Cite
    Copy Download