Non-linear integer programming: Sensitivity analysis for branch and bound
We consider the nonlinear integer programming problem with varying right hand side and objective function coefficients. We establish what additional information to keep in the implicit enumeration tree, when solving the original problem, in order to provide us with bounds on the optimal value of a perturbed problem. The results obtained are extensions of the results given by \textit{L. Schrage} and \textit{L. Wolsey} [Oper. Res. 33, 1008-1023 (1985; Zbl 0583.90074)] for linear integer programs.
scientific article; zbMATH DE number 4039638
scientific article