On bottleneck assignment problems under categorization.

DOI10.1016/S0305-0548(02)00181-8zbMath1088.90037MaRDI QIDQ1422389

Abraham P. Punnen

Publication date: 14 February 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

AlgorithmsComplexityAssignment problemBottleneck problems

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items

Task preference-based bottleneck assignment problem ⋮ The Complexity of Bottleneck Labeled Graph Problems ⋮ The complexity of bottleneck labeled graph problems

Cites Work

• Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
• Bottleneck assignment problems under categorization
• Unnamed Item
• Unnamed Item