Bottleneck quadratic assignment problems and the bandwidth problem

Asia-Pacific Journal of Operational Research

Volumn 15, Issue 2, 1998, Pages 169-177

  Kellerer, Hans ^a   Wirsching, Günther ^b  

^a UNIVERSITY OF GRAZ   (Austria)

^b CATHOLIC UNIVERSITY OF EICHSTÄTT INGOLSTADT   (Germany)

Author keywords

Bandwidth problem; Bottleneck quadratic assignment problem

Indexed keywords

EID: 2742604718     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (6)

1. Burkard, R. E. (1974), Quadratische Bottleneckprobleme, Methods of Operations Research 18, 26-41.
2. Chinn, P. Z., J. Chvátalová, A. K. Dewdney and N. E. Gibbs (1982), The bandwidth problem for graphs and matrices - A survey, Journal of Graph Theory 6, 223-254.
3. Chvátal, V. (1970), A remark on a problem of Harary, Czechoslovak Math. J. 20, 109-111.
4. Garey, M. R. and D. S. Johnson (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco.
5. Papadimitriou, Ch. P. (1976), The NP-completeness of the bandwidth minimization problem, Computing 16, 263-270.
6. Steinberg, L. (1961), The backboard wiring problem: A placement algorithm, SIAM Review 3, 37-50.