The approximability of three-dimensional assignment problems with bottleneck objective

DOI10.1007/S11590-009-0152-7zbMATH Open1180.90167OpenAlexW2153180732MaRDI QIDQ845547FDOQ845547

Authors: S. Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger, 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

Recommendations

• Approximation algorithms for three-dimensional assignment problems with triangle inequalities
• Specially Structured Precedence Constraints in Three-Dimensional Bottleneck Assignment Problems
• The three dimensional bottleneck assignment problem and its variants
• Approximating the multi-level bottleneck assignment problem
• Geometric versions of the three-dimensional assignment problem under general norms

zbMATH Keywords

computational complexityapproximationefficient algorithmbottleneck problemmultidimensional assignment

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

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

Cited In (14)

• Bounding stochastic dependence, joint mixability of matrices, and multidimensional bottleneck assignment problems
• A new efficiently solvable special case of the three-dimensional axial bottleneck assignment problem
• On bottleneck assignment problems under categorization.
• Between a rock and a hard place: the two-to-one assignment problem
• Optimizing three-dimensional constrained ordered weighted averaging aggregation problem with bounded variables
• The three-dimensional bottleneck assignment problem with capacity constraints
• Between a rock and a hard place: the two-to-one assignment problem
• Approximating the multi-level bottleneck assignment problem
• On Asymptotically Optimal Algorithm for One Modification of Planar 3-dimensional Assignment Problem
• The three dimensional bottleneck assignment problem and its variants
• Geometric versions of the three-dimensional assignment problem under general norms
• Approximation algorithms for three-dimensional assignment problems with triangle inequalities
• Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem
• On computing a center persistence diagram

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845547)