Bettina Klinz - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2024

The bipartite travelling salesman problem: A pyramidally solvable caseVladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger. orl, 55:107130, 2024. [doi]

2023

A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path ProblemsEranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf. ipco 2023: 466-479 [doi]

2021

Linearizable Special Cases of the Quadratic Shortest Path ProblemEranda Çela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf. wg 2021: 245-256 [doi]

2016

The constant objective value property for multidimensional assignment problemsAnte Custic, Bettina Klinz. disopt, 19:23-35, 2016. [doi]

2015

Geometric versions of the three-dimensional assignment problem under general normsAnte Custic, Bettina Klinz, Gerhard J. Woeginger. disopt, 18:38-55, 2015. [doi]

2014

Four-point conditions for the TSP: The complete complexity classificationVladimir G. Deineko, Bettina Klinz, Alexander Tiskin, Gerhard J. Woeginger. disopt, 14:147-159, 2014. [doi]

2013

Uniqueness in quadratic and hyperbolic 0-1 programming problemsVladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger. orl, 41(6):633-635, 2013. [doi]

2011

The Northwest corner rule revisitedBettina Klinz, Gerhard J. Woeginger. DAM, 159(12):1284-1289, 2011. [doi]

2010

A fast parametric assignment algorithm with applications in max-algebraElisabeth Gassner, Bettina Klinz. networks, 55(2):61-77, 2010. [doi]

2009

The complexity of computing the Muirhead-Dalton distanceVladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger. mss, 57(2):282-284, 2009. [doi]

Polygons with inscribed circles and prescribed side lengthsVladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger. appml, 22(5):704-706, 2009. [doi]

The computational complexity of bilevel assignment problemsElisabeth Gassner, Bettina Klinz. 4or, 7(4):379-394, 2009. [doi]

2006

2005

Faster algorithms for computing power indices in weighted voting gamesBettina Klinz, Gerhard J. Woeginger. mss, 49(1):111-116, 2005. [doi]

2004

Minimum-cost dynamic flows: The series-parallel caseBettina Klinz, Gerhard J. Woeginger. networks, 43(3):153-162, 2004. [doi]

2003

Which matrices are immune against the transportation paradox?Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger. DAM, 130(3):495-501, 2003. [doi]

Book ReviewsBettina Klinz. mmor, 56(3):539-540, 2003. [doi]

2001

Bottleneck Capacity Expansion Problems with General Budget ConstraintsRainer E. Burkard, Bettina Klinz, Jianzhong Zhang 0001. rairo, 35(1):1-20, 2001. [doi]

1999

1998

One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcsBettina Klinz, Gerhard J. Woeginger. orl, 22(4-5):119-127, 1998. [doi]

1996

Perspectives of Monge Properties in OptimizationRainer E. Burkard, Bettina Klinz, Rüdiger Rudolf. DAM, 70(2):95-161, 1996. [doi]

One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated ArcsBettina Klinz, Gerhard J. Woeginger. criwg 1997: 254-267

1995

1993

On the Biquadratic Assignment ProblemRainer E. Burkard, Eranda Çela, Bettina Klinz. dimacs 1994: 117-146

The quickest flow problemRainer E. Burkard, Karin Dlaska, Bettina Klinz. mmor, 37(1):31-58, 1993. [doi]

On the Recognition of Permuted Bottleneck Monge MatricesBettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger. esa 1993: 248-259

Sign in or sign up to see more results.

runs on WebDSL