Izvorni znanstveni članak
A Binary Search Algorithm for the Bottleneck Problem of Distinct Representatives
D. Magos
; Department of Informatics, Athens University of Economics and Business, Athens, Greece
Sažetak
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.
Ključne riječi
Binary Search; Minimax problem; Distinct Representatives; Bottleneck Matching
Hrčak ID:
150499
URI
Datum izdavanja:
30.9.1993.
Posjeta: 426 *