No photo of Bettina Klinz

Bettina Klinz

Ao.Univ.-Prof. Dipl.-Ing. Dr.techn.

1989 …2022
If you made any changes in Pure these will be visible here soon.

Research Output 1989 2016

2016

The constant objective value property for multidimensional assignment problems

Custic, A. & Klinz, B., 2016, In : Discrete optimization. p. 23-35

Research output: Contribution to journalArticleResearchpeer-review

2015

Geometric versions of the 3-dimensional assignment problem under general norms

Custic, A., Klinz, B. & Wöginger, G. J., 2015, In : Discrete optimization. 18, p. 38-55

Research output: Contribution to journalArticleResearchpeer-review

2014

Four-point conditions for the TSP: The complete complexity classification

Deineko, V., Klinz, B., Tiskin, A. & Wöginger, G. J., 2014, In : Discrete optimization. 14, p. 147-159

Research output: Contribution to journalArticleResearchpeer-review

2013

Uniqueness in quadratic and hyperbolic 0–1 programming problems

Deineko, V., Klinz, B. & Wöginger, G. J., 2013, In : Operations research letters. 41, 6, p. 633-635

Research output: Contribution to journalArticleResearchpeer-review

2011

The Northwest corner rule revisited

Klinz, B. & Wöginger, G. J., 2011, In : Discrete applied mathematics. 159, 12, p. 1284-1289

Research output: Contribution to journalArticleResearchpeer-review

2010

A Fast Parametric Assignment Algorithm with Applications in Max-Algebra

Gassner, E. & Klinz, B., 2010, In : Networks. 55, 2, p. 61-77

Research output: Contribution to journalArticleResearchpeer-review

2009

Polygons with inscribed circles and prescribed side lengths

Deineko, V., Klinz, B. & Wöginger, G. J., 2009, In : Applied Mathematics Letters. 22, 5, p. 704-706

Research output: Contribution to journalArticleResearchpeer-review

The complexity of computing the Muirhead–Dalton distance

Deineko, V., Klinz, B. & Wöginger, G. J., 2009, In : Mathematical social sciences. 57, 2, p. 282-284

Research output: Contribution to journalArticleResearchpeer-review

The computational complexity of bilevel assignment problems

Gassner, E. & Klinz, B., 2009, In : 4OR. 7, p. 379-394

Research output: Contribution to journalArticleResearchpeer-review

2006

Exact algorithms for the Hamiltonian cycle problem in planar graphs

Deineko, V., Klinz, B. & Wöginger, G. J., 2006, In : Operations research letters. 34, 3, p. 269-274

Research output: Contribution to journalArticleResearchpeer-review

Four point conditions and exponential neighborhoods for symmetric TSP

Deineko, V., Klinz, B. & Wöginger, G. J., 2006, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm. New York: Association of Computing Machinery, p. 544-553

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

ILP Models for a Nurse Scheduling Problem

Klinz, B., Pferschy, U. & Schauer, J., 2006, Operations Research Proceedings 2006. Berlin, Heidelberg: Springer, p. 319-324

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem

Dragoti-Cela, E., Klinz, B. & Meyer, C., 2006, In : Journal of combinatorial optimization. 12, p. 187-215

Research output: Contribution to journalArticleResearchpeer-review

2005

Faster algorithms for computing power indices in weighted voting games

Klinz, B. & Wöginger, G. J., 2005, In : Mathematical social sciences. 49, p. 111-116

Research output: Contribution to journalArticleResearchpeer-review

2004

Minimum cost dynamic flow problems: The series-parallel case

Klinz, B. & Wöginger, G. J., 2004, In : Networks. 43, p. 153-162

Research output: Contribution to journalArticleResearchpeer-review

2003

Which cost matrices are immune against the transportation paradox?

Deineko, V., Klinz, B. & Wöginger, G. J., 2003, In : Discrete applied mathematics. 130, p. 495-501

Research output: Contribution to journalArticleResearchpeer-review

2001

Bottleneck capacity expansion problems with general budget constraints

Burkard, R. E., Klinz, B. & Zhang, J., 2001, In : RAIRO / Operations research. 35, p. 1-20

Research output: Contribution to journalArticleResearchpeer-review

Capacity expansion and weight reduction problems

Burkard, R. E., Klinz, B., Lin, Y. & Zhang, J., 2001, Proceedings of the 6th International Symposium on Operational Research. Ljubljana: Slovenian Society Informatika, p. 119-124

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearch

1999

A note on the bottleneck graph partition problem

