 | 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.
Anjos, M. F., Liers, F., Pardella, G., & Schmutzer, A. (2013). Engineering branch-and-cut algorithms for the equicut problem. In Discrete geometry and optimization (Vol. 69, pp. 17-32). External link
Anjos, M. F., Ghaddar, B., Hupp, L., Liers, F., & Wiegele, A. (2013). Solving k-way graph partitioning problems to optimality : the impact of semidefinite relaxations and the bundle method. In Facets of combinatorial optimization (pp. 355-386). External link
Anjos, M. F., Ghaddar, B., Hupp, L., Liers, F., & Wiegele, A. (2012). Solving k-way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method. (Technical Report n° G-2012-50). External link
Anjos, M. F., Liers, F., Pardella, G., & Schmutzer, A. (2012). Engineering Branch-and-Cut Algorithms for the Equicut Problem. (Technical Report n° G-2012-15). External link
Anjos, M. F., & Liers, F. (2012). Global approaches for facility layout and VLSI floorplanning. In Handbook on semidefinite, conic and polynomial optimization (Vol. 166, pp. 849-875). External link
Álvarez-Miranda, E., Cacchiani, V., Dorneth, T., Jünger, M., Liers, F., Lodi, A., Parriani, T., & Schmidt, D. R. (2012, April). Models and algorithms for robust network design with several traffic scenarios [Paper]. 2nd International Symposium on Combinatorial Optimization (ISCO 2012), Athens, Greece. External link
Anjos, M. F., & Liers, F. (2011). Global Approaches for Facility Layout and VLSI Floorplanning. (Technical Report n° G-2011-34). External link
Cacchiani, V., Jünger, M., Liers, F., Lodi, A., & Schmidt, D. R. (2016). Single-commodity robust network design with finite and Hose demand sets. Mathematical Programming, 157(1), 297-342. External link
Cacchiani, V., Jünger, M., Liers, F., Lodi, A., & Schmidt, D. R. (2015). Single-Commodity robust network design with finite and hose demand sets. (Technical Report). External link
