A. Lodi, On Bilevel Programming and Its Impact in Branching, Cutting and Complexity, in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2011, 2011, 6697, pp. 3 - 3 (atti di: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2011, Berlin, Germany, May 23-27, 2011) [atti di convegno-abstract]
A. Lodi; G. Pesant; L.M. Rousseau, On Counting Lattice Points and Chvatal-Gomory Cutting Planes, in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2011, «LECTURE NOTES IN COMPUTER SCIENCE», 2011, 6697, pp. 131 - 136 (atti di: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - CPAIOR 2011, Berlin, Germany, 23-27 maggio 2011) [Contributo in Atti di convegno]
M. Fischetti; A. Lodi; A. Tramontani, On the Separation of Disjunctive Cuts, «MATHEMATICAL PROGRAMMING», 2011, 128, pp. 205 - 230 [articolo]
Ruolo editoriale nella rivista «Algorithmic Operations Research», SURREY, BC, Preeminent Academic Facets
A. Caprara; A. Lodi; M. Monaci, An Approximation Scheme for Two-Stage, Two- Dimensional Knapsack, «DISCRETE OPTIMIZATION», 2010, 7, pp. 114 - 124 [articolo]
C. Buchheim; A. Caprara; A. Lodi, An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming, in: Integer Programming and Combinatorial Optimization, Heidelberg, Springer, «LECTURE NOTES IN COMPUTER SCIENCE», 2010, pp. 285 - 298 (atti di: 14th International Conference, IPCO 2010, Lausanne, 9-11 giugno 2010) [Contributo in Atti di convegno]
A. Lodi; E. Malaguti; N.E. Stier-Moses, Efficient and Fair Routing for Mesh Networks, «MATHEMATICAL PROGRAMMING», 2010, 124, pp. 285 - 316 [articolo]
C. Cicconetti; L. Lenzini; A. Lodi; S. Martello; E. Mingozzi; M. Monaci, Efficient two-dimensional data allocation in IEEE 802.16 OFDMA, in: INFOCOM'10, Proceedings of the 29th conference on Information communications, PISCATAWAY, NJ, Institute of Electrical and Electronics Engineers, 2010, pp. 2160 - 2168 (atti di: INFOCOM, 2010 Proceedings IEEE., San Diego, California, USA, 15-19 March 2010) [Contributo in Atti di convegno]
S. Dash; O. Gunluk; A. Lodi, Erratum to: MIR closures of polyhedral sets, «MATHEMATICAL PROGRAMMING», 2010, 123, pp. 485 - 486 [articolo]
C. D'Ambrosio; A. Frangioni; L. Liberti; A. Lodi, Experiments with a Feasibility Pump Approach for Non-Convex MINLPs, in: The 9th international symposium on experimental algorithms - SEA2010, «LECTURE NOTES IN COMPUTER SCIENCE», 2010, 6049, pp. 350 - 360 (atti di: 9th International Symposium on Experimental Algorithms - SEA 2010, Ischia, Italy, May 2010) [Contributo in Atti di convegno]
S. Dey; A. Lodi; A. Tramontani; L.A. Wolsey, Experiments With Two Row Tableau Cuts, in: Integer Programming and Combinatorial Optimization - IPCO 2010, «LECTURE NOTES IN COMPUTER SCIENCE», 2010, 6080, pp. 424 - 437 (atti di: Integer Programming and Combinatorial Optimization, IPCO 2010, Lausanne, Switzerland, 9-11 giugno 2010) [Contributo in Atti di convegno]
A. Lodi; M. Milano; P. Toth, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 7th International Conference, CPAIOR 2010, HEIDELBERG, Springer Verlag, 2010, pp. 371 (Lecture Notes in Computer Science, Vol. 6140). [curatela]
S. Dash; O. Gunluk; A. Lodi, MIR closure of polyhedral sets, «MATHEMATICAL PROGRAMMING», 2010, 121, pp. 33 - 60 [articolo]
C. D'Ambrosio; A. Frangioni; L. Liberti; A. Lodi, On interval-subgradient and no-good cuts, «OPERATIONS RESEARCH LETTERS», 2010, 38, pp. 341 - 345 [articolo]
Ruolo editoriale nella rivista «Optima», PHILADELPHIA, PA, Mathematical Programming Society
