Geometric versions of the three-dimensional assignment problem under general norms

Burkard, 2009 Karp, 1972, Reducibility among combinatorial problems, 85 Garey, 1979 Spieksma, 1996, Geometric three-dimensional assignment problems, European J. Oper. Res., 91, 611, 10.1016/0377-2217(95)00003-8 Crama, 1992, Approximation algorithms for three-dimensional assignment problems with triangle inequalities, European J. Oper. Res., 60, 273, 10.1016/0377-2217(92)90078-N Burkard, 1996, Three-dimensional axial assignment problems with decomposable cost coefficients, Discrete Appl. Math., 65, 123, 10.1016/0166-218X(95)00031-L Barvinok, 2003, The geometric maximum travelling salesman problem, J. ACM, 50, 641, 10.1145/876638.876640 Pferschy, 1994, Some geometric clustering problems, Nordic J. Comput., 1, 246 Lenstra, 1983, Integer programming with a fixed number of variables, Math. Oper. Res., 8, 538, 10.1287/moor.8.4.538 Barvinok, 1996, Two algorithmic results for the traveling salesman problem, Math. Oper. Res., 21, 65, 10.1287/moor.21.1.65 van Rooij, 2013, Partition into triangles on bounded degree graphs, Theory Comput. Syst., 52, 687, 10.1007/s00224-012-9412-5 Dyer, 1986, Planar 3DM is NP-complete, J. Algorithms, 7, 174, 10.1016/0196-6774(86)90002-7 W. Schnyder, Embedding planar graphs on the grid, in: Proceedings of the 1st Annual ACM–SIAM Symposium on Discrete Algorithms, SODA’1990, 1990, pp. 138–147.