 | Up a level |
Collaboration networkThis graph maps the connections between all the collaborators of {}'s publications listed on this page.
Each link represents a collaboration on the same publication. The thickness of the link represents the number of collaborations.
Use the mouse wheel or scroll gestures to zoom into the graph.
You can click on the nodes and links to highlight them and move the nodes by dragging them.
Hold down the "Ctrl" key or the "⌘" key while clicking on the nodes to open the list of this person's publications.
Word cloudA word cloud is a visual representation of the most frequently used words in a text or a set of texts. The words appear in different sizes, with the size of each word being proportional to its frequency of occurrence in the text. The more frequently a word is used, the larger it appears in the word cloud. This technique allows for a quick visualization of the most important themes and concepts in a text.
In the context of this page, the word cloud was generated from the publications of the author {}. The words in this cloud come from the titles, abstracts, and keywords of the author's articles and research papers. By analyzing this word cloud, you can get an overview of the most recurring and significant topics and research areas in the author's work.
The word cloud is a useful tool for identifying trends and main themes in a corpus of texts, thus facilitating the understanding and analysis of content in a visual and intuitive way.
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. External link
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. External link
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. External link
Engau, A., Anjos, M. F., & Bomze, I. (2011). An Interior-Point Algorithm with Selective Addition of Inequalities for Solving Doubly Non-Negative Relaxations of Maximum-Stable-Set and Maximum-Clique Problems. (Technical Report n° G-2011-08). External link
Engau, A., & Anjos, M. F. (2011). A Primal-Dual Interior-Point Algorithm for Linear Programming with Selective Addition of Inequalities. (Technical Report n° G-2011-44). External link
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. External link
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. External link
Engau, A., Anjos, M. F., & Vannelli, A. (2009). A Primal-Dual Slack Approach to Warmstarting Interior-Point Methods for Linear Programming. In Operations Research and Cyber-Infrastructure (pp. 195-217). External link
