User menu

Generalized dynamic programming methods in integer programming

Bibliographic reference Wolsey, Laurence. Generalized dynamic programming methods in integer programming. In: Mathematical Programming, Vol. 4, p. 222-232 (1973)
Permanent URL
  1. E. Balas, “An additive algorithm for solving linear programs zero-one variables”,Operations Research 13 (1965) 517–546.
  2. R.E. Bellman,Dynamic Programming (Princeton Univ. Press, Princeton, N.J., 1957).
  3. M.L. Fisher and J.F. Shapiro, “Constructive duality in integer programming”, Mimeo, Sloan School of Management, M.I.T. (April 1972, revised May 1972).
  4. B.L. Fox, “Calculatingk th shortest paths”, Mimeo, University of Chicago (February 1972).
  5. R.E. Gomory, “On the relation between integer and non-integer solutions to linear programs”,Proceedings of the National Academy of Sciences of the U.S.A. 53 (1965) 250–265.
  6. G.A. Gorry and J.F. Shapiro, “An adaptive group theoretic algorithm for integer programming problems”,Management Science 17 (1971) 285–306.
  7. G.A. Gorry, J.F. Shapiro and L.A. Wolsey, “Relaxation methods for pure and mixed integer programming problems”,Management Science 18 (1972) 229–239.
  8. W. Hoffman and R. Pavley, “A method for the solution of theN th best problem”,Journal of the Association for Computing Machinery 6 (1959) 506–514.
  9. A.H. Land and S. Powell, “Fortran programs for linear and nonlinear programming,” London School of Economics (1971).
  10. E.L. Lawler, “A procedure for computing theK best solutions to discrete optimization problems and its application to the shortest path problem”,Management Science 18 (1972) 401–405.
  11. J.F. Shapiro, “Dynamic programming algorithms for the integer programming problem I: The integer programming problem viewed as a knapsack type problem”,Operations Research 16 (1968) 103–121.
  12. W.W. White, “On the group theoretic approach to integer linear programming”, ORC 66-26, University of California, Berkeley, Calif. (September 1966).
  13. L.A. Wolsey, “Extensions of the group theoretic approach in integer programming”,Management Science 18 (1971) 74–83.
  14. L.A. Wolsey, “Bounds and cuts in integer programming”, CORE Discussion Paper No. 7213 (June 1972).