A branch and bound algorithm for solving a class of nonlinear integer programming problems

This publication has 17 references indexed in Scilit:

• A Survey of Methods for Pure Nonlinear Integer Programming
  Management Science, 1981
• The use of dynamic programming methodology for the solution of a class of nonlinear programming problems
  Naval Research Logistics Quarterly, 1980
• An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions
  Naval Research Logistics Quarterly, 1979
• A dynamic programming branch and bound algorithm for pure integer programming
  Computers & Operations Research, 1976
• The Fixed-Charge Transportation Problem: A Computational Study with a Branch-and-Bound Code
  A I I E Transactions, 1976
• Lagrangean relaxation for integer programming
  Published by Springer Nature ,1974
• An Algorithm for Separable Nonconvex Programming Problems
  Management Science, 1969
• An Algorithm for the Solution of Mixed Integer Programming Problems
  Management Science, 1966
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
  Operations Research, 1965
• A tree-search algorithm for mixed integer programming problems
  The Computer Journal, 1965