Multi-index assignment problem: an asymptotically optimal approach
The multi-index axial assignment problem is considered. It is known to be NP-hard in general case. In the paper a sublinear approximation algorithm is proposed. Performance and probability-of-failure bounds of the algorithm are established, and conditions of asymptotical optimality of the algorithm...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The multi-index axial assignment problem is considered. It is known to be NP-hard in general case. In the paper a sublinear approximation algorithm is proposed. Performance and probability-of-failure bounds of the algorithm are established, and conditions of asymptotical optimality of the algorithm described are proved in the case of matrices with random elements distributed independently with a common distribution function which is minorised by the uniform distribution. |
---|---|
DOI: | 10.1109/ETFA.2001.997763 |