Assignment and Matching Problems: Solution Methods with FORTRAN-Programs
- PDF / 6,568,640 Bytes
- 154 Pages / 397 x 612 pts Page_size
- 90 Downloads / 212 Views
184
Rai ner E. Bu rkard Ulrich Derigs In cooperation with
T. Bönniger G. Katzakidis
Assignment and Matching Problems: Solution Methods with FORTRAN-Programs
Springer-Verlag Berlin Heidelberg GmbH
Editorial Board H. Albach A. V. Balakrishnan M. Beckmann (Managing Editor) P. Dhrymes J. Green W. Hildenbrand W. Krelle H. P. Künzi (Managing Editor) K. Ritter R. Sato H. Schelbert P. Schönfeld Managing Editors Prof. Dr. M. Beckmann Brown University Providence, RI 02912/USA
Prol. Dr. H. P. Künzi Universität Zürich CH-8090 Zürich/Schweiz
Authors Rainer E. Burkard Mathematisches Institut Universität zu Köln Weyertal86 5000 Köln 41 Federal Republic of Germany Ulrich Derigs Industrieseminar Universität zu Köln Albertus-Magnus-Platz 5000 Köln 41 Federal Republic 01 Germany
AMS Subject Classilications (1980): 65K05, 90BlO, 90C08, 90C09,90C35 ISBN 978-3-540-10267-0 ISBN 978-3-642-51576-7 (eBook) DOI 10.1007/978-3-642-51576-7 Thl$ work 15 subject 10 copynght. All rights are reserved, whether the whole or part of the material is concerned, specifically those of translation, reprinting, re-use 01 illustrations, broadcasting, reproduction by photocopying machine orßimilar mearos. and storage in data banks. Under § 54 01 the German COPYright Law where copies are made for other than private use, a fee is payable 10 the publisher, the amount 01 the fee 10 be determmed by agreement with the publisher.
9 by Sprirger-Verlaq Berhn Heidelberg 1980
Originally published by Springer-Verlag Berlin Heidelberg in 1980. 2141/3140-543210
Assignment and matching problems belang to those cornbinatorial optimization problems which are weIl understood in theory and have many applications in practice. Since a research group qf the Mathematical Institute in Cologne has worked in this field for several years, we feIt that a publication of the developed procedures and algorithms would be useful, both for further research and academic tu': tion as weIl as for applications in practice. This book covers linear assignment problems wi th
SUfi
and bottleneck
objective functions, cardinality matching problems, perfect matching problems with
SUffi
and bottleneck objective functions, the Chinese
postman problem and optimal as weIl as heuristic algorithms for the quadratic assignment problem. Every problem will be first described in short and then a FORTRAN-routine is given for it, which is documented in detail and illustrated by test exarnples. Many helped us through the years to develop efficient codes for the above rnentioned problems. Our special thanks go to T. Bönniger and G. Katzakidis who helped us in compiling the final vers ions and by performing extensive computational tests of the computer programs. The development of these computer codes would not have been possible without the excellent facilities of the Computer Center of the University of Cologne. All programs were thoroughly tested on the CDC CYBER 76 installation of this computer center. Independent test runs were perfarmed on the IBM 4331 installation in the Institut for Ökonometr
Data Loading...
