This paper presents an adaptive deep cut algorithm for the ellipsoid method
. The formulation proposed employs a variable cut depth which depends on an
estimate of the current ellipsoid center distance to the solution. These a
daptations in the formulation provide an enhanced convergence in the algori
thm without losing robustness. The results of an analytical problem and ben
chmark problem 22 indicate the applicability of the procedure suggested.