Solution methods and computational investigations for the linear bottleneck assignment problem

Computing (Vienna/New York)

Volumn 59, Issue 3, 1997, Pages 237-258

  Pferschy, U ^a  

^a UNIVERSITY OF GRAZ   (Austria)

Author keywords

Bottleneck assignment problem; Computational investigation; Sparse graph

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; NUMERICAL ANALYSIS;

LINEAR BOTTLENECK ASSIGNMENT PROBLEM (LBAP); SPARSE GRAPHS;

GRAPH THEORY;

EID: 0031378910     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02684443     Document Type: Article

References (18)

1. 1 5√m/log n). Inf. Proc. Lett. 37, 237-240 (1991).
2. Bollobás, B., Thomason, A.: Random graphs of small order. Random Graphs, '83. Ann. Disc. Math. 28, 47-97 (1985).
3. Burkard, R. E., Derigs, U.: Assignment and matching problems: solution methods with Fortran-programs. Springer Lecture Notes Econ. Math. Sys. 184 (1980).
4. Carpaneto, G., Toth, P.: Algorithm for the solution of the bottleneck assignment problem. Computing 27, 179-187 (1981).
5. Carpaneto, G., Toth, P.: Algorithm for the solution of the assignment problem for sparse matrices. Computing 31, 83-94 (1983).
6. Derigs, U.: Alternate strategies for solving bottleneck assignment problems - analysis and computational results. Computing 33, 95-106 (1984).
7. Derigs, U.: The shortest augmenting path method for solving assignment problems. Ann. Oper. Res. 4, 57-102 (1985).
8. Derigs, U., Metz, A.: An efficient labeling technique for solving sparse assignment problems. Computing 36, 301-311 (1986).
9. Derigs, U., Metz, A.: An in-core/out-of-core method for solving large scale assignment problems. Z. Oper. Res. 30, 181-195 (1986).
10. Derigs, U., Zimmermann, U.: An augmenting path method for solving linear bottleneck assignment problems. Computing 19, 285-295 (1978).
11. Gabow, H. N., Tarjan, R. E.: Algorithms for two bottleneck optimization problems. J. Algorithms 9, 411-417 (1988).
12. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput 2, 225-231 (1973).
13. Palmer, E.M.: Graphical Evolution. New York: J. Wiley 1985.
14. Pferschy, U.: The random linear bottleneck assignment problem. In: Proc. of the 4. IPCO Conference. (Balas, E., Clausen, J., eds.). Springer Lecture Notes in Computer Science 920, 145-156 (1995) and RAIRO 30, 127-142 (1996).
15. Pferschy, U.: The random linear bottleneck assignment problem. In: Proc. of the 4. IPCO Conference. (Balas, E., Clausen, J., eds.). Springer Lecture Notes in Computer Science 920, 145-156 (1995) and RAIRO 30, 127-142 (1996).
16. Pferschy, U.: On three topics in combinatorial optimization, Chapter 4. PhD-thesis, Report 300, Institute of Mathematics, University of Technology Graz 1995.
17. Punnen, A. P., Nair, K. P. K.: Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem. Discr. Appl. Math. 55, 91-93 (1994).
18. Taillard, E. D., Comparison of iterative searches for the quadratic assignment problem. Centre de recherche sur les transports, CRT-989. Université de Montréal, 1994.