A Practical Guide to Discrete Optimization Dynamic Programming , 29 December 2014

[1]  P. Seymour.  How the proof of the strong perfect graph conjecture was found , 2006 .

[2]  Richard Bellman,et al.  Adaptive Control Processes: A Guided Tour , 1961, The Mathematical Gazette.

[3]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[4]  Brian W. Kernighan,et al.  Elements of Programming Style , 1974 .

[5]  Alan J. Hoffman,et al.  A generalization of max flow—min cut , 1974, Math. Program..

[6]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[7]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

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

[9]  John N. Hooker,et al.  Needed: An Empirical Science of Algorithms , 1994, Oper. Res..

[10]  Satoru Fujishige,et al.  An Efficient PQ-Graph Algorithm for Solving the Graph-Realization Problem , 1980, J. Comput. Syst. Sci..

[11]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[12]  Giacomo Zambelli,et al.  A polynomial recognition algorithm for balanced matrices , 2005, J. Comb. Theory, Ser. B.

[13]  Klaus Truemper,et al.  A decomposition theory for matroids. V. Testing of matrix total unimodularity , 1990, J. Comb. Theory, Ser. B.

[14]  L. Lovász.  A Characterization of Perfect Graphs , 1972 .

[15]  Jean,et al.  The Computer and the Brain , 1989, Annals of the History of Computing.

[16]  Bjarne Stroustrup,et al.  C++ Programming Language , 1986, IEEE Softw..

[17]  A. Frank.  Connections in Combinatorial Optimization , 2011 .

[18]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[19]  J. Lenstra,et al.  In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation , 2016 .

[20]  George B. Dantzig,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, Oper. Res..

[21]  R. Bellman.  COMBINATORIAL PROCESSES AND DYNAMIC PROGRAMMING , 1958 .

[22]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[23]  W. Cunningham,et al.  Matroid optimization and algorithms , 1996 .

[24]  Robert E. Bixby,et al.  An Almost Linear-Time Algorithm for Graph Realization , 1988, Math. Oper. Res..

[25]  Thomas Bartz-Beielstein,et al.  Experimental Methods for the Analysis of Optimization Algorithms , 2010 .

[26]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[27]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[28]  Richard M. Karp,et al.  Combinatorics, complexity, and randomness , 1986, CACM.

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

[30]  Gerhard J. Woeginger,et al.  Exact Algorithms for NP-Hard Problems: A Survey , 2001, Combinatorial Optimization.

[31]  David S. Johnson,et al.  A theoretician's guide to the experimental analysis of algorithms , 1999, Data Structures, Near Neighbor Searches, and Methodology.

[32]  Ralph E. Gomory,et al.  Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem , 2010, 50 Years of Integer Programming.

[33]  William Orchard-Hays,et al.  Advanced Linear-Programming Computing Techniques , 1968 .

[34]  Ulrich Pferschy,et al.  Dynamic Programming Revisited: Improving Knapsack Algorithms , 1999, Computing.

[35]  Gregory Gutin,et al.  The traveling salesman problem , 2006, Discret. Optim..

[36]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[37]  Richard Bellman,et al.  Dynamic Programming Treatment of the Travelling Salesman Problem , 1962, JACM.

[38]  Harvey Friedman.  Programming Pearls, 2nd Edition , 2000 .

[39]  Alan J. Hoffman,et al.  Integral Boundary Points of Convex Polyhedra , 2010, 50 Years of Integer Programming.

[40]  A. M. Murray.  The strong perfect graph theorem , 2019, 100 Years of Math Milestones.

[41]  G. L. Thompson,et al.  A Heuristic Approach to Solving Travelling Salesman Problems , 1964 .

[42]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[43]  David Pisinger,et al.  A Minimal Algorithm for the 0-1 Knapsack Problem , 1997, Oper. Res..

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

[45]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[46]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[47]  Agha Iqbal Ali,et al.  Computational implementation of Fujishige's graph realizability algorithm , 1998, Eur. J. Oper. Res..

[48]  Gérard Cornuéjols,et al.  Decomposition of Balanced Matrices , 1999, J. Comb. Theory, Ser. B.

[49]  Li Feng,et al.  The complexity of recognizing linear systems with certain integrality properties , 2008, Math. Program..

[50]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[51]  P. B. Coaker,et al.  Applied Dynamic Programming , 1964 .

[52]  Wm. Orchard-Hays,et al.  Evolution of Linear Programming Computing Techniques , 1958 .

[53]  Donald A. Martin,et al.  Mathematical Problems. Lecture Delivered Before the International Congress of Mathematicians at Paris in 1900 , 1979 .

[54]  Martin Grötschel,et al.  On the symmetric travelling salesman problem: Solution of a 120-city problem , 1980 .

[55]  Paul D. Seymour,et al.  Recognizing Berge Graphs , 2005, Comb..

[56]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[57]  B. Gluss.  AN INTRODUCTION TO DYNAMIC PROGRAMMING , 1961 .

[58]  Paul D. Seymour,et al.  Graph Minors. XX. Wagner's conjecture , 2004, J. Comb. Theory B.

[59]  J. Edmonds,et al.  A Min-Max Relation for Submodular Functions on Graphs , 1977 .

[60]  Paul D. Seymour,et al.  Decomposition of regular matroids , 1980, J. Comb. Theory, Ser. B.

[61]  D. R. Fulkerson,et al.  Anti-blocking polyhedra , 1972 .

[62]  Thomas A. Cargill.  C-i--~ programming style , 1992 .

[63]  Alexander Schwartz,et al.  Implementing weighted b-matching algorithms: towards a flexible software design , 1999, JEAL.

[64]  Gérard Cornuéjols,et al.  Balanced matrices , 2006, Discret. Math..

[65]  Gérard Cornuéjols,et al.  Balanced 0-1 Matrices II. Recognition Algorithm , 2001, J. Comb. Theory, Ser. B.

[66]  David Thomas,et al.  The Art in Computer Programming , 2001 .