The approximability of three-dimensional assignment problems with bottleneck objective

DOI10.1007/s11590-009-0152-7zbMath1180.90167OpenAlexW2153180732MaRDI QIDQ845547

Frits C. R. Spieksma, Gerhard J. Woeginger, Sergey Polyakovskiy, Dries R. Goossens

Publication date: 29 January 2010

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

Full work available at URL: https://doi.org/10.1007/s11590-009-0152-7

zbMATH Keywords

computational complexityapproximationbottleneck problemefficient algorithmmultidimensional assignment

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (2)

Between a rock and a hard place: the two-to-one assignment problem ⋮ Bounding stochastic dependence, joint mixability of matrices, and multidimensional bottleneck assignment problems

Cites Work

• Approximation algorithms for three-dimensional assignment problems with triangle inequalities
• Clustering to minimize the maximum intercluster distance
• Geometric three-dimensional assignment problems
• Approximations for a bottleneck Steiner tree problem
• Approximation algorithms for multi-index transportation problems with decomposable costs
• Specially Structured Precedence Constraints in Three-Dimensional Bottleneck Assignment Problems
• The three dimensional bottleneck assignment problem and its variants
• Planar 3DM is NP-complete
• Unnamed Item

This page was built for publication: The approximability of three-dimensional assignment problems with bottleneck objective