Answers are grounded in this paper and cite their sources.
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 adaptations in the formulation provide an enhanced convergence in the algorithm without losing robustness. The results of an analytical problem and benchmark problem 22 indicate the applicability of the procedure suggested.
No takes yet. Share an insight, caveat, or question.
Saldanha et al. (1999) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: