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

DOI10.1016/j.disopt.2015.07.002zbMath1387.90212arXiv1409.0845OpenAlexW1739375828MaRDI QIDQ1751127

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

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.0845

zbMATH Keywords

computational complexitycombinatorial optimizationpolyhedral norm3-dimensional assignment problem3-dimensional matching problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (6)

Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions ⋮ Induced star partition of graphs ⋮ A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem ⋮ Coordinated lab-clinics: a tactical assignment problem in healthcare ⋮ Dynamic discrete tomography ⋮ Two-machine open shop problem with agreement graph

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for three-dimensional assignment problems with triangle inequalities
• Geometric three-dimensional assignment problems
• Three-dimensional axial assignment problems with decomposable cost coefficients
• Partition into triangles on bounded degree graphs
• Integer Programming with a Fixed Number of Variables
• The geometric maximum traveling salesman problem
• Assignment Problems
• Planar 3DM is NP-complete
• Two Algorithmic Results for the Traveling Salesman Problem
• Reducibility among Combinatorial Problems

This page was built for publication: Geometric versions of the three-dimensional assignment problem under general norms