Lecture Notes in Economics and Mathematical Systems (Vol. 1-15: Lecture Notes in Operations Research and Mathematical Economics, Vol. 16-59: Lecture Notes in Operations Research and Mathematical Systems) Vol. 1: H. BOhlmann, H. Loellel, E. Nievergelt, EinfUhrung in die Vol. 30: H. Noltemeier, Sensltivitatsanalyse bei diskreten Iinearen Theorle und Praxis der Entscheidung bei Unsicherheit. 2. Auflage, Optimierungsproblemen. VI, 102 Seiten. 1970. IV, 125 Seiten. 1969. Vol. 31: M. KOhlmeyer, Die nichtzentrale t-Verteilung. II, 106 Sei Vol. 2: U. N. Bhat, A Study of th" Queueing Systems M/G/l and ten. 1970. GI/MI1. VIII, 78 pages. 1968. Vol. 32: F. Bartholomes und G. Hotz, Homomorphismen und Re Vol. 3: A. Strauss, An Introduction to Optimal Control Theory. duktionen linearer Sprachen. XII, 143 Seiten. 1970. DM 18,- Out of print Vol. 33: K. Hinderer, Foundations of Non-stationary DynamiC Pro Vol. 4: Branch and Bound: EI ne EinfUhrung. 2., geanderte Auflage. gramming with Discrete Time Parameter. VI, 160 pages. 1970. Herausgegeben von F. Weinberg. VII, 174 Selten. 1973. Vol. 34: H. SlOrmer, Semi-Markoll-Prozesse mit endlich vielen Vol. 5: L. P. Hyvarinen, Information Theory for Systems Engineers. Zustanden. Theorie und Anwendungen. VII, 128 Seiten. 1970. VII, 205 pages. 1968. Vol. 35: F. Ferschl, Markovketten. VI, 168 Seiten. 1970. Vol. 6: H. P. KOnzl, O. MOiler, E. Nievergelt, EinfUhrungskursus in die dynamische Programmlerung. IV, 103 Selten. 1968. Vol. 36: M. J. P. Magill, On a General Economic Theory of Motion. VI, 95 pages. 1970. Vol. 7: W. Popp, EinfUhrung in die Theorie der Lagerhaltung. VI, 173 Seiten. 1968. Vol. 37: H. MOlier-Merbach, On Round-Oil Errors in Linear Pro gramming. V, 48 pages. 1970. Vol. 8: J. Teghem, J. Loris-Teghem, J. P. Lambotte, Modeles d'Attente M/GI1 et GIIMI1 a Arrivees et Services en Groupes. III, Vol. 38: Statistische Methoden I. Herausgegeben von E. Walter. 53 pages. 1969. VIII, 338 Seiten. 1970. Vol. 9: E. Schultze, EinfUhrung in die mathematischen Grundlagen Vol. 39: Statistische Methoden II. Herausgegeben von E. Walter. der Informationstheorie. VI, 116 Seiten. 1969. IV, 157 Seiten. 1970. Vol. 10: D. Hochstadter, Stochastische Lagerhaltungsmodelle. VI, Vol. 40: H. Drygas, The Coordinate-Free Approach to Gauss 269 Seiten. 1969. Markov EstimatIOn. VIII, 113 pages. 1970. Vol. 11/12: Mathematical Systems Theory and Economics. Edited Vol. 41 : U. Ueing, Zwei Losungsmethoden fUr nlchtkonvexe Pro by H. W. Kuhn and G. P. Szego. VIII, III, 486 pages. 1969. grammierungsprobleme. IV, 92 Seiten. 1971. Vol. 13: Heuristische Planungsmethoden. Herausgegeben von Vol. 42: A. V. Balakrishnan, Introduction to Optimization Theory In F. Weinberg und C. A. Zehnder. II, 93 Seiten. 1969. a Hilbert Space. IV, 153 pages. 1971. Vol. 14: Computing Methods in Optimization Problems. V, 191 pages. Vol. 43: J. A. Morales, Bayesian Full Information Structural Analy 1969. sis. VI, 154 pages. 1971. Vol. 15: Economic Models, Estimation and Risk Programming: Vol. 44:· G. Feichtinger, Stochastlsche Madelle demographischer Essays in Honor of Gerhard Tintner. Edited by K. A. Fox, G. V. L. Prozesse. IX, 404 Seiten. 1971. Narasimham and J. K. Sengupta. VIII, 461 pages. 1969. Vol. 45: K. Wendler, Hauptaustauschschrltte (Principal Pivoting). Vol. 16: H. P. KOnzi und W. Oettli, Nichtlineare Optimierung: 11,64 Seiten. 1971. Neuere Verfahren, Bibliographie. IV, 180 Seiten. 1969. Vol. 46: C. Boucher, Le<;ons sur la theorie des automates ma Vol. 17: H. Bauer und K. Neumann, Berechnung optimaler Steue thematiques. VIII, 193 pages. 1971. rungen, Maximumprinzip und dynamische Optimierung. VIII, 188 Vol. 47: H. A. Nour Eldin, Optimierung Ilnearer Regelsysteme Seiten. 1969. mit quadrati scher Zielfunktion. VIII, 163 Seiten. 1971. Vol. 18: M. WollI, Optimale Instandhaltungspolitiken in einfachen Systemen. V, 143 Selten. 1970. Vol. 48: M. Constam, FORTRAN fUr Anfanger. 2. Auflage. VI, 148 Seiten. 1973. Vol. 19: L. P. Hyvarlnen, Mathematical Modeling for Industrial Pro Vol. 49: Ch. SchneeweiB, Regelungstechnische stochastische cesses. VI, 122 pages. 1970. Optimierungsverfahren. XI, 254 Seiten. 1971. Vol. 20: G. Uebe, Optimale Fahrplane. IX, 161 Seiten. 1970. Vol. 50: Unternehmensforschung Heute - Oberslchtsvortrage der Vol. 21: Th. M. Liebling, Graphentheorie in Planungs-und Touren ZOricher Tagung von SVOR und DGU, September 1970. Heraus problemen am Beispiel des stadtlschen StraBendlenstes. IX, gegeben von M. Beckmann. IV, 133 Seiten. 1971. 118 Seiten. 1970. Vol. 51: Digitale Simulation. Herausgegeben von K. Bauknecht Vol. 22: W. Eichhorn, Theorie der homogenen Produktionsfunk und W. Nef. IV, 207 Seiten. 1971. lion. VIII, 119 Seiten. 1970. Vol. 52: Invariant Imbedding. Proceedings 1970. Edited by R. E. Vol. 23: A. Ghosal, Some Aspects of Queueing and Storage Bellman and E. D. Denman. IV, 148 pages. 1971. Systems. IV, 93 pages. 1970. Vol. 24: G. Feichtinger, Lernprozesse in stochastischen Automaten. Vol. 53: J. RosenmOller, Kooperative Spiele und Markte. III, 152 V, 66 Seiten. 1970. Seiten. 1971. Vol. 25: R. Henn und O. Opitz, Konsum-und Produktionstheorie I. Vol. 54: C. C. von Weizsacker, Steady State Capital Theory. III, 11,124 Seiten. 1970. 102 pages. 1971. Vol. 26: D. Hochstadter und G. Uebe, Okonometrische Methoden. Vol. 55: P. A. V. B. Swamy, Statistical Inference in Random Coef XII, 250 Seiten. 1970. ficient Regression Models. VIII, 209 pages. 1971. Vol. 27: I. H. Mufti, Computational Methods in Optimal Control Vol. 56: Mohamed A. EI-Hodiri, Constrained Extrema. Introduction Problems. IV, 45 pages. 1970. to the Differentiable Case with Economic Applications. III, 130 Vol. 28: Theoretical Approaches to Non-Numerical Problem Sol pages. 1971. ving. Edited by R. B. Banerji and M. D. Mesarovic. VI, 466 pages. Vol. 57: E. Freund, Zeitvariable MehrgroBensysteme. VIII,160 Sei 1970. ten. 1971. Vol. 29: S. E. Elmaghraby, Some Network Models in Management Vol. 58: P. B. Hagelschuer, Theorie der linearen Dekomposition. Science. III, 176 pages. 1970. VII, 191 Seiten. 1971. continuation on page 321 Lectu re Notes in Economics and Mathematical Systems Managing Editors: M. Beckmann and H. P. KUnzi Operations Research 160 Integer Programming and Related Areas A Classified Bibliography 1976-1978 Compiled at the Institut fUr Okonometrie und Operations Research, University of Bonn Edited by Dirk Hausmann --------------------------------------- .~~. Springer-Verlag Berlin Heidelberg New York 1978 Editorial Board H. Albach' A. V. Balakrishnan' M. Beckmann (Managing Editor) P. Dhrymes . J. Green . W. Hildenbrand' W. Krelle H. P. KUnzi (Managing Editor) . K. Ritter' R. Sato . H. Schelbert P. Schonfeld Managing Editors Prof. Dr. M. Beckmann Prof. Dr. H. P. Kunzi Brown University UniversiUit Zurich Providence, RI 02912/USA CH-8090 ZUrich Editor Dirk Hausmann Institut fUr Okonometrie und Operations Research Universitat Bonn NassestraBe 2 0-5300 Bonn 1 AMS Subject Classifications (1970): 00A15, 90C10 ISBN 978-3-540-08939-1 ISBN 978-3-642-46383-9 (eBook) DOI 10.1007/978-3-642-42383-9 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically those of translation, re printing, re-use of illustrations, broadcasting, reproduction by photocopying machine or similar means, and storage in data banks. Under § 54 of the German Copyright Law where copies are made for other t~an private use, a fee is payable to the publisher, the amount of the fee to be determined by agreement with the publisher. © by Springer-Verlag Berlin Heidelberg 1978 2142/3140·543210 TABLE OF CONTENTS Preface V Introductory Remarks VII Subject List IX PJ.I.RT 1 Alphabetical Bibliography PART 2 Subject Classification 109 PART 3 List of Authors 281 PRE F ACE Integer Programming is one of the most important areas in optimization theory. Since its origin in the fifties, it has made such rapid progress that after only a few decades its literature is now too vast to keep track of. Therefore in 1970 I initiated the collection and classification of all available publications on integer programming scattered throughout the literature. This work was performed duri~g the years 1970-75 in the Institut fur Okonometrie und Operations Research, Bonn, mainly by Claus Kastning, and culminated in the classified bibliography entitled "Integer Programming and Related Areas", Lecture Notes in Economics and Mathematical Systems, Vol. 128. After the tragic death of Claus Kastning, his work was continued by Dirk Hausmann, who collected all articles published after 1975 as well as earlier publications that were missed in the first volume. Due to the ever increasing research in integer programming, it seems appropriate to publish the second volume of the bibliography already after three years. The deadline set was March of 1978, until then 3162 new publications of 2742 authors were compiled and classified by 6404 descriptor entries. Together the two volumes of the bibliography cover 7866 titles. The form of the second volume is nearly identical to that of the first volume. However some changes were made in the subject list in order to take into account new directions of research that have developed in the meantime. Finally I would like to thank Reinhardt Euler, who did the final work for this new volume and who is now preparing the third volume. Thanks are also due to the programmers of the institute for their extensive efforts in programming and punching. Bonn, June 1978 Bernhard Korte INTRODUCTORY REMARKS This second volume supplements the first volume " Integer Programming and Related Areas " , Lecture Notes in Economics and Mathematical Systems No. 128 , of the bibliography on integer programming. It con tains the publications appearing in the period from 1976 to the beginning of 1978, as well as several previous publications, which were not included in the first volume. The following topics are covered : theory and methods of general integer programming combinatorial and graph theoretical optimization problems applications of integer programming A detailed list of the subjects included is given at the end of the introduction. Textbooks and proceedings volumes have been included only if they deal principally with integer programming. PART 1: This part comprises the alphabetical bibliography which lists all publications alphabetically by the first author and chronologically for each author, and includes the full biblio graphical data plus a reference code, which reflects the author's name and the year of publication. The purpose of the code is to enable the user to identify publications referred to in Part 2 and Part 3. Bibliographical data are given as follows a) Textbook : ref. code author(s) title. Where published: publisher(s), no.of pages. (year). b) Article in a journal ref. code author(s) title. Journal, vol.no., pages. (year). VIII c) Article in a proceedings volume ref. code author(s) title. IN: Editor(s) : title of the proceedings volume, pages. Where published: publisher(s). (year) • d) Paper : ref. code author(s) title. classification of the paper. Where published: publisher, no. of pages. (year). Publications in English, French or German appear under their original title. Titles of publications written in other languages have been translated into English and the original language is indicated in brackets. PART 2 : In this part the publications have been classified according to 57 subjects; within each subject the ordering is again alphabetical by the first author. The subject list contains 57 headings and for 73 further topics the corresponding subject headings have been indicated. The publications appear under all relevant headings; the references are restricted to name(s) of author(s), title and reference code, with which the full bibliographical data can be retrieved in Part 1. PART 3: The purpose of this part is to enable the user to locate publications for which only a coauthor's name is known. It consists of an alphabetical catalogue of all the authors ap pearing in Part 1, and lists for each author the reference codes of all his publications. SUBJECT LIST ACYCLIC SUBGRAPH PROBLEM , ORDERINGS , RELATIONS ADJACENCY ON INTEGER POLYHEDRA aggregation + diophantine systems and aggregation ALGEBRAICAL METHODS AND ALGEBRAIZATION OF PROBLEMS algorithm ( codes ) + computer codes allocation + location and allocation anti blocking + duality in integer programming APPLICATIONS OF INTEGER PROGRAMMING approximative algorithms + heuristics assembly line balancing + scheduling ASSIGNMENT backtracking methods + branch and bound balanced matrices unimodular, balanced, and + perfect matrices Benders' method + decomposition ; mixed integer programming bibliographies + surveys, bibliographies bivalent programming + zero-one programming blocking + duality in integer programming BOOLEAN METHODS BOTTLENECK PROBLEMS BRANCH AND BOUND branchings + graph theoretic optimization problems chance constrained methods + stochastic integer programming x Chinese postman routing clustering partitioning; combinatorial optimization problems COLORING PROBLEMS COMBINATORIAL ALGORITHMS (UNLESS SPECIFIED IN PARTICULAR) COMBINATORIAL OPTIMIZATION PROBLEMS (UNLESS SPECIFIED IN PARTICULAR) COMPLEXITY (PROBABLLISTIC ANALYSIS) COMPLEXITY (WORST CASE ANALYSIS) COMPUTATIONAL RESULTS COMPUTER CODES cones group theoretic approach convex integer programming nonlinear integer programming corner polyhedra group theoretic approach integer polyhedra COVERING CPlJI network flows crew scheduling scheduling ; applications of integer programming CUTTING PLANES cutting stock combinatorial optimization problems cyclic groups group theoretic approach DECOMPOSITION DIOPHANTINE SYSTEMS AND AGGREGATION DISJUNCTIVE PROGRAMMING DUALITY IN INTEGER PROGRAMMING DYNAMIC PROGRAMMING XI edge covering + covering enumeration methods + branch and bound FACETS OF INTEGER POLYHEDRA FIXED CHARGE flow shop scheduling + scheduling flows in networks + network flows fractional integer programming + nonlinear integer programming generalized networks + network flows graph isomorphism graph theoretic results related + to integer programming GRAPH- THEORETIC OPTIMIZATION PROBLEMS (UNLESS SPECIFIED IN PARTICULAR) GRAPH THEORETIC RESULTS RELATED TO INTEGER PROGRAMMING GROUP THEORETIC APPROACH Hamiltonian cycle graph theore'tic results related + to integer programming ~ travelling salesman Hermite normal form diophantine systems and aggregation + group theoretic approach HEURISTICS (PROBABILISTIC ANALYSIS) HEURISTICS (WITHOUT ANALYSIS) HEURISTICS (WORST CASE ANALYSIS) Hitchcock Koopmans Problem + transportation Hungarian method + assignment implicit enumeration + branch and bound independence systems + matroids and independence systems integer linear programming over cones (ILPC) + group theoretic approach INTEGER POLYHEDRA (UNLESS SPECIFIED IN PARTICULAR) INTEGER PROGRAMMING (GENERAL) job shop scheduling + scheduling