A Binary Search Algorithm for the Bottleneck Problem of Distinct Representatives

Abstract

Binary Search is considered to be one of the most effective and easy-to-use searching techniques. In the current work, an algorithm for the Bottleneck problem of Distinct Representatives based on binary search is presented. Application of the algorithm to the general 0-1 Minimax problem is straightforward. Computational experience including instances with up to 160 000 variables is reported.