3 citations · 8 across the 5 of their papers we have counts for
6 papers
What Are We Clustering For? Establishing Performance Guarantees for Time Series Aggregation in Generation Expansion Planning
Luca Santosuosso, Bettina Klinz, Sonja Wogrin
Generation expansion planning (GEP) is a prominent example of capacity expansion problems in operations research. Being generally NP-hard, GEP optimization models can become intrac…
A linear time algorithm for linearizing quadratic and higher-order shortest path problems
Eranda Çela, Bettina Klinz, Stefan Lendl +2
An instance of the NP-hard Quadratic Shortest Path Problem (QSPP) is called linearizable iff it is equivalent to an instance of the classic Shortest Path Problem (SPP) on the same…
The bipartite travelling salesman problem: A pyramidally solvable case
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
In the bipartite travelling salesman problem (BTSP), we are given cities along with an distance matrix and a partition of the cities into red and blue ci…
Geometric versions of the 3-dimensional assignment problem under general norms
Ante Ćustić, Bettina Klinz, Gerhard J. Woeginger
We discuss the computational complexity of special cases of the 3-dimensional (axial) assignment problem where the elements are points in a Cartesian space and where the cost coeff…
Planar 3-dimensional assignment problems with Monge-like cost arrays
Ante Ćustić, Bettina Klinz, Gerhard J. Woeginger
Given an cost array we consider the problem -P3AP which consists in finding pairwise disjoint permutations of s…
The constant objective value property for combinatorial optimization problems
Ante Ćustić, Bettina Klinz
Given a combinatorial optimization problem, we aim at characterizing the set of all instances for which every feasible solution has the same objective value. Our central result dea…