Advertisement

Annals of Operations Research

, Volume 149, Issue 1, pp 81–87 | Cite as

Branch and bound, integer, and non-integer programming

  • J. J. H. Forrest
  • J. A. Tomlin
Article

Keywords

Integer Variable Current Interval Discrete Program Problem Reference Entry Solve Integer Programming Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beale, E.M.L. (1963). “Two Transportation Problems.” In G. Kreweras and G. Morlat (Eds.), Proceedings of the Third International Conference on Operational Research, pp. 780–788. Dunod, Paris and English Universities Press, London.Google Scholar
  2. Beale, E.M.L. (1968). Mathematical Programming in Practice. London: Pitman’s, and New York: Wiley.Google Scholar
  3. Beale, E.M.L. (1970). “Advanced Algorithmic Features for General Mathematical Programming Systems”. In J. Abadie (Ed.), Integer and Nonlinear Programming, pp. 119–137. Amsterdam: North Holland.Google Scholar
  4. Beale, E.M.L. (1979). “Branch and Bound Methods for Mathematical Programming Systems.” Annals of Discrete Mathematics, 5, 201–219.CrossRefGoogle Scholar
  5. Beale, E.M.L. (1980). “Branch and Bound Methods for Numerical Optimization of Non-convex Functions.” In M.M. Barritt and D. Wishart (Eds.), COMPSTAT 80 Proceedings in Computational Statistics, pp. 11–20.Google Scholar
  6. Beale, E.M.L. (1985). “Integer Programming.” In K. Schittkowski (Ed.), Computational Mathematical Programming. NATO ASI Series F: Computer and System Sciences, Vol. 15. pp. 1–24 Berlin: Springer-Verlag.Google Scholar
  7. Beale, E.M.L. and R.C. Daniel. (1979). “Chains of Linked Ordered Sets: A New Formulation for Product Terms.” Presented at the 10th International Symposium on Mathematical Programming, Montreal.Google Scholar
  8. Beale, E.M.L. and J.J.H. Forrest. (1976). “Global Optimization using Special Ordered Sets.” Mathematical Programming, 10, 52–69.CrossRefGoogle Scholar
  9. Beale, E.M.L. and J.J.H. Forrest. (1978). “Global Optimization as an Extension of Integer Programming.” In L.C.W. Dixon and G.P. Szego (Eds.), Towards Global Optimization 2, pp. 131–149. Amsterdam: North Holland.Google Scholar
  10. Beale, E.M.L. and R.E. Small. (1965). “Mixed Integer Programming by a Branch and Bound Technique.” In W.A. Kalenich (Ed.), Proceedings of the IFIP Congress 1965, pp. 450–451. London: MacMillan and Washington, DC: Spartan Press.Google Scholar
  11. Beale, E.M.L. and J.A. Tomlin. (1970). “Special Facilities in a General Mathematical Programming System for Non-convex Problems using Ordered Sets of Variables.” In J. Lawrence (Ed.), Proceedings of the Fifth International Conference on Operational Research, pp. 447–454. London: Tavistock Publications.Google Scholar
  12. Benichou, M., J.M. Gauthier, G. Hentges, and G. Ribière. (1977). “The Efficient Solution of Large-scale Linear Programming Problems — Some Algorithmic Techniques and Computational Results.” Mathematical Programming, 13, 280–322.Google Scholar
  13. Dantzig, G.B. (1963). Linear Programming and Extensions. Princeton, NJ: Princeton University Press.Google Scholar
  14. Driebeck, N.J. (1966). “An Algorithm for the Solution of Mixed Integer Programming Problems.” Management Science, 12, 576–587.Google Scholar
  15. Forrest, J.J.H., J.P.H. Hirst, and J.A. Tomlin. (1974). “Practical Solution of Large Mixed Integer Programming Problems with UMPIRE.” Management Science, 20, 736–773.CrossRefGoogle Scholar
  16. Gomory, R.E. (1963). “An Algorithm for Integer Solutions to Linear Programs.” In R.L. Graves and P. Wolfe (Eds.), Recent Advances in Mathematical Programming, pp. 269–302. New York: McGraw-Hill.Google Scholar
  17. Gomory, R.E. (1991). “Early Integer Programming.” In J.K. Lenstra, et al. (Eds.), History of Mathematical Programming, pp. 55–61. Amsterdam: North Holland.Google Scholar
  18. Land, A.H. and A.G. Doig. (1960). “An Automatic Method for Solving Discrete Programming Problems.” Econometrica, 28, 497–520.CrossRefGoogle Scholar
  19. Markowitz, H.M. and A.S. Manne. (1957). “On the Solution of Discrete Programming Problems.” Econometrica, 25, 84–110.CrossRefGoogle Scholar
  20. Martin, G.T. (1963). “An Accelerated Euclidean Algorithm for Integer Linear Programming.” In R.L. Graves and P. Wolfe (Eds.), Recent Advances in Mathematical Programming, pp. 311–317. New York: McGraw-Hill.Google Scholar
  21. Shaw, M. (1969). “Review of Computational Experience in Solving Large Mixed Integer Programming Problems.” In E.M.L. Beale (Ed.), Applications of Mathematical Programming Techniques, pp. 406–412. London: English Universities Press.Google Scholar
  22. Tomlin, J.A. (1970). “Branch and Bound Methods for Integer and Non-convex Programming.” In J. Abadie (Ed.), Integer and Nonlinear Programming, pp. 437–450. Amsterdam: North Holland.Google Scholar
  23. Tomlin, J.A. (1981). “A Suggested Extension of Special Ordered Sets to Non-separable Non-convex Programming Problems.” In P. Hansen (Ed.), Studies on Graphs and Discrete Programming, pp. 359–370. Amsterdam: North Holland.Google Scholar
  24. Tomlin, J.A. (1988). “Special Ordered Sets and An Application to Gas Supply Operations Planning.” Mathematical Programming, 42, 69–84.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2006

Authors and Affiliations

  1. 1.IBM Watson Research CenterYorktown HeightsUSA
  2. 2.Yahoo! ResearchSunnyvaleUSA

Personalised recommendations