Digitale Medien
Springer
Journal of optimization theory and applications
21 (1977), S. 451-458
ISSN:
1573-2878
Schlagwort(e):
Mathematical programming
;
minimax problems
;
operations research
;
optimization theorems
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Mathematik
Notizen:
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.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF00933089
Permalink
Bibliothek |
Standort |
Signatur |
Band/Heft/Jahr |
Verfügbarkeit |