Klinz Bettina

Bettina Klinz

Information about the author Bettina Klinz will soon be added to the site.
Found 7 papers in total
Geometric versions of the three-dimensional assignment problem under general norms
Geometric versions of the three-dimensional assignment problem under general norms
2015
We discuss the computational complexity of special cases of the...
Polynomially solvable cases of the constant rank unconstrained quadratic 0–1 programming problem
Polynomially solvable cases of the constant rank unconstrained quadratic 0–1 programming problem
2006
In this paper we consider the constant rank unconstrained quadratic 0–1...
Exact algorithms for the Hamiltonian cycle problem in planar graphs
Exact algorithms for the Hamiltonian cycle problem in planar graphs
2006
We construct an exact algorithm for the Hamiltonian cycle problem in planar graphs...
Bottleneck capacity expansion problems with general budget constraints
Bottleneck capacity expansion problems with general budget constraints
2001
This paper presents a unified approach for bottleneck capacity expansion problems. In...
Minimum-cost dynamic flows: The series-parallel case
Minimum-cost dynamic flows: The series-parallel case
2004
A dynamic network consists of a directed graph with capacities, costs, and integral...
A note on the bottleneck graph partition problem
A note on the bottleneck graph partition problem
1999
The bottleneck graph partition problem consists of partitioning the vertices of an...
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
1999
In the minimum-cost strong network orientation problem (MCSO), we are given an...
Papers per page: