On the History of Combinatorial Optimization (Till 1960)

[1]  T. Lindvall.  ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[2]  On Shortest Polygonal Approximations to a Curve , 2003 .

[3]  Xie Fan.  An Algorithm for Solving the Transportation Problem , 2002 .

[4]  Polynomial Inequalities.  On the Representation of Polyhedra by , 2002 .

[5]  Jaroslav Nesetril,et al.  Vojtech Jarni'k's work in combinatorial optimization , 2001, Discret. Math..

[6]  Joseph B. Kruskal.  A reminiscence about shortest spanning subtrees , 1997 .

[7]  Kenneth S. Alexander.  A conversation with Ted Harris , 1996 .

[8]  Jan Karel Lenstra,et al.  History of mathematical programming : a collection of personal reminiscences , 1991 .

[9]  W.-D. Wei,et al.  On A Personnel Assignment Problem , 1990, Int. J. Found. Comput. Sci..

[10]  阿部 浩一,et al.  Fundamenta Mathematicae私抄 : 退任の辞に代えて , 1987 .

[11]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[12]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[13]  Ronald L. Graham,et al.  On the History of the Minimum Spanning Tree Problem , 1985, Annals of the History of Computing.

[14]  Jitender S. Deogun,et al.  A Personnel Assignment Problem , 1984, J. Algorithms.

[15]  Karl Menger,et al.  On the origin of the n-arc theorem , 1981, J. Graph Theory.

[16]  Tibor Gallai,et al.  The life and scientific work of Dénes König (1884–1944)☆ , 1978 .

[17]  Paul Cull,et al.  A Matrix Algebra for Neural Nets , 1978 .

[18]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[19]  N. Biggs,et al.  Graph Theory 1736-1936 , 1976 .

[20]  Norman Zadeh,et al.  A bad network problem for the simplex method and other minimum cost flow algorithms , 1973, Math. Program..

[21]  Donald B. Johnson,et al.  A Note on Dijkstra's Shortest Path Algorithm , 1973, JACM.

[22]  Donald B. Johnson,et al.  Algorithms for Shortest Paths , 1973 .

[23]  Tjalling C. Koopmans.  A Note About Kantorovich's Paper, “Mathematical Methods of Organizing and Planning Production” , 1960 .

[24]  L. V. Kantorovich,et al.  Mathematical Methods of Organizing and Planning Production , 1960 .

[25]  G. Dantzig.  On the Shortest Route Through a Network , 1960 .

[26]  L. Bittner.  C. Berge, Théorie des graphes et ses applications. VIII + 277 S. m. 117 Abb. Paris 1958. Dunod Editeur. Preis geb. 3400 F , 1960 .

[27]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[28]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[29]  Selmer M. Johnson,et al.  On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem , 1959 .

[30]  S. Vajda,et al.  Contributions to the Theory of Games. Volume III. Annals of Mathematics Studies Number 39. Edited by M. Dresher, A. W. Tucker and P. Wolfe. (Princeton University Press) , 1954, The Mathematical Gazette.

[31]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[32]  T. Gallai,et al.  Maximum-Minimum Sätze über Graphen , 1958 .

[33]  Richard Pavley,et al.  Applications of digital computers to problems in the study of vehicular traffic , 1958, IRE-ACM-AIEE '58 (Western).

[34]  C. Berge.  Théorie des graphes et ses applications , 1958 .

[35]  L. L. Barachet.  Letter to the Editor---Graphic Solution of the Traveling-Salesman Problem , 1957 .

[36]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[37]  George J. Minty.  Letter to the Editor—A Variant on the Shortest-Route Problem , 1957 .

[38]  Arnold Weinberger,et al.  Formal Procedures for Connecting Terminals with a Minimum Total Wire Length , 1957, JACM.

[39]  A. Charnes,et al.  Part II ‐ Generalization and analysis , 1957 .

[40]  T. E. Bartlett,et al.  An algorithm for the minimum number of transport units to maintain a fixed schedule , 1957 .

[41]  D. R. Fulkerson,et al.  Construction of maximal dynamic flows in networks. , 1957 .

[42]  William Prager,et al.  A Generalization of Hitchcock's Transportation Problem , 1957 .

[43]  G. Dantzig.  Discrete-Variable Extremum Problems , 1957 .

[44]  J. Munkres.  ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[45]  Proceedings of the Second Symposium in Linear Programming , 1957 .

[46]  R. Rado.  Note on Independence Functions , 1957 .

[47]  D. R. Fulkerson,et al.  A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem , 1957, Canadian Journal of Mathematics.

[48]  D. R. Fulkerson,et al.  A primal‐dual algorithm for the capacitated Hitchcock problem , 1957 .

[49]  T. Koopmans,et al.  Studies in the Economics of Transportation. , 1956 .

[50]  Peter Elias,et al.  A note on the maximum flow through a network , 1956, IRE Trans. Inf. Theory.

[51]  I. Heller.  Neighbor relations on the convex of cyclic permutations. , 1956 .

[52]  A. Orden.  The Transhipment Problem , 1956 .

[53]  M. M. Flood.  The Traveling-Salesman Problem , 1956 .

[54]  L. Rosenfeld.  Unusual problems and their solutions by digital computer techniques , 1956, AIEE-IRE '56 (Western).

[55]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956, Canadian Journal of Mathematics.

[56]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[57]  L. Few.  The shortest path and the shortest road through n points , 1955 .

[58]  Alexander W. Boldyreff,et al.  Determination of the Maximal Steady State Flow of Traffic Through a Railroad Network , 1955, Oper. Res..

[59]  T. E. Harris,et al.  Fundamentals of a Method for Evaluating Rail Net Capacities , 1955 .

