The three-dimensional bottleneck assignment problem with capacity constraints

DOI10.1016/0377-2217(94)90253-4zbMath0806.90090OpenAlexW1987420052MaRDI QIDQ1328651

V. Pereyra

Publication date: 26 July 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90253-4

zbMATH Keywords

inherent capacity constraintsthree-dimensional bottleneck assignment problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Boolean programming (90C09)

Related Items (3)

Assignment problems: a golden anniversary survey ⋮ Nonnegative tensors revisited: plane stochastic tensors ⋮ The stochastic bottleneck linear programming problem

Cites Work

• On the bottleneck assignment problem
• Specially Structured Precedence Constraints in Three-Dimensional Bottleneck Assignment Problems
• The three dimensional bottleneck assignment problem and its variants
• Letter to the Editor—The Multidimensional Assignment Problem
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: The three-dimensional bottleneck assignment problem with capacity constraints