On the bottleneck assignment problem |
| |
Authors: | A Ravindran V Ramaswami |
| |
Institution: | (1) Department of Industrial Engineering, Purdue University, West Lafayette, Indiana;(2) Department of Statistics, Purdue University, West Lafayette, Indiana |
| |
Abstract: | In this paper, a new approach for solving the bottleneck assignment problem is presented. The problem is treated as a special class of permutation problems which we call max-min permutation problems. By defining a suitable neighborhood system in the space of permutations and designating certain permutations as critical solutions, it is shown that any critical solution yields a global optimum. This theorem is then used as a basis to develop a general method to solve max-min permutation problems.This work was carried out by the junior author while holding a Purdue University Fellowship. |
| |
Keywords: | Mathematical programming minimax problems operations research optimization theorems |
本文献已被 SpringerLink 等数据库收录! |
|