The three-dimensional bottleneck assignment problem with capacity constraints

DOI10.1016/0377-2217(94)90253-4MaRDI QIDQ1328651zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• The three dimensional bottleneck assignment problem and its variants
• Specially Structured Precedence Constraints in Three-Dimensional Bottleneck Assignment Problems
• Multiple bottleneck assignment problem
• The Multicommodity Multilevel Bottleneck Assignment Problem
• The approximability of three-dimensional assignment problems with bottleneck objective

Cites work

• scientific article; zbMATH DE number 4131951 (Why is no real title available?)
• scientific article; zbMATH DE number 3617900 (Why is no real title available?)
• Letter to the Editor—The Multidimensional Assignment Problem
• On the bottleneck assignment problem
• Specially Structured Precedence Constraints in Three-Dimensional Bottleneck Assignment Problems
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
• The three dimensional bottleneck assignment problem and its variants

Cited in

(5)

• Assignment problems: a golden anniversary survey
• Nonnegative tensors revisited: plane stochastic tensors
• The stochastic bottleneck linear programming problem
• Specially Structured Precedence Constraints in Three-Dimensional Bottleneck Assignment Problems
• The three dimensional bottleneck assignment problem and its variants

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

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