An approximate method for local optima for nonlinear mixed integer programming problems

This publication has 8 references indexed in Scilit:

• An implicit branch-and-bound algorithm for mixed-integer-linear programming
  Computers & Operations Research, 1990
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
  Operations Research, 1987
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
  Operations Research, 1974
• A Balasian-Based Algorithm for Zero-One Polynomial Programming
  Management Science, 1972
• Quadratic Binary Programming with Application to Capital-Budgeting Problems
  Operations Research, 1970
• A Method for Solving Discrete Optimization Problems
  Operations Research, 1966
• A tree-search algorithm for mixed integer programming problems
  The Computer Journal, 1965
• An Automatic Method of Solving Discrete Programming Problems
  Econometrica, 1960