3 citations · 7 across the 4 of their papers we have counts for
4 papers
On conjectures and problems of Ruzsa concerning difference graphs of S-units
Ante Custic, Lajos Hajdu, Dijana Kreso +1
Given a finite nonempty set of primes S, we build a graph with vertex set by connecting x and y if the prime divisors of both the numerator and denominat…
Geometric versions of the 3-dimensional assignment problem under general norms
Ante Ćustić, Bettina Klinz, Gerhard J. Woeginger
We discuss the computational complexity of special cases of the 3-dimensional (axial) assignment problem where the elements are points in a Cartesian space and where the cost coeff…
Planar 3-dimensional assignment problems with Monge-like cost arrays
Ante Ćustić, Bettina Klinz, Gerhard J. Woeginger
Given an cost array we consider the problem -P3AP which consists in finding pairwise disjoint permutations of s…
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…