 | 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.
Achterberg, T., & Lodi, A. (2011). Hybrid solving techniques. In Hentenryck, P. , & Milano, M. (eds.), Hybrid optimization (Vol. 45, pp. 169-190). External link
Focacci, F., Lodi, A., & Milano, M. (2004). Exploiting relaxations in CP. In Milano, M. (ed.), Constraint and integer programming (Vol. 27, pp. 137-167). External link
Focacci, F., Laburthe, F., & Lodi, A. (2004). Local search and constraint programming: LS and CP illustrated on a transportation problem. In Milano, M. (ed.), Constraint and integer programming (Vol. 27, pp. 293-329). External link
Focacci, F., Lodi, A., & Milano, M. (2002). Embedding relaxations in global constraints for solving TSP and TSPTW. Annals of Mathematics and Artificial Intelligence, 34(4), 291-311. External link
Focacci, F., Lodi, A., & Milano, M. (2002). A hybrid exact algorithm for the TSPTW. INFORMS Journal on Computing, 14(4), 403-417. External link
Focacci, F., Lodi, A., & Milano, M. (2002). Mathematical programming techniques in constraint programming: a short overview. Journal of Heuristics, 8(1), 7-17. External link
Focacci, F., Lodi, A., & Milano, M. (2002). Optimization-oriented global constraints. Constraints, 7(3/4), 351-365. External link
Focacci, F., Lodi, A., & Milano, M. (2000, September). Cutting planes in constraint programming: an hybrid approach [Paper]. 6th International Conference on Principles and Practice of Constraint Programming (CP 2000), Singapore. External link
Focacci, F., Lodi, A., & Milano, M. (1999, January). Integration of CP and OR methods for matching problems [Paper]. 1st International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 1999), Ferrara, Italy. Unavailable
Focacci, F., Lodi, A., Milano, M., & Vigo, D. (1999). An introduction to constraint programming. Ricerca operativa, 91. External link
Focacci, F., Lodi, A., Milano, M., & Vigo, D. (1999). Solving TSP through the integration of OR and CP techniques. Electronic Notes in Discrete Mathematics, 1, 13-25. External link
Focacci, F., Milano, M., & Lodi, A. (1999, November). Solving TSP with time windows with constraints [Paper]. International conference on Logic programming (ICLP 1999), Las Cruces, New Mexico. Unavailable
Kiziltan, Z., Lodi, A., Milano, M., & Parisini, F. (2012). Bounding, filtering and diversification in CP-based local branching. Journal of Heuristics, 18(3), 353-374. External link
Kiziltan, Z., Lodi, A., Milano, M., & Parisini, F. (2007, September). CP-based local branching [Paper]. 13th International Conference on Principles and Practice of Constraint Programming (CP 2007), Providence, RI, United states. External link
