Some problems in discrete optimization

The present paper concentrates on several problems of network flows and discrete optimization. Progress has been made on some of the problems while little is known about others. Some of the problems discussed are shortest paths, multi-commodity flows, traveling salesman problems, m-center problem, telepak problems and binary trees.

[1]  Kunio Murasugi,et al.  The Arf invariant for knot types , 1969 .

[2]  B. Rothschild,et al.  Feasibility of Two Commodity Network Flows , 1966, Oper. Res..

[3]  Lewis T. Reinwald,et al.  Conversion of Limited-Entry Decision Tables to Optimal Computer Programs II: minimum storage requirement , 1967, JACM.

[4]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[5]  S. Akers.  The Use of Wye-Delta Transformations in Network Simplification , 1960 .

[6]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[7]  T. C. Hu.  A Decomposition Algorithm for Shortest Paths in a Network , 1968, Oper. Res..

[8]  Claude Berge,et al.  Programming, games and transportation networks , 1966 .

[9]  James Turner,et al.  A Survey of Progress in Graph Theory in the Soviet Union , 1970 .

[10]  Daniel J. Kleitman.  Minimal Number of Multiple Edges in Realization of an Incidence Sequence Without Loops , 1970 .

[11]  E. Minieka.  The m-Center Problem , 1970 .

[12]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.

[13]  H. D. Ratliff,et al.  Set Covering and Involutory Bases , 1971 .

[14]  T. C. Hu,et al.  Synthesis of a Communication Network , 1964 .

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

[16]  T. C. Hu.  Multi-Commodity Network Flows , 1963 .

[17]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[18]  E. Cockayne.  ON THE EFFICIENCY OF THE ALGORITHM FOR STEINER MINIMAL TREES , 1970 .

[19]  Frank Harary,et al.  Graph Theory , 2016 .

[20]  M. Fujii,et al.  Optimal Sequencing of Two Equivalent Processors , 1969 .

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

[22]  A. Land,et al.  The Extension of the Cascade Algorithm to Large Graphs , 1967 .

[23]  A. Owens.  On Determining the Minimum Number of Multiple Edges for an Incidence Sequence , 1970 .

[24]  S. Vajda,et al.  Integer Programming and Network Flows , 1970 .

[25]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[26]  Richard C. Grinold.  Letter to the Editor - A Multicommodity Max-Flow Algorithm , 1968, Oper. Res..

[27]  J. Moon.  Topics on tournaments , 1968 .

[28]  T. C. Hu.  Parallel Sequencing and Assembly Line Problems , 1961 .

[29]  T. C. Hu,et al.  Shortcut in the decomposition algorithm for shortest paths in a network , 1969 .

[30]  S. L. Hakimi,et al.  On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness , 1963 .

[31]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[32]  Lewis T. Reinwald,et al.  Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time , 1966, JACM.

[33]  Leon S. Lasdon,et al.  A generalized upper bounding algorithm for multicommodity network flow problems , 1971, Networks.

[34]  V. Benes,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[35]  Ivan T. Frisch,et al.  Communication, transmission, and transportation networks , 1971 .

[36]  H. Pollak,et al.  Steiner Minimal Trees , 1968 .

[37]  H. D. Ratliff,et al.  Optimal Defense of Multi-Commodity Networks , 1971 .

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

[39]  Daniel J. Kleitman,et al.  Methods for investigating the connectivity of large graphs , 1969 .

[40]  George L. Nemhauser,et al.  The Traveling Salesman Problem: A Survey , 1968, Oper. Res..

[41]  D. R. Fulkerson.  Flow Networks and Combinatorial Operations Research , 1966 .

[42]  Michael Randolph Garey.  Optimal binary decision trees for diagnostic identification problems , 1970 .

[43]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .