Lecture Notes in Economics and Mathematical Systems

Transcription

1 Lecture Notes in Economics and Mathematical Systems Managing Editors: M. Beckmann and H. P. Kunzi Operations Research 128 Integer Programming and Related Areas A Classified Bibliography Compiled at the lnstitut fur Okonometrie und Operations Research, University of Bonn Edited by C. Kastning Springer-Verlag Berlin Heidelberg GmbH 1976

2 Editorial Board H. Albach. A. V. Balakrishnan. M. Beckmann (Managing Editor) P. Dhrymes. J. Green. W. Hildenbrand. W. Krelle H. P. KOnzi (Managing Editor). K. Ritter. R. Sato. H. Schelbert P. Schonfeld Managing Editors Prof. Dr. M. Beckmann Brown University Providence, RI 02912/USA Prof. Dr. H. P. KOnzi U n i v e rzurich s i t t 8090 Zurich/Schweiz Editor Claus Kastning Institut fur Okonometrie und Operations Research U n i v e rbonn s i t t NassestraBe Bonn l/brd Llbra:ry of Congress Cataloglng in Publication Data Bonn. U n i v e r s Institut i ~ t. fur dkonometrie und Operations Research. Integer and re1ated areas. (Lecture notes in economics and mathematica1 systems ; 128 : _Operations research) Bib1iography: p. Inc1udes index. 1. Integer --Indexes. I. Kastning, C1aus, II. Tit1e. III. Series: Lecture notes in economics and mathematica1 systems 128. z6654.p75b [157.7] '7 AMS Subject Classifications (1970): OOA 15, 90ClO ISBN ISBN (ebook) DOI / This w.ork is subject to copyright. AII rights are reserved, whether the whole or part of the material is concerned, specifically those of translation, reprinting, 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 than 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 1976 Originally published by Springer-Verlag Berlin Heidelberg New York in 1976 Softcover reprint of the hardcover 1 st edition 1976

3 Table of Contents Preface v Introductory Remarks VII Subject List I X PART 1 Alphabetical Bibliography PART 2 Subject Classification 153 PART 3 List of Authors 455

4 Preface Integer P r o g r ais w ~ one i nof g the most fascinating and difficult areas in the field of Mathematical Optimization. Due to this fact notable research contributions to Integer Programming have been made in very different branches of mathematics and its applications. Since these publications are scattered over many journals, proceedings volumes, monographs, and working papers, a comprehensive bibliography of all these sources is a helpful tool even for specialists in this field. I initiated this compilation of literature in 1970 at the Institut fur ~ k o n o mund e t Operations r i e Research, University of Bonn. Since then many collaborators have contributed to and worked on it. Among them Dipl.-Math. Claus Kastning has done the bulk of the work. With great perseverance and diligence he has gathered all the material and checked it with the original sources. The main aim was to incorporate rare and not easily accessible sources like Russian journals, preprints or unpublished papers. Without the invaluable and dedicated engagement of Claus Kastning the bibliography would never have reached this final version. For this reason he must be considered its responsible editor. As with any other collection this literature list has a subjective viewpoint and may be in some sense incomplete. We have however tried to be as complete as possible. The bibliography contains 4704 different publications by 6767 authors which were classified by descriptor entries. Publications i ~ the field of graph theory, set theory, theory of algorithms, and computer complexity are incorporated only if there is some contact with Integer P r o g r ~ Besides i n g. theoretical papers, applications in economics, business administration, engineering, and sclences have also been collected. All algorithmic approaches and descriptions of computer codes for combinatorial optimization have been included. Criticisms and additions by the reader are kindly requested. The deadline of this bibliography was the end of An updated version of it is planned and will be compiled at the Literaturstelle fur Operations Research, NassestraBe 2, D-5300 Bonn 1. All authors are therefore cordially asked to

5 VI contribute all supplementary material to this address. The easiest way to do this is to send all preprints and reprints of future research to the L i t e r a t u ~ s t e l l e where they will be collected and documented. All addenda to this bibliography will be issued there. Finally, I would like to thank all the contribut ors to this work. My special thanks are due to the programmers of t he institute who have spent a substantial amount of time and effort in data handling and programmin g the final print-outs. Bonn, March 1976 Bernh ard Korte

