On bottleneck assignment problems under categorization

On bottleneck assignment problems under categorization

0.00 Avg rating0 Votes
Article ID: iaor20043308
Country: United Kingdom
Volume: 31
Issue: 1
Start Page Number: 151
End Page Number: 154
Publication Date: Jan 2004
Journal: Computers and Operations Research
Authors:
Keywords: combinatorial analysis
Abstract:

In this note we consider two types of bottleneck assignment problems under categorization and show that the problems are strongly NP-hard. Further, it is observed that the algorithms developed in Agarwal and Tikekar for these problems are of pseudo-polynomial complexity. Thus contrary to what is reported in Agarwal and Tikekar, these algorithms do not guarantee exact optimality of the solutions produced, unless P = NP.

Reviews

Required fields are marked *. Your email address will not be published.