[60]  J T Robacker.  Some Experiments on the Traveling-Salesman Problem , 1955 .

[61]  A. H. Land,et al.  A Contribution to the “Travelling‐Salesman” Problem , 1955 .

[62]  D. R. Fulkerson,et al.  On the Max Flow Min Cut Theorem of Networks. , 1955 .

[63]  H. W. Kuhn B R Y N Mawr College.  Variants of the Hungarian Method for Assignment Problems' , 1955 .

[64]  William J. Cook,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.

[65]  D. R. Fulkerson,et al.  MINIMIZING THE NUMBER OF CARRIERS TO MEET A FIXED SCHEDULE , 1954 .

[66]  P. S. Dwyer.  Solution of the personnel classification problem with the method of optimal regions , 1954 .

[67]  A. Shimbel.  Structural parameters of communication networks , 1953 .

[68]  John von Neumann,et al.  1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem , 1953 .

[69]  Philip M. Morse.  The Operations Research Society of America , 1952, Oper. Res..

[70]  F. Lord.  Notes on a problem of multiple classification , 1952 .

[71]  D. F. Votaw.  Methods of solving some personnel-classification problems , 1952 .

[72]  T. Koopmans.  Activity analysis of production and allocation : proceedings of a conference , 1952 .

[73]  イヴォン ブレース,et al.  Presses Universitaires de France刊行の近著解題 , 1952 .

[74]  Darrel L Trueblood.  EFFECT OF TRAVEL TIME AND DISTANCE ON FREEWAY USAGE , 1952 .

[75]  O. H. Brownlee,et al.  ACTIVITY ANALYSIS OF PRODUCTION AND ALLOCATION , 1952 .

[76]  D. F. VOT.W.  Methods of Solving Some Personnel-classification Problems* , 1952 .

[77]  A. Shimbel.  Applications of matrix algebra to communication nets , 1951 .

[78]  S. Verblunsky.  On the shortest path through a number of points , 1951 .

[79]  M. Fréchet.  Sur les tableaux de correlation dont les marges sont donnees , 1951 .

[80]  K. Florek,et al.  Sur la liaison et la division des points d'un ensemble fini , 1951 .

[81]  R. Taton.  L'œuvre scientifique de Monge , 1951 .

[82]  Philip Wolfe,et al.  Contributions to the theory of games , 1953 .

[83]  R. L. Thorndike.  The problem of classification of personnel , 1950, Psychometrika.

[84]  R. Luce,et al.  Connectivity and generalized cliques in sociometric group structure , 1950, Psychometrika.

[85]  J. Neumann,et al.  SOLUTIONS OF GAMES BY DIFFERENTIAL EQUATIONS , 1950 .

[86]  J. Robinson.  On the Hamiltonian Game (A Traveling Salesman Problem) , 1949 .

[87]  T. Koopmans.  Optimum Utilization of the Transportation System , 1949 .

[88]  R. Luce,et al.  A method of matrix analysis of group structure , 1949, Psychometrika.

[89]  M. N. Ghosh.  Expected Travel Among Random Points in a Region , 1949 .

[90]  E. Marks.  A Lower Bound for the Expected Travel Among $m$ Random Points , 1948 .

[91]  A matrix calculus for neural nets: II , 1947 .

[92]  T. E. Easterfield.  A Combinatorial Algorithm , 1946 .

[93]  H. D. Landahl,et al.  Outline of a matrix calculus for neural nets , 1946 .

[94]  R. J. Jessen,et al.  Statistical investigation of a sample survey for obtaining farm facts , 1942 .

[95]  F. L. Hitchcock.  The Distribution of a Product from Several Sources to Numerous Localities , 1941 .

[96]  L. Fejes.  Über einen geometrischen Satz , 1940 .

[97]  P. Mahalanobis.  A sample survey of the acreage under jute in Bengal. , 1940 .

[98]  Tanker freight rates and tankship building : an analysis of cyclical fluctuations , 1939 .

[99]  Tibor Grünwald,et al.  Ein Neuer Beweis Eines Mengerschen Satzes , 1938 .

[100]  Hans Hahn,et al.  Ergebnisse eines mathematischen Kolloquiums , 1932 .

[101]  H. Whitney.  Congruent Graphs and the Connectivity of Graphs , 1932 .

[102]  Eine Verschärfung des n-Beinsatzes , 1932 .

[103]  K. Menger,et al.  Bericht über ein mathematisches Kolloquium 1929/30 , 1931 .

[104]  Karl Menger,et al.  Some Applications of Point-Set Methods , 1931 .

[105]  K. Menger,et al.  Untersuchungen über allgemeine Metrik. Vierte Untersuchung. Zur Metrik der Kurven , 1930 .

[106]  Norman E. Rutt.  Concerning the Cut Points of a Continuous Curve when the Arc Curve, AB, Contains Exactly N Independent Arcs , 1929 .

[107]  Sui punti regolari nelle curve di Jordan , 1929 .

[108]  K. Menger.  Untersuchungen über allgemeine Metrik , 1928 .

[109]  K. Menger.  Zur allgemeinen Kurventheorie , 1927 .

[110]  G. A. Miller,et al.  MATHEMATISCHE ZEITSCHRIFT. , 1920, Science.

[111]  D. König.  Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre , 1916 .

[112]  Sitzungsberichte der Königlich Preussischen Akademie der Wissenschaften zu Berlin , 1892 .

[113]  Chr Wiener.  Ueber eine Aufgabe aus der Geometria situs , 1873 .

[114]  Thomas Penyngton Kirkman.  XVIII. On the representation of polyedra , 1856, Philosophical Transactions of the Royal Society of London.