We investigate two geometric special cases of the three-dimensional assignment problem: Given are three sets B, R and G (blue, red and green) each containing n grid points in the Euclidean plane. We want to find a partition of B R G into n three0colored triangles such that (a) the total circumference of all triangles or (b) the total area of all triangles becomes minimum. Both versions of the problem are proved to be NP-hard
AbstractThe k-dimensional assignment problem with decomposable costs is formulated as follows. Given...
Geometric constraint solving has applications in a wide variety of fields, such as mechanical engine...
The (axial) three index assignment problem, also known as the threedimensional matching problem, is ...
We investigate two geometric special cases of the three-dimensional assignment problem: Given are th...
peer reviewedThe three-dimensional assignment problem (3DA) is defined as follows. Given are three d...
We discuss the computational complexity of special cases of the three-dimensional (axial) assignment...
We discuss the computational complexity of special cases of the 3-dimensional (axial) assignment pro...
AbstractGiven 3n points in the unit square, n ⩾ 2, they determine n triangles whose vertices exhaust...
It presents a plane geometry problem involving three squares. Your student must calculate the maxima...
. Three-dimensional geometric constraint solving is a rapidly developing field, with applications in...
The assignment problem of matching the elements of two sets at some cost or to some benefit is well ...
We discuss two special cases of the three-dimensional bottleneck assignment problem where a certain ...
AbstractThe study of extremal problems on triangle areas was initiated in a series of papers by Erdő...
AbstractLet KN be the complete graph on N vertices, and assume that each edge is assigned precisly o...
. Branch and bound approaches for axial three-dimensional assignment problems are considered. Severa...
AbstractThe k-dimensional assignment problem with decomposable costs is formulated as follows. Given...
Geometric constraint solving has applications in a wide variety of fields, such as mechanical engine...
The (axial) three index assignment problem, also known as the threedimensional matching problem, is ...
We investigate two geometric special cases of the three-dimensional assignment problem: Given are th...
peer reviewedThe three-dimensional assignment problem (3DA) is defined as follows. Given are three d...
We discuss the computational complexity of special cases of the three-dimensional (axial) assignment...
We discuss the computational complexity of special cases of the 3-dimensional (axial) assignment pro...
AbstractGiven 3n points in the unit square, n ⩾ 2, they determine n triangles whose vertices exhaust...
It presents a plane geometry problem involving three squares. Your student must calculate the maxima...
. Three-dimensional geometric constraint solving is a rapidly developing field, with applications in...
The assignment problem of matching the elements of two sets at some cost or to some benefit is well ...
We discuss two special cases of the three-dimensional bottleneck assignment problem where a certain ...
AbstractThe study of extremal problems on triangle areas was initiated in a series of papers by Erdő...
AbstractLet KN be the complete graph on N vertices, and assume that each edge is assigned precisly o...
. Branch and bound approaches for axial three-dimensional assignment problems are considered. Severa...
AbstractThe k-dimensional assignment problem with decomposable costs is formulated as follows. Given...
Geometric constraint solving has applications in a wide variety of fields, such as mechanical engine...
The (axial) three index assignment problem, also known as the threedimensional matching problem, is ...
DOI
Add to ORKG