2 citations · 2 across the 9 of their papers we have counts for
6 papers · 1 filter
A Multi-objective Perspective on the Cable-Trench Problem
Lara Löhken, Michael Stiglmayr
The cable-trench problem is defined as a linear combination of the shortest path and the minimum spanning tree problem. In particular, the goal is to find a spanning tree that simu…
Adaptive Improvements of Multi-Objective Branch and Bound
Julius Bauß, Sophie N. Parragh, Michael Stiglmayr
Branch and bound methods which are based on the principle "divide and conquer" are a well established solution approach in single-objective integer programming. In multi-objective…
Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems
David Könen, Michael Stiglmayr
This paper addresses the output-sensitive complexity for linear multi-objective integer minimum cost flow (MOIMCF) problems and provides insights about the time complexity for enum…
Adapting Branching and Queuing for Multi-objective Branch and Bound
Julius Bauß, Michael Stiglmayr
Branch and bound algorithms have to cope with several additional difficulties in the multi-objective case. Not only the bounding procedure is considerably weaker, but also the hand…
An Output-Polynomial Time Algorithm to Determine all Supported Efficient Solutions for Multi-Objective Integer Network Flow Problems
David Könen, Michael Stiglmayr
This paper addresses the problem of enumerating all supported efficient solutions for a linear multi-objective integer minimum cost flow problem (MOIMCF). It derives an output-poly…
Augmenting Bi-objective Branch and Bound by Scalarization-Based Information
Julius Bauß, Michael Stiglmayr
While Branch and Bound based algorithms are a standard approach to solve single-objective (mixed-)integer optimization problems, multi-objective Branch and Bound methods are only r…