 | Monter d'un niveau |
Engau, A., & Anjos, M. F. (2017). Convergence and polynomiality of primal-dual interior-point algorithms for linear programming with selective addition of inequalities. Optimization, 66(12), 2063-2086. Lien externe
Engau, A., Anjos, M. F., & Bomze, I. (2013). Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem. Mathematical Methods of Operations Research, 78(1), 35-59. Lien externe
Engau, A., Anjos, M. F., & Vannelli, A. (2012). On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems. Optimization Methods and Software, 27(3), 539-559. Lien externe
Engau, A., Anjos, M. F., & Vannelli, A. (2010). An improved interior-point cutting-plane method for binary quadratic optimization. Electronic Notes in Discrete Mathematics, 36, 743-750. Lien externe
Engau, A., Anjos, M. F., & Vannelli, A. (2010). On interior-point warmstarts for linear and combinatorial optimization. SIAM Journal on Optimization, 20(4), 1828-1861. Lien externe
Engau, A., Anjos, M. F., & Vannelli, A. (2009). A Primal-Dual Slack Approach to Warmstarting Interior-Point Methods for Linear Programming. Dans Operations Research and Cyber-Infrastructure (195-217). Lien externe
