![]() | Up a level |
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. (1999, October). Cost-based domain filtering [Paper]. 5th International Conference on Principles and Practice of Constraint Programming (CP 1999), Alexandria, Virginia. External link
Lodi, A., Milano, M., & Rousseau, L.-M. (2006). Discrepancy-based additive bounding procedures. INFORMS Journal on Computing, 18(4), 480-493. External link
Lodi, A., Milano, M., & Rousseau, L.-M. (2003, September). Discrepancy Additive Bounding for the All different Constraint [Paper]. 9th International Conference on Principles and Practice of Constraint Programming (CP 2003), Kinsale, Ireland. External link
Zanarini, A., Milano, M., & Pesant, G. (2006, May). Improved algorithm for the soft global cardinality constraint [Paper]. 3rd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2006), Cork, Ireland. External link