Computational experience with a group theoretic integer programming algorithm

1. S. Cabay, “Exact solution of linear equations,” in:Proceedings of the Second Symposium on Symbolic and Algebraic Manipulation (Association for Computing Machinery, Los Angeles, Calif., March 1971) 392.

   Google Scholar 

2. E.W. Dijkstra, “A note on two problems in connexion with graphs,”Numerische Mathematik 1 (1959) 269.

   Google Scholar 

3. S.E. Dreyfus, “An appraisal of some shortest-path algorithms,”Operations Research 17 (1969) 395.

   Google Scholar 

4. M.L. Fisher and J.F. Shapiro, “Constructive duality in integer programming,” Operations Research Center Working Paper No. OR 008-72, Massachusetts Institute of Technology, Cambridge, Mass. (April 1972).

   Google Scholar 

5. A.M. Geoffrion, “An improved implicit enumeration approach for integer programming,”Operations Research 17 (1969) 437.

   Google Scholar 

6. F. Glover, “Integer programming over a finite additive group,”SIAM Journal on Control 1 (1969) 213.

   Google Scholar 

7. F. Glover, “Faces of the Gomory polyhedron,” in:Integer and nonlinear programming, Ed. J. Abadie (North-Holland, Amsterdam, 1970).

   Google Scholar 

8. R.E. Gomory, “An algorithm for integer solutions to linear programs,” in:Recent advances in mathematical programming, Eds. R.L. Graves and P. Wolfe (McGraw-Hill, New York, 1963).

   Google Scholar 

9. 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) 260.

   Google Scholar 

10. R.E. Gomory, “Some polyhedra related to combinatorial problems,”Linear Algebra and Its Applications 2 (1969) 451.

    Google Scholar 

11. R.E. Gomory and E.L. Johnson, “Some continuous functions related to corner polyhedra,” IBM N.Y. Scientific Center Report No. RC-3311 (Yorktown Heights, N.Y., February 1971).

    Google Scholar 

12. G.A. Gorry and J.F. Shapiro, “An adaptive group theoretic algorithm for integer programming problems,”Management Science 17 (1971) 285.

    Google Scholar 

13. G.A. Gorry, J.F. Shapiro and L.A. Wolsey, “Relaxation methods for pure and mixed integer programming problems,”Management Science 18 (1972) 229.

    Google Scholar 

14. T.C. Hu,Integer programming and network flows (Addison—Wesley, Reading, Mass., 1969).

    Google Scholar 

15. T.C. Hu, “On the asymptotic integer algorithm,”Linear Algebra and Its Applications 3 (1970) 279.

    Google Scholar 

16. E.L. Johnson, personal communication.

17. B. Roy, R. Benayoun and J. Tergny, “From S.E.P. procedure to the mixed Ophelie program,” in:Integer and nonlinear programming, Ed. J. Abadie (North-Holland, Amsterdam, 1970).

    Google Scholar 

18. 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.

    Google Scholar 

19. J.F. Shapiro, “Generalized Lagrange multipliers in integer programming,”Operations Research 19 (1971) 68.

    Google Scholar 

20. D.A. Smith, “A basis algorithm for finitely generated Abelian groups,”Mathematical Algorithms 1 (1969) 13.

    Google Scholar 

21. J.H.S. Smith, “On systems of linear indeterminate equations and congruences,”Philosophical Transactions 151 (1861) 293.

    Google Scholar 

22. J.H.S. Smith,Collected mathematical papers, Vol. 1 (Clarendon Press, Oxford, 1894).

    Google Scholar 

23. H. Thiriez, “The set covering problem: a group theoretic approach,”Revue Française d'Informatique et de Recherche Operationelle V3 (1971) 83.

    Google Scholar 

24. C.J. Tompkins and V.E. Unger, “Group theoretic structures in the fixed charge transportation problem,”42nd National Meeting of ORSA, New Orleans, La., April 1972.

25. L.A. Wolsey, “Mixed integer programming: discretization and the group theoretic approach,” Ph.D. Thesis, and Technical Report No. 42, Operations Research Center, Massachusetts Institute of Technology, Cambridge, Mass. (June 1969).

    Google Scholar 

26. L.A. Wolsey, “Group-theoretic results in mixed integer programming,”Operations Research 19 (1971) 1691.

    Google Scholar 

27. L.A. Wolsey, “Extensions of the group theoretic approach in integer programming,”Management Science 18 (1971) 74.

    Google Scholar 

Download references