A new efficiently solvable special case of the three-dimensional axial bottleneck assignment problem

DOI10.1007/3-540-61576-8_80MaRDI QIDQ6567677zbMATH OpenFDO

Authors Bettina Klinz, Gerhard J. Woeginger

Publication date 5 July 2024

Full work available at URL https://doi.org/10.1007/3-540-61576-8_80

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• The three dimensional bottleneck assignment problem and its variants
• Three-dimensional axial assignment problems with decomposable cost coefficients
• The approximability of three-dimensional assignment problems with bottleneck objective
• Efficient algorithms for three‐dimensional axial and planar random assignment problems
• scientific article; zbMATH DE number 2097292

Cites work

• A Monge property for the \(d\)-dimensional transportation problem
• Facets of the three-index assignment polytope
• scientific article; zbMATH DE number 151870 (Why is no real title available?)
• scientific article; zbMATH DE number 3240945 (Why is no real title available?)
• Letter to the Editor—The Multidimensional Assignment Problem
• Reducibility among combinatorial problems
• Strong linear independence in bottleneck algebra
• Trapezoidal matrices and the bottleneck assignment problem

This page was built for publication: A new efficiently solvable special case of the three-dimensional axial bottleneck assignment problem

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