References

[DFJ54]

G. B. Dantzig, D. R. Fulkerson, and S. Johnson. Solution of a large scale traveling salesman problem. Operations Research, pages 393–410, 1954.

[Dan63]

George B. Dantzig. Linear programming and extensions. Princeton University Press Princeton, N.J, 1963.

[FF56]

L. R. Ford and D. R. Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, 8:399–404, 1956. URL: http://www.rand.org/pubs/papers/P605/.

[GG61]

P. C. Gilmore and R. E. Gomory. A linear programming approach to the cutting-stock problem. Operations Research, 9(6):849–859, 1961. URL: http://or.journal.informs.org/cgi/content/abstract/9/6/849, arXiv:http://or.journal.informs.org/cgi/reprint/9/6/849.pdf, doi:10.1287/opre.9.6.849.

[GG63]

P. C. Gilmore and R. E. Gomory. A linear programming approach to the cutting stock problem–Part II. Operations Research, 11(6):863–888, 1963. URL: http://or.journal.informs.org/cgi/content/abstract/11/6/863, arXiv:http://or.journal.informs.org/cgi/reprint/11/6/863.pdf, doi:10.1287/opre.11.6.863.

[MTZ69]

C. E. Miller, A. W. Tucker, and R. A. Zemlin. Integer programming formulation of traveling salesman problems. Journal of ACM, :326–329, 1969.

[Sch86]

Alexander Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, Chichester, 1986.