 | Monter d'un niveau |
Borghetti, A., Frangioni, A., Lacalandra, F., Lodi, A., Martello, S., Nucci, C. A., & Trebbi, A. (septembre 2001). Lagrangian relaxation and Tabu Search approaches for the unit commitment problem [Communication écrite]. IEEE Porto Power Tech Conference (PPT 2001), Porto, Portugal. Lien externe
Dell'Amico, M., Lodi, A., & Martello, S. (2001). Efficient algorithms and codes for K-cardinality assignment problems. Discrete Applied Mathematics, 110(1), 25-40. Lien externe
Fischetti, M., Lodi, A., & Toth, P. (2001). A branch-and-cut algorithm for the multiple depot vehicle scheduling problem. (Rapport technique). Non disponible
Fischetti, M., Lodi, A., & Toth, P. (mars 2001). Solving real-world ATSP instances by branch-and-cut [Communication écrite]. 5th International Workshop on Combinatorial Optimization, Aussois, France. Lien externe
Fischetti, M., Lodi, A., Martello, S., & Toth, P. (2001). A polyhedral approach to simplified crew scheduling and vehicle scheduling problems. Management Science, 47(6), 833-850. Lien externe
Focacci, F., Laburthe, F., & Lodi, A. (juillet 2001). Local search and constraint programming [Communication écrite]. 4th Metaheuristics International Conference (MIC 2001), Porto, Portugal. Non disponible
Letchford, A. N., & Lodi, A. (mars 2001). An augment-and-branch-and-cut framework for mixed 0-1 programming [Communication écrite]. 5th International Workshop on Combinatorial Optimization, Aussois, France. Lien externe
Lodi, A., & Monaci, M. (avril 2001). ILP models for the 2-staged cutting stock [Communication écrite]. 3e conférence francophone de modélisation et simulation (MOSIM 2001), Troyes, France. Non disponible
Lodi, A., Martello, S., & Trebbi, A. (2001). A tabu search algorithm for the unit commitment problem. (Rapport technique). Non disponible