Klinz, B. & Wöginger, G. J., 1999, In : Networks. 33, 3, p. 189-191

Research output: Contribution to journalArticleResearchpeer-review

A note on the complexity of the transportation problem with a permutable demand vector

Hujter, M., Klinz, B. & Wöginger, G. J., 1999, In : Mathematical Methods of Operations Research. 50, p. 9-16

Research output: Contribution to journalArticleResearchpeer-review

Minimum cost strong network orientation problems: Classification, algorithms and complexity

Burkard, R. E., Feldbacher, K., Klinz, B. & Wöginger, G. J., 1999, In : Networks. 33, 1, p. 57-70

Research output: Contribution to journalArticleResearchpeer-review

The Steiner tree problem in Kalmanson matrices and in circulant matrices

Klinz, B. & Wöginger, G. J., 1999, In : Journal of combinatorial optimization. 3, p. 51-58

Research output: Contribution to journalArticleResearchpeer-review

1998

A process scheduling problem arising from chemical production planning

Burkard, R. E., Klinz, B., Rudolf, R. & Wennink, M., 1998, In : Optimization methods & software. p. 175-196

Research output: Contribution to journalArticleResearchpeer-review

One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs

Klinz, B. & Wöginger, G. J., 1998, In : Operations research letters. 22, p. 119-127

Research output: Contribution to journalArticleResearchpeer-review

The computational complexity of multi-level programming problems revisited

Dudas, T., Klinz, B. & Wöginger, G. J., 1998, Multilevel optimization: Algorithms and Applications. Dortrecht, New York: Kluwer Academic Publishers, Vol. 20. p. 165-179 (NONCONVEX OPTIMIZATION AND ITS APPLICATIONS).

Research output: Chapter in Book/Report/Conference proceedingChapterResearch

The k-minimum spanning tree problem in graded matrices

Dudas, T., Klinz, B. & Wöginger, G. J., 1998, In : Computers & mathematics with applications. 36, p. 61-67

Research output: Contribution to journalArticleResearchpeer-review

1997

The computational complexity of Steiner tree problems in graded matrices

Klinz, B., Wöginger, G. J. & Dudas, T., 1997, In : Applied Mathematics Letters. 10, 4, p. 35-39

Research output: Contribution to journalArticleResearchpeer-review

1996

A new efficiently solvable special case of the axial 3-dimensional assignment bottleneck problem

Klinz, B. & Wöginger, G. J., 1996, In : Lecture notes in computer science. 1120, p. 150-162

Research output: Contribution to journalArticleResearchpeer-review

Perspectives of Monge properties in combinatorial optimization

Burkard, R. E., Klinz, B. & Rudolf, R., 1996, In : Discrete applied mathematics. 70, p. 95-161

Research output: Contribution to journalArticleResearchpeer-review

1995

On the recognition of bottleneck Monge matrices

Klinz, B., Rudolf, R. & Wöginger, G. J., 1995, In : Discrete applied mathematics. 63, p. 43-74

Research output: Contribution to journalArticleResearchpeer-review

Permuting matrices to avoid forbidden submatrices

Klinz, B., Wöginger, G. J. & Rudolf, R., 1995, In : Discrete applied mathematics. 60, p. 223-248

Research output: Contribution to journalArticleResearchpeer-review

1994

On the biquadratic assignment problem

Burkard, R. E., Dragoti-Cela, E. & Klinz, B., 1994, Quadratic Assignment and Related Problems. Providence: American Mathematical Society, Vol. 16. p. 117-146 (DIMACS Series in Discrete Mathematics and Theoretical Computer Science).

Research output: Chapter in Book/Report/Conference proceedingChapterResearch

1993

Minimum concave-cost network flow problems with a single nonlinear arc cost

Klinz, B. & Tuy, H., 1993, Network Optimization Problems: Algorithms, Applications and Complexity. Singapore: World Scientific, Vol. 2. p. 125-143 (Series in Applied Mathematics).

Research output: Chapter in Book/Report/Conference proceedingChapterResearch

On the Recognition of Bottleneck Monge Matrices

Klinz, B., Rudolf, R. & Wöginger, G. J., 1993, Proceedings of the First European Symposium on. Springer: Springer Berlin Heidelberg New York, p. 248-259

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

The quickest flow problem

Burkard, R. E., Dlaska, K. & Klinz, B., 1993, In : Mathematical Methods of Operations Research. 37, p. 31-58

Research output: Contribution to journalArticleResearchpeer-review