Bettina Klinz

According to our database1, Bettina Klinz authored at least 31 papers between 1993 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2016
The constant objective value property for multidimensional assignment problems.
Discret. Optim., 2016

2015
Geometric versions of the three-dimensional assignment problem under general norms.
Discret. Optim., 2015

2014
Four-point conditions for the TSP: The complete complexity classification.
Discret. Optim., 2014

Geometric versions of the 3-dimensional assignment problem under general norms.
CoRR, 2014

Planar 3-dimensional assignment problems with Monge-like cost arrays.
CoRR, 2014

2013
Uniqueness in quadratic and hyperbolic 0-1 programming problems.
Oper. Res. Lett., 2013

2011
The Northwest corner rule revisited.
Discret. Appl. Math., 2011

2010
A fast parametric assignment algorithm with applications in max-algebra.
Networks, 2010

2009
The complexity of computing the Muirhead-Dalton distance.
Math. Soc. Sci., 2009

Polygons with inscribed circles and prescribed side lengths.
Appl. Math. Lett., 2009

The computational complexity of bilevel assignment problems.
4OR, 2009

2006
Exact algorithms for the Hamiltonian cycle problem in planar graphs.
Oper. Res. Lett., 2006

Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem.
J. Comb. Optim., 2006

Four point conditions and exponential neighborhoods for symmetric TSP.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

ILP Models for a Nurse Scheduling Problem.
Proceedings of the Operations Research, 2006

2005
Faster algorithms for computing power indices in weighted voting games.
Math. Soc. Sci., 2005

2004
Minimum-cost dynamic flows: The series-parallel case.
Networks, 2004

2003
Book Reviews.
Math. Methods Oper. Res., 2003

Which matrices are immune against the transportation paradox?
Discret. Appl. Math., 2003

2001
Bottleneck Capacity Expansion Problems with General Budget Constraints.
RAIRO Oper. Res., 2001

1999
A note on the bottleneck graph partition problem.
Networks, 1999

Minimum-cost strong network orientation problems: Classification, complexity, and algorithms.
Networks, 1999

A note on the complexity of the transportation problem with a permutable demand vector.
Math. Methods Oper. Res., 1999

The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices.
J. Comb. Optim., 1999

1998
One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs.
Oper. Res. Lett., 1998

1996
Perspectives of Monge Properties in Optimization.
Discret. Appl. Math., 1996

1995
on the Recognition of Permuted Bottleneck Monge Matrices.
Discret. Appl. Math., 1995

Permuting Matrices to Avoid Forbidden Submatrices.
Discret. Appl. Math., 1995

A New Efficiently Solvable Special Case of the Three-Dimensional Axial Bottleneck Assignment Problem.
Proceedings of the Combinatorics and Computer Science, 1995

1993
The quickest flow problem.
ZOR Methods Model. Oper. Res., 1993

On the Biquadratic Assignment Problem.
Proceedings of the Quadratic Assignment and Related Problems, 1993


  Loading...