Ante Ćustić

most citedThe constant objective value property for combinatorial optimization problems

3 citations · 7 across the 4 of their papers we have counts for

collaborators

Showing math.OCShow all

2 papers · 1 filter

math.OC2014★ 2 cited

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…

math.OC2014★ 2 cited

Planar 3-dimensional assignment problems with Monge-like cost arrays

Ante Ćustić, Bettina Klinz, Gerhard J. Woeginger

Given an $n \times n \times p$ cost array $C$ we consider the problem $p$ -P3AP which consists in finding $p$ pairwise disjoint permutations $φ_{1}, φ_{2}, \dots, φ_{p}$ of ${1, \dots, n}$ s…