3 citations · 11 across the 8 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2014★ 3 cited
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…
math.CO2013★ 2 cited
Uniqueness in quadratic and hyperbolic 0-1 programming problems
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
We analyze the question of deciding whether a quadratic or a hyperbolic 0-1 programming instance has a unique optimal solution. Both uniqueness questions are known to be NP-hard, b…