6 Introductory remarks This bibliography conta ins publications on integer appearing until 1975 and covering the following topics: theory and methods of general i nteger, combinatorial and graph theoretical optimization problems, and applications of integer. 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. ~ e r! _ This 1 ~ comprises the alphabetical bibliography which lists all publications alphabetically ~ y the first author and chronologically for each author, and includes the full bibliographical data plus a reference code, which reflects the author's name and the publication year. The purpose of the code is to enable the user to identify publications referred to in Parts 2 and 3. Bibliographical data are given as follows: a) Textbook: ref. code authors title. Where published: publishers. year. b) paper in a journal: ref. code authors title. Journal vol. no., pages (year). c) Paper in a proceedings volume: ref. code authors title of paper IN: Editors (ED.): title of proceedings volume, pages. Where published: publishers. year. d) Working paper: ref. code authors title. WORKING PAPER, where published, year.

7 VIII Publications written in English, French, or German appear with t heir original title. Titles of publications written in other languages have been trans lated into English and the original language indicated in brackets. ~ ~! _ ~ ~ In this part t he publications have been classified alphabetically according to 41 subjects, within which the ordering is again alphabetical by the first author. The subject list on p. VII contains 106 topics in alphabetical order together with the subject heading to which they have been assigned - subject headings themselves have been underlined in the list. Most publications appear under several headings. However, the data quoted is restricted to names of authors, title, and reference code, with which the full bibliographical data can be retrieved ln Part 1. ~ ~! _ ~ ~ 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 appearing in Part 1, and lists for each author the reference codes of all his publications.

8 Subject List additive algorithm aggregation algorithm (codes) allocation applications of integer approximative algorithms assignment backtracking methods balanced matrices Benders' method bivalent Boolean methods bottleneck problems branch and bound particular zero-one algorithms diophantine systems and aggregation computer codes location and allocation branch and bound unimodular, balanced, and perfect matrices decomposition; mixed integer zero-one zero-one assignment; scheduling; transportation; travelling salesman chance constrained methods Chinese postman coloring problems complexity computational results computer codes cones convex integer corner polyhedra covering,packing, CPM crew scheduling cutting planes cyclic groups stochastic integer travelling salesman graph theory group theoretic approach nonlinear integer group theoretic approach; integer polyhedra applications of integer ; scheduling group theoretic approach

9 X decomposition diophantine systems and aggregation duality in integer dynamic edge enumeration methods Eulerian cycles facets filter algorithm branch and bound travelling salesman integer polyhedra particular zero-one algorithms fixed charge flows in networks game theory graph theory group theoretic approach Hamiltonian cycle Hermite normal form travelling salesman diophantine systems and aggregation; group theoretic approach heuristic methods Hitchcock-Koopmans- problem Hungarian method implicit enumeration independent sets integer linear over cones (ILPC) transportation assignment branch and bound group theoretic approach integer (general, no survey) intersection cuts job-shop scheduling scheduling knapsack large scale lattice points decomposition diophantine systems and aggregation; knapsack

10 XI location and allocation machine scheduling marriage problem scheduling assignment matching mathematical foundations matroids maximal flow problem integer polyhedra; mathematical foundations mixed integer MPM multi-dimensional transportation multi-terminal flow node covering nonlinear integer packing parametric integer duality in integer particular zero-one algorithms algorithms penalty methods perfect matrices PERT primal integer post-optimization quadratic integer reduction of inequalities routing problem ; decomposition branch and bound; unconstrained integer unimodular, balanced and perfect matrices duality in integer nonlinear integer diophantine systems and aggregation travelling salesman

11 XII scheduling sensitivity analysis sequencing set shortest paths Smith normal f orm spanning tree stable sets stochastic integer surrogate constraints surveys, bibliographies duality in integer scheduling diophantine systems and a g g r ~ g a t i o n ; approach graph t h eory group theoretic branch and bound; cutting planes; particular zero-one algorithms textbooks totally unimodular matrices transshipment unimodular, balanced, and perfect matrices transportation travelling salesman triangularization branch and bound unconstrained integer unimodular, balanced, and perfect matrices vehicle (truck) routing vertex zero-one applicat ions of integer ; travelling salesman