A branch and bound algorithm for solving separable convex integer programming problems

This publication has 19 references indexed in Scilit:

• A branch and bound algorithm for solving a class of nonlinear integer programming problems
  Naval Research Logistics Quarterly, 1986
• The use of dynamic programming methodology for the solution of a class of nonlinear programming problems
  Naval Research Logistics Quarterly, 1980
• A hybrid approach to discrete mathematical programming
  Mathematical Programming, 1978
• Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming
  ACM Transactions on Mathematical Software, 1978
• An Algorithm for Nonlinear Knapsack Problems
  Management Science, 1976
• Non-linear integer programming
  Computers & Mathematics with Applications, 1975
• Integer Programming Formulation of Constrained Reliability Problems
  Management Science, 1967
• Pracniques: construction of nonlinear programming test problems
  Communications of the ACM, 1965
• Minimization of non‐linear separable convex functionals
  Naval Research Logistics Quarterly, 1954
• The Optimum Distribution of Effort
  Journal of the Operations Research Society of America, 1953