On integer solutions to quadratic programs by a branch and bound technique

  • S. C. Agrawal


This paper provides a method for solving quadratic programs in integers with the help of a branch and bound technique.


Objective Function Integer Solution Convex Polyhedron Linear Objective Function Naval Research Logistics 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. (1).
    Kunzi, H. P., and W. Oettli, “Integer Quadratic Programming.” In R. L. Graves and Ph. Wolfe, Recent Advances in Mathematical Programming, Mc-Graw Hill, 1963.Google Scholar
  2. (2).
    Agrawal, S. C., and Kanti Swarup, “On Integer Solutions to Quadratic Programs,” to appear.Google Scholar
  3. (3).
    Agrawal, S. C., “On Mixed Integer Quadratic Programs” to appear.Google Scholar
  4. (4).
    Land, A. H., and Doig, A. G., “An Automatic Method of Solving Discrete Programming Problems”, Econometrica 28, 497–520 (1960)MATHCrossRefMathSciNetGoogle Scholar
  5. (5).
    Beale, E. M. L., “On Quadratic Programming.” Naval Research Logistics Quart., 6 (1959).Google Scholar
  6. (6).
    Balinski, M. L., “Integer Programming: Methods, Uses, Computation,” Management Science, 12 (3), 253–313 (Nov. 1965).CrossRefMathSciNetGoogle Scholar
  7. (7).
    Hu, T. C., “Integer Programming and Network Flows.” Addison-Wesley, 1969.Google Scholar

Copyright information

© Springer 1974

Authors and Affiliations

  • S. C. Agrawal
    • 1
  1. 1.Deptt. of MathematicsD. N. CollegeMeerut

Personalised recommendations