The three dimensional bottleneck assignment problem and its variants

DOI10.1080/02331938508843013zbMath0572.90069OpenAlexW2000506209MaRDI QIDQ3690581

Rita Malhotra, H. L. Bhatia, Munish C. Puri

Publication date: 1985

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938508843013

zbMATH Keywords

optimal solutionbi-linear programmingthree-dimensional bottleneck assignment

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Boolean programming (90C09)

Related Items (8)

The three-dimensional bottleneck assignment problem with capacity constraints ⋮ The approximability of three-dimensional assignment problems with bottleneck objective ⋮ Assignment problems: a golden anniversary survey ⋮ Time-cost tradeoff in a three-dimensional assignment problem ⋮ Nonnegative tensors revisited: plane stochastic tensors ⋮ Integer programming models for the multidimensional assignment problem with star costs ⋮ Three dimensional bounded transportation problem ⋮ A variant of time minimizing assignment problem

Cites Work

• On the bottleneck assignment problem
• A bilinear programming formulation of the 3-dimensional assignment problem
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem

This page was built for publication: The three dimensional bottleneck assignment problem and its variants