Discrete optimization and network flows

[1]  K. Upton,et al.  A modern approach , 1995 .

[2]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[3]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[4]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

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

[6]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[7]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[8]  M. J. Maher,et al.  Model Building in Mathematical Programming , 1978 .

[9]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[10]  Jaroslav Nesetril,et al.  Otakar Boruvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history , 2001, Discret. Math..

[11]  Rainer E. Burkard,et al.  Selected topics on assignment problems , 2002, Discret. Appl. Math..

[12]  Ravindra K. Ahuja,et al.  Network Flows , 2011 .

[13]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[14]  Stephen P. Boyd,et al.  Branch and Bound Methods , 1987 .

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

[16]  Bernard Chazelle,et al.  A minimum spanning tree algorithm with inverse-Ackermann type complexity , 2000, JACM.

[17]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[18]  G. Nemhauser,et al.  Integer Programming , 2020 .

[19]  M. Sniedovich.  Dynamic programming : foundations and principles , 2011 .

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

[21]  H. M. Wagner.  On a Class of Capacitated Transportation Problems , 1959 .

[22]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[23]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[24]  Robert Sedgewick,et al.  Algorithms in C , 1990 .

[25]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

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

[27]  Manuel Laguna,et al.  Tabu Search , 1997 .

[28]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

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

[30]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

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

[32]  Abraham P. Punnen,et al.  A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..

[33]  William H. Cunningham,et al.  A network simplex method , 1976, Math. Program..

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