Répertoire des expertises

Vous êtes ici

Publications par type

Andrea Lodi (291)

  • Articles de revue (131)
    • 2021
      • Article de revue
        Dan, T., Lodi, A. & Marcotte, P. (2021). An exact algorithmic framework for a class of mixed-integer programs with equilibrium constraints. SIAM Journal on Optimization, 31(1), 275-306. Tiré de https://doi.org/10.1137/18M1208769
      • Article de revue
        Anjos, M.F., Emine, Y., Lodi, A. & Sun, Z. (2021). A note on the Lasserre hierarchy for different formulations of the maximum independent set problem. Operations Research Letters, 49(1), 30-34. Tiré de https://doi.org/10.1016/j.orl.2020.10.009
      • Article de revue
        Rostami, B., Desaulniers, G., Errico, F. & Lodi, A. (2021). Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times. Operations Research, 69(2), 436-455. Tiré de https://doi.org/10.1287/opre.2020.2037
      • Article de revue
        Costa, L.R., Aloise, D., Gianoli, L.G. & Lodi, A. (2021). Heuristics for optimizing 3D mapping missions over swarm-powered ad-hoc clouds. Cahiers du Gerad, 2021(09), 33 pages. Tiré de https://www.gerad.ca/fr/papers/G-2021-09
      • Article de revue
        Morabit, M., Desaulniers, G. & Lodi, A. (2021). Machine-Learning-Based Column Selection for Column Generation. Transportation Science, 55(4), 815-831. Tiré de https://doi.org/10.1287/trsc.2021.1045
      • Article de revue
        Bengio, Y., Lodi, A. & Prouvost, A. (2021). Machine learning for combinatorial optimization: A methodological tour d'horizon. European Journal of Operational Research, 290(2), 405-421. Tiré de https://doi.org/10.1016/j.ejor.2020.07.063
      • Article de revue
        Baggio, A., Carvalho, M., Lodi, A. & Tramontani, A. (2021). Multilevel Approaches for the Critical Node Problem. Operations Research, 69(2), 486-508. Tiré de https://doi.org/10.1287/opre.2020.2014
      • Article de revue
        Muller, B., Munoz, G., Gasse, M., Gleixner, A., Lodi, A. & Serrano, F. (2021). On generalized surrogate duality in mixed-integer nonlinear programming. Mathematical Programming, 30 pages. Tiré de https://doi.org/10.1007/s10107-021-01691-6
      • Article de revue
        Bonvin, G., Demassey, S. & Lodi, A. (2021). Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound. Optimization and Engineering, 39 pages. Tiré de https://doi.org/10.1007/s11081-020-09575-y
      • Article de revue
        Costa, L.R., Aloise, D., Gianoli, L.G. & Lodi, A. (2021). The Covering-Assignment Problem for Swarm-powered Ad-hoc Clouds: A Distributed 3D Mapping Use-case. IEEE Internet of Things Journal, 8(9), 7316-7332. Tiré de https://doi.org/10.1109/JIOT.2020.3039261
      • Article de revue
        Olivier, P., Lodi, A. & Pesant, G. (2021). The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints. INFORMS Journal on Computing, 33(3), 949-962. Tiré de https://doi.org/10.1287/ijoc.2020.0983
    • 2020
      • Article de revue
        Mai, T. & Lodi, A. (2020). A multicut outer-approximation approach for competitive facility location under random utilities. European Journal of Operational Research, 284(3), 874-881. Tiré de https://doi.org/10.1016/j.ejor.2020.01.020
      • Article de revue
        Shen, R., Tang, B., Lodi, A., Tramontani, A. & Ayed, I.B. (2020). An ILP Model for Multi-Label MRFs with Connectivity Constraints. IEEE Transactions on Image Processing, 29, 6909-6917. Tiré de https://doi.org/10.1109/TIP.2020.2995056
      • Article de revue
        González, J.E., Cire, A.A., Lodi, A. & Rousseau, L.-M. (2020). BDD-based optimization for the quadratic stable set problem. Discrete Optimization, 24 pages. Tiré de https://doi.org/10.1016/j.disopt.2020.100610
      • Article de revue
        González, J.E., Cire, A.A., Lodi, A. & Rousseau, L.-M. (2020). Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem. Constraints, 25(1-2), 23-46. Tiré de https://doi.org/10.1007/s10601-019-09306-w
      • Article de revue
        Dan, T., Lodi, A. & Marcotte, P. (2020). Joint location and pricing within a user-optimized environment. EURO Journal on Computational Optimization, 8(1), 61-84. Tiré de https://doi.org/10.1007/s13675-019-00120-w
      • Article de revue
        Lodi, A., Mossina, L. & Rachelson, E. (2020). Learning to handle parameter perturbations in Combinatorial Optimization: An application to facility location. Euro Journal on Transportation and Logistics, 9(4), 13 pages. Tiré de https://doi.org/10.1016/j.ejtl.2020.100023
      • Article de revue
        Lotfi, S., Bonniot de Ruisselet, T., Orban, D. & Lodi, A. (2020). Stochastic Damped L-BFGS with Controlled Norm of the Hessian Approximation. Cahier du Gerad, 2020(52), 15.
      • Article de revue
        Gmira, M., Gendreau, M., Lodi, A. & Potvin, J.-Y. (2020). Tabu search for the time-dependent vehicle routing problem with time windows on a road network. European Journal of Operational Research, 288(1), 129-140. Tiré de https://doi.org/10.1016/j.ejor.2020.05.041
      • Article de revue
        Costa, L.R., Aloise, D., Gianoli, L.G. & Lodi, A. (2020). The covering-assignment problem for swarm-powered ad-hoc clouds : a distributed 3D mapping use-case. Cahiers du Gerad, 2020(28), 30 pages. Tiré de https://www.gerad.ca/en/papers/G-2020-28
      • Article de revue
        Gmira, M., Gendreau, M., Lodi, A. & Potvin, J.-Y. (2020). Travel speed prediction based on learning methods for home delivery. EURO Journal on Transportation and Logistics, 9(4), 16 pages. Tiré de https://doi.org/10.1016/j.ejtl.2020.100006
    • 2019
      • Article de revue
        Anjos, M.F., Lodi, A. & Tanneau, M. (2019). A decentralized framework for the optimal coordination of distributed energy resources. IEEE Transactions on Power Systems, 34(1), 349-359. Tiré de https://doi.org/10.1109/TPWRS.2018.2867476
      • Article de revue
        Lodi, A., Tanneau, M. & Vielma, J.P. (2019). Disjunctive cuts for mixed-integer conic optimization. Cahiers du Gerad, 2019(92), 40 pages. Tiré de https://www.gerad.ca/en/papers/G-2019-92
      • Article de revue
        Lodi, A., Malaguti, E., Nannicini, G. & Thomopulos, D. (2019). Nonlinear chance-constrained problems with applications to hydro scheduling. Mathematical Programming, 40 pages. Tiré de https://doi.org/10.1007/s10107-019-01447-3
      • Article de revue
        Furini, F., Traversi, E., Belotti, P., Frangioni, A., Gleixner, A., Gould, N., Liberti, L., Lodi, A., Misener, R., Mittelmann, H., Sahinidis, N.V., Vigerske, S. & Wiegele, A. (2019). QPLIB: a library of quadratic programming instances. Mathematical Programming Computation, 11(2), 237-265. Tiré de https://doi.org/10.1007/s12532-018-0147-4
      • Article de revue
        Bonami, P., Lodi, A., Schweiger, J. & Tramontani, A. (2019). Solving quadratic programming by cutting planes. SIAM Journal on Optimization, 29(2), 1076-1105. Tiré de https://doi.org/10.1137/16M107428X
      • Article de revue
        Berthold, T., Lodi, A. & Salvagnin, D. (2019). Ten years of feasibility pump, and counting. Euro Journal on Computational Optimization, 7(1), 14 pages. Tiré de https://doi.org/10.1007/s13675-018-0109-7
    • 2018
      • Article de revue
        Carvalho, M., Lodi, A. & Marcotte, P. (2018). A polynomial algorithm for a continuous bilevel knapsack problem. Operations Research Letters, 46(2), 185-188. Tiré de https://doi.org/10.1016/j.orl.2017.12.009
      • Article de revue
        Gambella, C., Lodi, A. & Vigo, D. (2018). Exact solutions for the carrier-vehicle traveling salesman problem. Transportation Science, 52(2), 320-330. Tiré de https://doi.org/10.1287/trsc.2017.0771
      • Article de revue
        Lodi, A. & Moradi, A. (2018). Experiments on virtual private network design with concave capacity costs. Optimization Letters, 12(5), 945-957. Tiré de https://doi.org/10.1007/s11590-018-1254-x
      • Article de revue
        Abrignani, M.D., Giupponi, L., Lodi, A. & Verdone, R. (2018). Scheduling M2M traffic over LTE uplink of a dense small cell network. EURASIP Journal on Wireless Communications and Networking, 2018, 21 pages. Tiré de https://doi.org/10.1186/s13638-018-1206-2
    • 2017
    • 2016
      • Article de revue
        Caprara, A., Carvalho, M., Lodi, A. & Woeginger, G.J. (2016). Bilevel knapsack with interdiction constraints. INFORMS Journal on Computing, 28(2), 319-333. Tiré de https://doi.org/10.1287/ijoc.2015.0676
      • Article de revue
        Lodi, A., Malaguti, E., Stier-Moses, N.E. & Bonino, T. (2016). Design and control of public-service contracts and an application to public transportation systems. Management science, 62(4), 1165-1187. Tiré de https://doi.org/10.1287/mnsc.2015.2174
      • Article de revue
        Fischetti, M., Lodi, A., Monaci, M., Salvagnin, D. & Tramontani, A. (2016). Improving branch-and-cut performance by random sampling. Mathematical Programming Computation, 8(1), 113-132. Tiré de https://doi.org/10.1007/s12532-015-0096-0
      • Article de revue
        Carvalho, M., Lodi, A., Pedroso, J.P. & Viana, A. (2016). Nash equilibria in the two-player kidney exchange game. Mathematical Programming, 161(1-2), 389-417. Tiré de https://doi.org/10.1007/s10107-016-1013-7
      • Article de revue
        Lodi, A., Tubertini, P., Grilli, R., Mazzocchetti, A., Ruozi, C. & Senese, F. (2016). Needs forecast and fund allocation of medical specialty positions in Emilia-Romagna (Italy) by system dynamics and integer programming. Health Systems, 5(3), 213-236. Tiré de https://doi.org/10.1057/hs.2015.11
      • Article de revue
        Belotti, P., Bonami, P., Fischetti, M., Lodi, A., Monaci, M., Nogales-Gomez, A. & Salvagnin, D. (2016). On handling indicator constraints in mixed integer programming. Computational Optimization and Applications, 65(3), 545-566. Tiré de https://doi.org/10.1007/s10589-016-9847-8
      • Article de revue
        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. Tiré de https://doi.org/10.1007/s10107-016-0991-9
    • 2015
      • Article de revue
        D'Ambrosio, C., Lodi, A., Wiese, S. & Bragalli, C. (2015). Erratum: Mathematical programming techniques in water network optimization. European Journal of Operational Research, 245(1), 338. Tiré de https://doi.org/10.1016/j.ejor.2015.03.028
      • Article de revue
        Senese, F., Tubertini, P., Mazzocchetti, A., Lodi, A., Ruozi, C. & Grilli, R. (2015). Forecasting future needs and optimal allocation of medical residency positions: the Emilia-Romagna Region case study. Human Resources for Health, 13, 10 pages. Tiré de https://doi.org/10.1186/1478-4491-13-7
      • Article de revue
        D'Ambrosio, C., Lodi, A., Wiese, S. & Bragalli, C. (2015). Mathematical programming techniques in water network optimization. European Journal of Operational Research, 243(3), 774-788. Tiré de https://doi.org/10.1016/j.ejor.2014.12.039
      • Article de revue
        Bonami, P., Lodi, A., Tramontani, A. & Wiese, S. (2015). On mathematical programming with indicator constraints. Mathematical Programming, 151(1), 191-223. Tiré de https://doi.org/10.1007/s10107-015-0891-4
      • Article de revue
        Lodi, A., Monaci, M. & Pietrobuoni, E. (2015). Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints. Discrete Applied Mathematics, 217, 40-47. Tiré de https://doi.org/10.1016/j.dam.2015.09.012
      • Article de revue
        Moradi, A., Lodi, A. & Mehdi Hashemi, S. (2015). Virtual private network design over the first Chvatal closure. RAIRO: Operations Research, 49(3), 569-588. Tiré de https://doi.org/10.1051/ro/2014056
    • 2014
      • Article de revue
        Caprara, A., Carvalho, M., Lodi, A. & Woeginger, G.J. (2014). A study on the computational complexity of the bilevel knapsack problem. SIAM Journal on optimization, 24(2), 823-838. Tiré de https://doi.org/10.1137/130906593
      • Article de revue
        Lodi, A., Ralphs, T.K. & Woeginger, G.J. (2014). Bilevel programming and the separation problem. Mathematical Programming, 146(1-2), 437-458. Tiré de https://doi.org/10.1007/s10107-013-0700-x
      • Article de revue
        Cicconetti, C., Lenzini, L., Lodi, A., Martello, S., Mingozzi, E. & Monaci, M. (2014). Efficient two-dimensional data allocation in IEEE 802.16 OFDMA. IEEE/ACM Transactions on Networking, 22(5), 1645-1658. Tiré de https://doi.org/10.1109/TNET.2013.2282965
      • Article de revue
        Caprara, A., Furini, F., Lodi, A., Mangia, M., Rovatti, R. & Setti, G. (2014). Generation of antipodal random vectors with prescribed non-stationary 2-nd order statistics. IEEE Transactions on Signal Processing, 62(6), 1603-1612. Tiré de https://doi.org/10.1109/TSP.2014.2302737
      • Article de revue
        Moradi, A., Lodi, A. & Hashemi, S.M. (2014). On the difficulty of virtual private network instances. Networks, 63(4), 327-333. Tiré de https://doi.org/10.1002/net.21548
      • Article de revue
        Dey, S.S., Lodi, A., Tramontani, A. & Wolsey, L.A. (2014). On the practical strength of two-row tableau cuts. INFORMS Journal on Computing, 26(2), 222-237. Tiré de https://doi.org/10.1287/ijoc.2013.0559
      • Article de revue
        Rovatti, R., D'Ambrosio, C., Lodi, A. & Martello, S. (2014). Optimistic MILP modeling of non-linear optimization problems. European Journal of Operational Research, 239(1), 32-45. Tiré de https://doi.org/10.1016/j.ejor.2014.03.020
      • Article de revue
        Alvarez-Miranda, E., Cacchiani, V., Lodi, A., Parriani, T. & Schmidt, D.R. (2014). Single-commodity robust network design problem: complexity, instances and heuristic solutions. European Journal of Operational Research, 238(3), 711-723. Tiré de https://doi.org/10.1016/j.ejor.2014.04.023
    • 2013
      • Article de revue
        Bansal, N., Fischetti, M., Lancia, G., Letchford, A.N., Lodi, A., Monaci, M., Pferschy, U., Pisinger, D., Salazar-González, J.-J., Sviridenko, M. & Toth, P. (2013). Alberto Caprara (1968-2012): scientific contributions. Optima, (91), 1-11. Tiré de http://www.mathopt.org/Optima-Issues/optima91.pdf
      • Article de revue
        Lodi, A., Malaguti, E., Stier-Moses, N.E. & Bonino, T. (2013). Design and control of public-service contracts and an application to public transportation systems. SSRN Electronic Journal, 36 pages. Tiré de https://doi.org/10.2139/ssrn.2298382
      • Article de revue
        D'Ambrosio, C. & Lodi, A. (2013). Mixed integer nonlinear programming tools: an updated practical overview. Annals of Operations Research, 204(1), 301-320. Tiré de https://doi.org/10.1007/s10479-012-1272-5
    • 2012
      • Article de revue
        Buchheim, C., Caprara, A. & Lodi, A. (2012). An effective branch-and-bound algorithm for convex quadratic integer programming. Mathematical Programming, 135(1-2), 369-395. Tiré de https://doi.org/10.1007/s10107-011-0475-x
      • Article de revue
        Dash, S., Gunluk, O., Lodi, A. & Tramontani, A. (2012). A time bucket formulation for the traveling salesman problem with time windows. INFORMS Journal on Computing, 24(1), 132-147. Tiré de https://doi.org/10.1287/ijoc.1100.0432
      • Article de revue
        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. Tiré de https://doi.org/10.1007/s10732-011-9190-2
      • Article de revue
        Hurkens, C.A.J., Lodi, A., Martello, S., Monaci, M. & Woeginger, G.J. (2012). Complexity and approximation of an area packing problem. Optimization Letters, 6(1), 1-9. Tiré de https://doi.org/10.1007/s11590-010-0246-2
      • Article de revue
        Dolatabadi, M., Lodi, A. & Monaci, M. (2012). Exact algorithms for the two-dimensional guillotine knapsack. Computers and Operations Research, 39(1), 48-53. Tiré de https://doi.org/10.1016/j.cor.2010.12.018
      • Article de revue
        Bragalli, C., D'Ambrosio, C., Lee, J., Lodi, A. & Toth, P. (2012). On the optimal design of water distribution networks: a practical MINLP approach. Optimization and Engineering, 13(2), 219-246. Tiré de https://doi.org/10.1007/s11081-011-9141-7
    • 2011
      • Article de revue
        Cicconetti, C., Lenzini, L., Lodi, A., Martello, S., Mingozzi, E. & Monaci, M. (2011). A fast and efficient algorithm to exploit multi-user diversity in IEEE 802.16 BandAMC. Computer Networks, 55(16), 3680-3693. Tiré de https://doi.org/10.1016/j.comnet.2011.05.028
      • Article de revue
        Fortini, M., Letchford, A.N., Lodi, A. & Wenger, K.M. (2011). Computing compatible tours for the symmetric traveling salesman problem. Mathematical Programming Computation, 3(1), 59-78. Tiré de https://doi.org/10.1007/s12532-010-0021-5
      • Article de revue
        Lodi, A., Martello, S., Monaci, M., Cicconetti, C., Lenzini, L., Mingozzi, E., Eklund, C. & Moilanen, J. (2011). Efficient two-dimensional packing algorithms for mobile WiMAX. Management Science, 57(12), 2130-2144. Tiré de https://doi.org/10.1287/mnsc.1110.1416
      • Article de revue
        Dolatabadi, M., Lodi, A. & Afsharnejad, Z. (2011). Improving spectral bounds for clustering problems by Lagrangian relaxation. International Transactions in Operational Research, 18(6), 647-661. Tiré de https://doi.org/10.1111/j.1475-3995.2011.00825.x
      • Article de revue
        Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E. & Wolter, K. (2011). MIPLIB 2010: Mixed integer programming library version 5. Mathematical Programming Computation, 3(2), 103-163. Tiré de https://doi.org/10.1007/s12532-011-0025-9
    • 2010
      • Article de revue
        Caprara, A., Lodi, A. & Monaci, M. (2010). An approximation scheme for the two-stage, two-dimensional knapsack problem. Discrete Optimization, 7(3), 114-124. Tiré de https://doi.org/10.1016/j.disopt.2010.03.003
      • Article de revue
        Lodi, A., Malaguti, E. & Stier-Moses, N.E. (2010). Efficient and fair routing for mesh networks. Mathematical Programming, 124(1-2), 285-316. Tiré de https://doi.org/10.1007/s10107-010-0356-8
      • Article de revue
        D'Ambrosio, C., Frangioni, A., Liberti, L. & Lodi, A. (2010). On interval-subgradient and no-good cuts. Operations Research Letters, 38(5), 341-345. Tiré de https://doi.org/10.1016/j.orl.2010.05.010
      • Article de revue
        Fischetti, M. & Lodi, A. (2010). On the knapsack closure of 0-1 integer linear programs. Electronic Notes in Discrete Mathematics, 36, 799-804. Tiré de https://doi.org/10.1016/j.endm.2010.05.101
      • Article de revue
        D'Ambrosio, C., Lodi, A. & Martello, S. (2010). Piecewise linear approximation of functions of two variables in MILP models. Operations Research Letters, 38(1), 39-46. Tiré de https://doi.org/10.1016/j.orl.2009.09.005
    • 2009
      • Article de revue
        Bonami, P., Cornuejols, G., Lodi, A. & Margot, F. (2009). A feasibility pump for mixed integer nonlinear programs. Mathematical Programming, 119(2), 331-352. Tiré de https://doi.org/10.1007/s10107-008-0212-2
    • 2008
      • Article de revue
        Bonami, P., Biegler, L.T., Conn, A.R., Cornuejols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N. & Wachter, A. (2008). An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization, 5(2), 186-204. Tiré de https://doi.org/10.1016/j.disopt.2006.10.011
      • Article de revue
        Borghetti, A., D'Ambrosio, C., Lodi, A. & Martello, S. (2008). An MILP approach for short-term hydro scheduling and unit commitment with head-dependent reservoir. IEEE Transactions on Power Systems, 23(3), 1115-1124. Tiré de https://doi.org/10.1109/TPWRS.2008.926704
      • Article de revue
        Levi, R., Lodi, A. & Sviridenko, M. (2008). Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities. Mathematics of Operations Research, 33(2), 461-474. Tiré de https://doi.org/10.1287/moor.1070.0305
      • Article de revue
        Bonami, P., Cornuejols, G., Dash, S., Fischetti, M. & Lodi, A. (2008). Projected Chvatal-Gomory cuts for mixed integer linear programs. Mathematical Programming, 113(2), 241-257. Tiré de https://doi.org/10.1007/s10107-006-0051-y
      • Article de revue
        Fischetti, M. & Lodi, A. (2008). Repairing MIP infeasibility through local branching. Computers and Operations Research, 35(5), 1436-1445. Tiré de https://doi.org/10.1016/j.cor.2006.08.004
    • 2007
    • 2006
      • Article de revue
        Campi, F., Castello, R., Cesura, G., Guerrieri, R., Lavagno, L., Lodi, A., Malcovati, P. & Toma, M. (2006). Baseband analog front-end and digital back-end for reconfigurable multi-standard terminals. IEEE Circuits and Systems Magazine, 6(1), 8-26. Tiré de https://doi.org/10.1109/MCAS.2006.1607635
      • Article de revue
        Lodi, A., Milano, M. & Rousseau, L.-M. (2006). Discrepancy-based additive bounding procedures. INFORMS Journal on Computing, 18(4), 480-493. Tiré de https://doi.org/10.1287/ijoc.1050.0168
      • Article de revue
        Caprara, A., Lodi, A., Martello, S. & Monaci, M. (2006). Packing into the smallest square: worst-case analysis of lower bounds. Discrete Optimization, 3(4), 317-326. Tiré de https://doi.org/10.1016/j.disopt.2006.06.001
      • Article de revue
        Fleischer, L.K., Letchford, A.N. & Lodi, A. (2006). Polynomial-time separation of a superclass of simple comb inequalities. Mathematics of Operations Research, 31(4), 696-713. Tiré de https://doi.org/10.1287/moor.1060.0214
    • 2005
      • Article de revue
        Caprara, A., Lodi, A. & Monaci, M. (2005). Fast approximation schemes for two-stage, two-dimensional bin packing. Mathematics of Operations Research, 30(1), 150-172. Tiré de https://doi.org/10.1287/moor.1040.0112
      • Article de revue
        Feremans, C., Lodi, A., Toth, P. & Tramotani, A. (2005). Improving on branch-and-cut algorithms for generalized minimum spanning trees. Pacific Journal of Optimization, 1(3), 491-508. Tiré de http://www.ybook.co.jp/online2/oppjo/vol1/p491.html
      • Article de revue
        Frangioni, A., Lodi, A. & Rinaldi, G. (2005). New approaches for optimizing over the semimetric polytope. Mathematical Programming, 104(2-3), 375-388. Tiré de https://doi.org/10.1007/s10107-005-0620-5
    • 2004
    • 2003
      • Article de revue
        Lodi, A., Toma, M., Campi, F., Cappelli, A., Canegallo, R. & Guerrieri, R. (2003). A VLIW processor with reconfigurable instruction set for embedded applications. IEEE Journal of Solid-State Circuits, 38(11), 1876-1886. Tiré de https://doi.org/10.1109/JSSC.2003.818292
      • Article de revue
        Lodi, A., Ciccarelli, L., Cappelli, A., Campi, F. & Toma, M. (2003). Decoder-based interconnect structure for multi-context FPGAs. Electronics Letters, 39(4), 362-364. Tiré de https://doi.org/10.1049/el:20030204
      • Article de revue
        Lodi, A. & Monaci, M. (2003). Integer linear programming models for 2-staged two-dimensional Knapsack problems. Mathematical Programming, 94(2-3), 257-278. Tiré de https://doi.org/10.1007/s10107-002-0319-9
    • 2002
      • Article de revue
        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. Tiré de https://doi.org/10.1023/a:1014492408220
      • Article de revue
        Lodi, A., Martello, S. & Vigo, D. (2002). Heuristic algorithms for the three-dimensional bin packing problem. European Journal of Operational Research, 141(2), 410-420. Tiré de https://doi.org/10.1016/S0377-2217(02)00134-0
      • Article de revue
        Focacci, F., Lodi, A. & Milano, M. (2002). Mathematical programming techniques in constraint programming: a short overview. Journal of Heuristics, 8(1), 7-17. Tiré de https://doi.org/10.1023/A:1013653332557
      • Article de revue
        Lodi, A. (2002). Multi-dimensional packing by Tabu search. Studia informatica universalis, 2(1), 107-122.
      • Article de revue
        Letchford, A.N. & Lodi, A. (2002). Primal cutting plane algorithms revisited. Mathematical Methods of Operations Research, 56(1), 67-81. Tiré de https://doi.org/10.1007/s001860200200
    • 2001
      • Article de revue
        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. Tiré de https://doi.org/10.1287/mnsc.47.6.833.9810
      • Article de revue
        Dell'Amico, M., Lodi, A. & Martello, S. (2001). Efficient algorithms and codes for K-cardinality assignment problems. Discrete Applied Mathematics, 110(1), 25-40. Tiré de https://doi.org/10.1016/S0166-218X(00)00301-2
    • 2000
      • Article de revue
        Lodi, A., Vigo, D. & Zannoni, C. (2000). Exact and heuristic algorithms for data sets reconstruction. European Journal of Operational Research, 124(1), 139-150. Tiré de https://doi.org/10.1016/S0377-2217(99)00124-1
    • 1999
      • Article de revue
        Lodi, A., Allemand, K. & Liebling, T.M. (1999). An evolutionary heuristic for quadratic 0-1 programming. European Journal of Operational Research, 119(3), 662-670. Tiré de https://doi.org/10.1016/s0377-2217(98)00359-2
      • Article de revue
        Lodi, A., Martello, S. & Vigo, D. (1999). Approximation algorithms for the oriented two-dimensional bin packing problem. European Journal of Operational Research, 112(1), 158-166. Tiré de https://doi.org/10.1016/s0377-2217(97)00388-3
      • Article de revue
        Lodi, A., Martello, S. & Vigo, D. (1999). Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing, 11(4), 345-357. Tiré de https://doi.org/10.1287/ijoc.11.4.345
      • Article de revue
        Dell'Amico, M., Lodi, A. & Maffioli, F. (1999). Solution of the cumulative assignment problem with a well-structured Tabu Search method. Journal of Heuristics, 5(2), 123-143. Tiré de https://doi.org/10.1023/A:1009647225748
      • Article de revue
        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. Tiré de https://doi.org/10.1016/S1571-0653(04)00002-2
  • Communications de conférence (93)
    • 2021
      • Communication de conférence
        Zarpellon, G., Jo, J., Lodi, A. & Bengio, Y. (2021). Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies. Communication présentée à 35th AAAI Conference on Artificial Intelligence / 33rd Conference on Innovative Applications of Artificial Intelligence / 11th Symposium on Educational Advances in Artificial Intelligence (p. 3931-3939).
      • Communication de conférence
        Neal, C., Dagdougui, H., Lodi, A. & Fernandez, J.M. (2021). Reinforcement Learning Based Penetration Testing of a Microgrid Control Algorithm. Communication présentée à 11th IEEE Annual Computing and Communication Workshop and Conference (CCWC 2021), Nevada, USA (p. 38-44). Tiré de https://doi.org/10.1109/CCWC51732.2021.9376126
    • 2020
      • Communication de conférence
        Farhadi, F., Nia, V.P. & Lodi, A. (2020). Activation adaptation in neural networks. Communication présentée à 9th International Conference on Pattern Recognition Applications and Methods (ICPRAM 2020), Valletta, Malta (p. 249-257).
      • Communication de conférence
        Prouvost, A., Lodi, A., Rousseau, L.-M. & Vallee, J. (2020). Adverse Event Prediction by Telemonitoring and Deep Learning. Communication présentée à 4th International Conference on Health Care Systems Engineering (HCSE 2019), Montréal, QC, Canada (p. 205-215). Tiré de https://doi.org/10.1007/978-3-030-39694-7_16
      • Communication de conférence
        Bengio, Y., Frejinger, E., Lodi, A., Patel, R. & Sankaranarayanan, S. (2020). A Learning-Based Algorithm to Quickly Compute Good Primal Solutions for Stochastic Integer Programs. Communication présentée à 17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research. (CPAIOR 2020), Vienna, Austria (p. 99-111). Tiré de https://doi.org/10.1007/978-3-030-58942-4_7
      • Communication de conférence
        Neal, C., Al Mallah, R., Fernandez, J. & Lodi, A. (2020). Analyzing the Resiliency of Microgrid Control Algorithms Against Malicious Input. Communication présentée à 2020 IEEE Canadian Conference on Electrical and Computer Engineering (CCECE 2020), London, ON, Canada (6 pages). Tiré de https://doi.org/10.1109/CCECE47787.2020.9255704
      • Communication de conférence
        Muller, B., Munoz, G., Gasse, M., Gleixner, A., Lodi, A. & Serrano, F. (2020). On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming. Communication présentée à 21st International Conference on Integer Programming and Combinatorial Optimization (IPCO 2020), London, United Kingdom (p. 322-337). Tiré de https://doi.org/10.1007/978-3-030-45771-6_25
    • 2019
      • Communication de conférence
        Lodi, A. & Nagarajan, V. (2019). Intersection Cuts for Polynomial Optimization. Communication présentée à 20th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2019), Ann Arbor, MI (p. 72-87). Tiré de https://doi.org/10.1007/978-3-030-17953-3_6
      • Communication de conférence
        Fischetti, M., Lodi, A. & Zarpellon, G. (2019). Learning MILP Resolution Outcomes Before Reaching Time-Limit. Communication présentée à 16th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2019), Thessaloniki, Greece (p. 275-291). Tiré de https://doi.org/10.1007/978-3-030-19212-9_18
      • Communication de conférence
        Coste, P., Lodi, A. & Pesant, G. (2019). Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems. Communication présentée à 16th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2019), Thessaloniki, Greece (p. 182-191). Tiré de https://doi.org/10.1007/978-3-030-19212-9_12
    • 2018
      • Communication de conférence
        Olivier, P., Lodi, A. & Pesant, G. (2018). A comparison of optimization methods for multi-objective constrained bin packing problems. Communication présentée à 15th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2018), Delft, Netherlands (p. 462-476). Tiré de https://doi.org/10.1007/978-3-319-93031-2_33
      • Communication de conférence
        Bonami, P., Lodi, A. & Zarpellon, G. (2018). Learning a classification of mixed-integer quadratic programming problems. Communication présentée à 15th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2018), Delft, Netherlands (p. 595-604). Tiré de https://doi.org/10.1007/978-3-319-93031-2_43
    • 2017
      • Communication de conférence
        Bonami, P., Lodi, A., Tramontani, A. & Wiese, S. (2017). Cutting planes from wide split disjunctions. Communication présentée à 19th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2017), Waterloo, ON (p. 99-110). Tiré de https://doi.org/10.1007/978-3-319-59250-3_9
      • Communication de conférence
        Carvalho, M., Lodi, A. & Pedroso, J.P. (2017). Existence of Nash equilibria on integer programming games. Communication présentée à 18th Congress of the Portuguese Operational Research Society (APDIO), Valença, Portugal (p. 11-23). Tiré de https://doi.org/10.1007/978-3-319-71583-4_2
      • Communication de conférence
        Gmira, M., Gendreau, M., Lodi, A. & Potvin, J.-Y. (2017). Travel speed prediction using machine learning techniques. Communication présentée à ITS World Congress, Montréal, Québec (10 pages).
    • 2016
      • Communication de conférence
        Lodi, A., Malaguti, E., Thomopulos, D. & Nannicini, G. (2016). Nonlinear Chance-Constrained Problems with applications to Hydro Scheduling. Communication présentée à CORE@50 Conference, Louvain-la-Neuve, Belgique.
    • 2015
      • Communication de conférence
        Rosat, S., El Hallaoui, I., Soumis, F. & Lodi, A. (2015). Integral simplex using decomposition with primal cutting planes [Affiche]. Présenté à Mixed Integer Programming Workshop, Chicago, IL.
      • Communication de conférence
        Abrignani, M.D., Giupponi, L., Lodi, A. & Verdone, R. (2015). Scheduling M2M traffic over LTE uplink of a dense small cells network. Communication présentée à International Symposium on Wireless Communication Systems (ISWCS 2015), Brussels, Belgium. Tiré de https://doi.org/10.1109/ISWCS.2015.7454453
    • 2014
      • Communication de conférence
        Tubertini, P., Leo, G. & Lodi, A. (2014). Emergency room management in Lazio, Italy. Communication présentée à 44th Annual Conference of the Italian Operational Research Society (AIRO 2014), Como, Italy.
      • Communication de conférence
        Bonino, T., Amadori, M., Nelson, J., Ambrosino, G. & Lodi, A. (2014). Eu Project EPTA-Model for European public transport authority as a key factor to transport sustainability. The case of Bologna. Communication présentée à Transport Research Arena (TRA 2014), Paris, France.
      • Communication de conférence
        Rosat, I., El Hallaoui, I., Soumis, F. & Lodi, A. (2014). Integral simplex using decomposition with primal cuts. Communication présentée à 13th International Symposium on Experimental Algorithms (SEA 2014), Copenhagen, Denmark (p. 22-23). Tiré de https://doi.org/10.1007/978-3-319-07959-2_3
      • Communication de conférence
        Rudi, A., Bartolini, A., Lodi, A. & Benini, L. (2014). Optimum: Thermal-aware task allocation for heterogeneous many-core devices. Communication présentée à International Conference on High Performance Computing and Simulation (HPCS 2014), Bologna, Italy (p. 82-87). Tiré de https://doi.org/10.1109/HPCSim.2014.6903672
      • Communication de conférence
        Lodi, A. (2014). Plenière: Problem-solving by mixed-integer programming. Communication présentée à 15e Congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision (ROADEF 2014), Bordeaux, France.
      • Communication de conférence
        Wiese, S., Humpola, J. & Lodi, A. (2014). Recent progress in nonlinear network design with applications to water networks. Communication présentée à 44th Annual Conference of the Italian Operational Research Society (AIRO 2014), Como, Italy (p. 24).
      • Communication de conférence
        Bliek, C., Bonami, P. & Lodi, A. (2014). Solving mixed-integer quadratic programming problems with IBM-CPLEX: a progress report. Communication présentée à 26th RAMP Symposium, Tokyo, Japan. Tiré de http://www.orsj.or.jp/ramp/2014/paper/4-3.pdf
      • Communication de conférence
        Lodi, A., Tubertini, P., Grilli, R. & Senese, F. (2014). Tactical versus operational discrete event simulation: a breast screening case study. Communication présentée à 28th European Conference on Modelling and Simulation (ECMS 2014), Brescia, Italy (p. 796-802). Tiré de https://doi.org/10.7148/2014-0796
    • 2013
      • Communication de conférence
        Caprara, A., Carvalho, M., Lodi, A. & Woeginger, G.J. (2013). A complexity and approximability study of the bilevel knapsack problem. Communication présentée à 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013), Valparaiso, Chile (p. 98-109). Tiré de https://doi.org/10.1007/978-3-642-36694-9_9
    • 2012
      • Communication de conférence
        D'Ambrosio, C., Frangioni, A., Liberti, L. & Lodi, A. (2012). A storm of feasibility pumps for nonconvex MINLP. Communication présentée à European Workshop on Mixed Integer Nonlinear Program-ming (EWMINLP 2010), Marseille, France. (Publié dans Mathematical Programming, 136(2), 375-402). Tiré de https://doi.org/10.1007/s10107-012-0608-x
      • Communication de conférence
        D'Ambrosio, C., Frangioni, A., Liberti, L. & Lodi, A. (2012). Extending feasibility pump to nonconvex mixed integer nonlinear programming problems. Communication présentée à 13ème Congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision (ROADEF 2012), Angers, France.
      • Communication de conférence
        D'Ambrosio, C., Frangioni, A., Liberti, L. & Lodi, A. (2012). Feasibility pump algorithms for nonconvex mixed integer nonlinear programming problems. Communication présentée à International Conference on Applied Mathematical Optimization and Modelling (APMOD 2012), Paderborn, Germany.
      • Communication de conférence
        Alvarez-Miranda, E., Cacchiani, V., Dorneth, T., Junger, M., Liers, F., Lodi, A., Parriani, T. & Schmidt, D.R. (2012). Models and algorithms for robust network design with several traffic scenarios. Communication présentée à 2nd International Symposium on Combinatorial Optimization (ISCO 2012), Athens, Greece (p. 261-272). Tiré de https://doi.org/10.1007/978-3-642-32147-4_24
      • Communication de conférence
        D'Ambrosio, C., Lodi, A., Martello, S. & Rovatti, R. (2012). Optimistically approximating non-linear optimization problems through MILP. Communication présentée à 25th European Conference on Operational Research (EURO 2012), Vilnius, Lithuania.
      • Communication de conférence
        D'Ambrosio, C., Lodi, A., Martello, S. & Rovatti, R. (2012). Optimistic modeling of non-linear optimization problems by mixed-integer linear programming. Communication présentée à 21st International Symposium on Mathematical Programming (ISMP 2012), Berlin, Germany.
    • 2011
      • Communication de conférence
        Lodi, A. (2011). On bilevel programming and its impact in branching, cutting and complexity [Résumé]. Présenté à 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2011), Berlin, Germany (p. 3). Tiré de https://doi.org/10.1007/978-3-642-21311-3_3
      • Communication de conférence
        Lodi, A., Pesant, G. & Rousseau, L.-M. (2011). On counting lattice points and chvatal-gomory cutting planes. Communication présentée à 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2011), Berlin, Germany (p. 131-136). Tiré de https://doi.org/10.1007/978-3-642-21311-3_13
    • 2010
      • Communication de conférence
        Buchheim, C., Caprara, A. & Lodi, A. (2010). An effective branch-and-bound algorithm for convex quadratic integer programming. Communication présentée à 14th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2010), Lausanne, Suisse (p. 285-298). Tiré de https://doi.org/10.1007/978-3-642-13036-6_22
      • Communication de conférence
        Cicconetti, C., Lenzini, L., Lodi, A., Martello, S., Mingozzi, E. & Monaci, M. (2010). Efficient two-dimensional data allocation in IEEE 802.16 OFDMA. Communication présentée à IEEE INFOCOM 2010, San Diego, CA, United states. Tiré de https://doi.org/10.1109/INFCOM.2010.5462040
      • Communication de conférence
        D'Ambrosio, C., Frangioni, A., Liberti, L. & Lodi, A. (2010). Experiments with a feasibility pump approach for nonconvex MINLPs. Communication présentée à 9th International Symposium on Experimental Algorithms (SEA 2010), Naples, Italy (p. 350-360). Tiré de https://doi.org/10.1007/978-3-642-13193-6_30
      • Communication de conférence
        Dey, S.S., Lodi, A., Tramontani, A. & Wolsey, L.A. (2010). Experiments with two row tableau cuts. Communication présentée à 14th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2010), Lausanne, Suisse (p. 424-437). Tiré de https://doi.org/10.1007/978-3-642-13036-6_32
      • Communication de conférence
        D'Ambrosio, C., Frangioni, A., Liberti, L. & Lodi, A. (2010). Feasibility pump(s) for non-convex mixed-integer nonlinear programs. Communication présentée à European Workshop on Mixed Integer Nonlinear Programming, Marseille, France (p. 25).
      • Communication de conférence
        Lodi, A. (2010). Mixed-integer programming: State-of-the-art and fashionable topics. Communication présentée à 35th Conference on the Mathematics of Operations Research, Lunteren, The Netherlands.
      • Communication de conférence
        Bizzarri, F., Buchheim, C., Callegari, S., Caprara, A., Lodi, A., Rovatti, R. & Setti, G. (2010). Practical solution of periodic filtered approximation as a convex quadratic integer program. Communication présentée à 1st International Conference on Complex Systems Design and Management (CSDM 2010), Paris, France (p. 149-160). Tiré de https://doi.org/10.1007/978-3-642-15654-0_11
    • 2009
      • Communication de conférence
        Lodi, A. & Ralphs, T.K. (2009). Bilevel programming and maximally violated valid inequalities. Communication présentée à 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), Paris, France (p. 125-134).
    • 2007
      • Communication de conférence
        Campi, F., Deledda, A., Pizzotti, M., Ciccarelli, L., Rolandi, P., Mucci, C., Lodi, A., Vitkovski, A. & Vanzolini, L. (2007). A dynamically adaptive DSP for heterogeneous reconfigurable platforms. Communication présentée à Design, Automation and Test in Europe Conference and Exhibition (DATE 2007), Nice Acropolis, France (p. 9-14). Tiré de https://doi.org/10.1109/DATE.2007.364559
      • Communication de conférence
        Levi, R., Lodi, A. & Sviridenko, M. (2007). Approximation algorithms for the multi-item capacitated lot-sizing problem via flow-cover inequalities. Communication présentée à 12th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2007), Ithaca, NY, United states (p. 454-468).
      • Communication de conférence
        Kiziltan, Z., Lodi, A., Milano, M. & Parisini, F. (2007). CP-based local branching. Communication présentée à 13th International Conference on Principles and Practice of Constraint Programming (CP 2007), Providence, RI, United states (p. 847-855). Tiré de https://doi.org/10.1007/978-3-540-74970-7_63
      • Communication de conférence
        Mucci, C., Vanzolini, L., Lodi, A., Deledda, A., Guerrieri, R., Campi, F. & Toma, M. (2007). Implementation of AES/Rijndael on a dynamically reconfigurable architecture. Communication présentée à Design, Automation and Test in Europe Conference and Exhibition (DATE 2007), Nice Acropolis, France (p. 355-360). Tiré de https://doi.org/10.1109/DATE.2007.364617
      • Communication de conférence
        Dash, S., Gunluk, O. & Lodi, A. (2007). On the MIR closure of polyhedra. Communication présentée à 12th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2007), Ithaca, NY, United states (p. 337-351). Tiré de https://doi.org/10.1007/978-3-540-72792-7_26
    • 2006
      • Communication de conférence
        Mucci, C., Bocchi, M., Gagliardi, P., Ciccarelli, L., Lodi, A., Toma, M. & Campi, F. (2006). A case-study on multimedia applications for the XiRisc reconfigurable processor. Communication présentée à IEEE International Symposium on Circuits and Systems (ISCAS 2006), Kos, Greece (p. 4859-4862). Tiré de https://doi.org/10.1109/ISCAS.2006.1693719
      • Communication de conférence
        Ciccarelli, L., Loparco, D., Innocenti, M., Lodi, A., Mucci, C. & Rolandi, P. (2006). A low-power routing architecture optimized for deep sub-micron FPGAs. Communication présentée à IEEE Custom Integrated Circuits Conference (CICC 2006), San Jose, CA, United states (p. 309-312). Tiré de https://doi.org/10.1109/CICC.2006.320889
      • Communication de conférence
        Lodi, A., Mucci, C., Bocchi, M., Cappelli, A., De Dominicis, M. & Ciccarelli, L. (2006). A multi-context pipelined array for embedded systems. Communication présentée à International Conference on Field Programmable Logic and Applications (FPL 2006), Madrid, Spain (p. 581-588). Tiré de https://doi.org/10.1109/FPL.2006.311270
      • Communication de conférence
        Bragalli, C., D'Ambrosio, C., Lee, J., Lodi, A. & Toth, P. (2006). An MINLP solution method for a water network problem. Communication présentée à 14th Annual European Symposium on Algorithms (ESA 2006), Zurich, Switzerland (p. 696-707).
      • Communication de conférence
        Bocchi, M., De Dominicis, M., Mucci, C., Deledda, A., Campi, F., Lodi, A., Toma, M. & Guerrieri, R. (2006). Design and implementation of a reconfigurable heterogeneous multiprocessor SoC. Communication présentée à IEEE Custom Integrated Circuits Conference (CICC 2006), San Jose, CA, United states (p. 93-96). Tiré de https://doi.org/10.1109/CICC.2006.320984
    • 2005
      • Communication de conférence
        Lodi, A., Ciccarelli, L., Mucci, C., Giansante, R., Cappelli, A. & Toma, M. (2005). An embedded reconfigurable datapath for SoC. Communication présentée à 13th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM 2005), Napa, CA, United states (p. 303-304). Tiré de https://doi.org/10.1109/FCCM.2005.18
      • Communication de conférence
        Bansal, N., Lodi, A. & Sviridenko, M. (2005). A tale of two dimensional bin packing. Communication présentée à 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), Pittsburgh, Pennsylvania, USA (p. 657-666). Tiré de https://doi.org/10.1109/SFCS.2005.10
      • Communication de conférence
        Lodi, A., Ciccarelli, L. & Giansante, R. (2005). Combining low-leakage techniques for FPGA routing design. Communication présentée à 13th ACM/SIGDA International Symposium on Field Programmable Gate Arrays (FPGA 2005), Monterey, CA, United states (p. 208-214). Tiré de https://doi.org/10.1145/1046192.1046219
      • Communication de conférence
        Lodi, A., Pini, M.S. & Rossi, F. (2005). Gomory cuts in a hybrid constraint programming approach. Communication présentée à Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming (CSCLP 2005), Uppsala, Sweden (p. 107).
      • Communication de conférence
        Lodi, A. (2005). Heuristic mixed integer programming. Communication présentée à IMA Workshop in Mixed Integer Programming, Minneapolis, MN.
      • Communication de conférence
        Borghetti, A., Lodi, A., Martello, S., Martignani, M., Nucci, C.A. & Trebbi, A. (2005). Linear programming approach for the transition from market-generated hourly energy programs to feasible power generation schedules. Communication présentée à 15th Power Systems Computation Conference (PSCC 2005), Liege, Belgium.
      • Communication de conférence
        Lodi, A., Ciccarelli, L., Loparco, D., Canegallo, R. & Guerrieri, R. (2005). Low leakage design of LUT-based FPGAs. Communication présentée à 31st European Solid-State Circuits Conference (ESSCIRC 2005), Grenoble, France (p. 153-156). Tiré de https://doi.org/10.1109/ESSCIR.2005.1541582
      • Communication de conférence
        Fischetti, M. & Lodi, A. (2005). Optimizing over the first Chvatal closure. Communication présentée à 11th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2005), Berlin, Germany (p. 12-22). Tiré de https://doi.org/10.1007/11496915_2
      • Communication de conférence
        Cappelli, A., Lodi, A., Bocchi, M., Mucci, C., Innocenti, M., De, B.C., Ciccarelli, L., Giansante, R., Deledda, A., Campi, F., Toma, M. & Guerrieri, R. (2005). XiSystem: A XiRisc-based SoC with a reconfigurable IO module. Communication présentée à IEEE International Solid-State Circuits Conference (ISSCC 2005), San Francisco, CA, United states (p. 196-197, 593). Tiré de https://doi.org/10.1109/ISSCC.2005.1493936
    • 2004
      • Communication de conférence
        Cappelli, A., Lodi, A., Mucci, C., Toma, M. & Campi, F. (2004). A dataflow control unit for C-to-configurable pipelines compilation flow. Communication présentée à 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM 2004), Napa, CA, United states (p. 332-333). Tiré de https://doi.org/10.1109/FCCM.2004.2
      • Communication de conférence
        Bocchi, M., De Bartolomeis, C., Mucci, C., Campi, F., Lodi, A., Toma, M., Canegallo, R. & Guerrieri, R. (2004). A XiRisc-based SoC for embedded DSP applications. Communication présentée à IEEE Custom Integrated Circuits Conference (CICC 2004), Orlando, FL, United states (p. 595-598). Tiré de https://doi.org/10.1109/cicc.2004.1358894
      • Communication de conférence
        Lodi, A., Giansante, R., Chiesa, C., Ciccarelli, L., Campi, F. & Toma, M. (2004). Compact buffered routing architecture. Communication présentée à 14th International Conference on Field-Programmable Logic and Applications (FPL 2004), Leuven, Belgium (p. 179-188). Tiré de https://doi.org/10.1007/978-3-540-30117-2_20
      • Communication de conférence
        Ciccarelli, L., Lodi, A. & Canegallo, R. (2004). Low leakage circuit design for FPGAs. Communication présentée à IEEE Custom Integrated Circuits Conference (CICC 2004), Orlando, FL, United states (p. 715-718). Tiré de https://doi.org/10.1109/cicc.2004.1358929
      • Communication de conférence
        Frangioni, A., Lodi, A. & Rinaldi, G. (2004). Optimizing over semimetric polytopes. Communication présentée à 10th International Integer Programming and Combinatorial Optimization Conference, New York, NY (p. 431-443). Tiré de https://doi.org/10.1007/978-3-540-25960-2_32
      • Communication de conférence
        Lodi, A., Giansante, R., Chiesa, C., Ciccarelli, L., Toma, M. & Campi, F. (2004). Routing architecture for multi-context FPGAs. Communication présentée à 12th ACM/SIGDA International Symposium on Field Programmable Gate Arrays (FPGA 2004), Monterey, CA, USA (p. 246-246). Tiré de https://doi.org/10.1145/968280.968318
    • 2003
      • Communication de conférence
        Mucci, C., Chiesa, C., Lodi, A., Toma, M. & Campi, F. (2003). A C-based algorithm development flow for a reconfigurable processor architecture. Communication présentée à 5th International Symposium on System-on-Chip (SoC 2003), Tampere, Finland (p. 69-73). Tiré de https://doi.org/10.1109/ISSOC.2003.1267720
      • Communication de conférence
        Lodi, A., Chiesa, C., Campi, F. & Toma, M. (2003). A flexible LUT-based carry chain for FPGAs. Communication présentée à IEEE International Symposium on Circuits and Systems (ISCAS 2003), Bangkok, Thailand (p. 133-136). Tiré de https://doi.org/10.1109/ISCAS.2003.1206209
      • Communication de conférence
        Lodi, A., Toma, M. & Campi, F. (2003). A pipelined configurable gate array for embedded processors. Communication présentée à 11th ACM/SIGDA International Symposium on Field Programmable Gate Arrays (FPGA 2003), Monterey, CA, United states (p. 21-29). Tiré de https://doi.org/10.1145/611817.611822
      • Communication de conférence
        Campi, F., Toma, M., Lodi, A., Cappelli, A., Canegallo, R. & Guerrieri, R. (2003). A VLIW processor with reconfigurable instruction set for embedded applications. Communication présentée à IEEE International Solid-State Circuits Conference (ISSCC 2003), San Francisco, CA, USA (p. 245, 250-251, 491). Tiré de https://doi.org/10.1109/ISSCC.2003.1234288
      • Communication de conférence
        Lodi, A., Ciccarelli, L., Cappelli, A., Campi, F. & Toma, M. (2003). Decoder-based multi-context interconnect architecture. Communication présentée à IEEE Computer Society Annual Symposium on VLSI: New Trends and Technologies for Vlsi Systems Design (ISVLSI 2003), Tampa, FL, United states (p. 231-233). Tiré de https://doi.org/10.1109/ISVLSI.2003.1183478
      • Communication de conférence
        Lodi, A., Milano, M. & Rousseau, L.-M. (2003). Discrepancy Additive Bounding for the All different Constraint. Communication présentée à 9th International Conference on Principles and Practice of Constraint Programming (CP 2003), Kinsale, Ireland (p. 510-524). Tiré de https://doi.org/10.1007/978-3-540-45193-8_35
      • Communication de conférence
        Lodi, A. (2003). Local branching: a tutorial. Communication présentée à 5th Metaheuristics International Conference (MIC 2003), Kyoto, Japan.
    • 2002
      • Communication de conférence
        Caprara, A., Lodi, A. & Monaci, M. (2002). An approximation scheme for the two-stage, two-dimensional bin packing problem. Communication présentée à 9th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2002), Cambridge, MA, United states (p. 315-328).
      • Communication de conférence
        Artina, S., Bragalli, C., Lodi, A. & Toth, P. (2002). Approccio MILP (mixed integer linear programming) al problema di optimal design di reti di distribuzione idrica. Communication présentée à 28° Convegno di Idraulica e Costruzioni Idrauliche, Potenza, Italia.
      • Communication de conférence
        Letchford, A.N. & Lodi, A. (2002). Polynomial-time separation of simple comb inequalities. Communication présentée à 9th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2002), Cambridge, MA, United states (p. 93-108). Tiré de https://doi.org/10.1007/3-540-47867-1_8
      • Communication de conférence
        Lodi, A., Toma, M. & Guerrieri, R. (2002). Very low complexity prompted speaker verification system based on HMM-modeling. Communication présentée à IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2002), Orlando, FL, United states (p. 3912-3915). Tiré de https://doi.org/10.1109/ICASSP.2002.1004773
      • Communication de conférence
        Toma, M., Lodi, A. & Guerrieri, R. (2002). Word endpoints detection in the presence of non-stationary noise. Communication présentée à 7th International Conference on Spoken Language Processing (ICSLP-INTERSPEECH 2002), Denver, Colorado, USA. Tiré de http://www.isca-speech.org/archive/icslp_2002/i02_1053.html
    • 2001
      • Communication de conférence
        Letchford, A.N. & Lodi, A. (2001). An augment-and-branch-and-cut framework for mixed 0-1 programming. Communication présentée à 5th International Workshop on Combinatorial Optimization, Aussois, France (p. 119-133). Tiré de https://doi.org/10.1007/3-540-36478-1_12
      • Communication de conférence
        Lodi, A. & Monaci, M. (2001). ILP models for the 2-staged cutting stock. Communication présentée à 3e conférence francophone de modélisation et simulation (MOSIM 2001), Troyes, France (p. 379-385).
      • Communication de conférence
        Borghetti, A., Frangioni, A., Lacalandra, F., Lodi, A., Martello, S., Nucci, C.A. & Trebbi, A. (2001). Lagrangian relaxation and Tabu Search approaches for the unit commitment problem. Communication présentée à IEEE Porto Power Tech Conference (PPT 2001), Porto, Portugal (p. 231-237). Tiré de https://doi.org/10.1109/PTC.2001.964914
      • Communication de conférence
        Focacci, F., Laburthe, F. & Lodi, A. (2001). Local search and constraint programming. Communication présentée à 4th Metaheuristics International Conference (MIC 2001), Porto, Portugal (p. 451-454).
      • Communication de conférence
        Fischetti, M., Lodi, A. & Toth, P. (2001). Solving real-world ATSP instances by branch-and-cut. Communication présentée à 5th International Workshop on Combinatorial Optimization, Aussois, France (p. 64-77). Tiré de https://doi.org/10.1007/3-540-36478-1_8
    • 2000
      • Communication de conférence
        Focacci, F., Lodi, A. & Milano, M. (2000). Cutting planes in constraint programming: an hybrid approach. Communication présentée à 6th International Conference on Principles and Practice of Constraint Programming (CP 2000), Singapore (p. 187-201). Tiré de https://doi.org/10.1007/3-540-45349-0_15
    • 1999
      • Communication de conférence
        Focacci, F., Lodi, A. & Milano, M. (1999). Cost-based domain filtering. Communication présentée à 5th International Conference on Principles and Practice of Constraint Programming (CP 1999), Alexandria, Virginia (p. 189-203). Tiré de https://doi.org/10.1007/978-3-540-48085-3_14
      • Communication de conférence
        Focacci, F., Lodi, A. & Milano, M. (1999). Integration of CP and OR methods for matching problems. Communication présentée à 1st International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 1999), Ferrara, Italy.
      • Communication de conférence
        Focacci, F., Milano, M. & Lodi, A. (1999). Solving TSP with time windows with constraints. Communication présentée à International conference on Logic programming (ICLP 1999), Las Cruces, New Mexico (p. 515-529).
    • 1997
      • Communication de conférence
        Lodi, A., Martello, S. & Vigo, D. (1997). Approximation algorithms for the two-dimensional bin packing problem. Communication présentée à 1st International Conference on Operations and Quantitative Management, Jaipur, India (p. 177-184).
  • Livres (2)
    • 2019
      • Livre
        A. Lodi & V. Nagarajan (édit.). (2019). Integer Programming and Combinatorial Optimization : 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings. Cham, Switzerland: Springer International Publishing. Tiré de https://doi.org/10.1007/978-3-030-17953-3
    • 1999
      • Livre
        Lucertini, M., Toth, P., Vigo, D., Ciaschetti, G. & Lodi, A. (1999). Gestione dei fattori della produzione : schemi delle lezioni. Bologna, Italy: Pitagora.
  • Chapitres de livre (23)
    • 2016
      • Chapitre de livre
        Lodi, A. & Tubertini, P. (2016). Pre-operative activities and operating theater planning in Emilia-Romagna, Italy. Dans Optimization in the Real World (p. 115-137). Springer. Tiré de https://doi.org/10.1007/978-4-431-55420-2_7
    • 2015
      • Chapitre de livre
        Borghetti, A., D'Ambrosio, C., Lodi, A. & Martello, S. (2015). Optimal scheduling of a multiunit hydro power station in a short-term planning horizon. Dans Case studies in operations research (p. 167-181). New York: Springer. Tiré de https://doi.org/10.1007/978-1-4939-1007-6_8
      • Chapitre de livre
        Bragalli, C., D'Ambrosio, C., Lee, J., Lodi, A. & Toth, P. (2015). Optimizing the design of water distribution networks using mathematical optimization. Dans Case studies in operations research (p. 183-198). New York: Springer. Tiré de https://doi.org/10.1007/978-1-4939-1007-6_9
    • 2014
      • Chapitre de livre
        Lodi, A., Martello, S., Monaci, M. & Vigo, D. (2014). Two‐dimensional bin packing problems. Dans V.T. Paschos (édit.), Paradigms of combinatorial optimization (2e éd., p. 107-129). Hoboken, NJ: Wiley. Tiré de https://doi.org/10.1002/9781119005353.ch5
    • 2013
      • Chapitre de livre
        Lodi, A. & Tramontani, A. (2013). Performance variability in mixed-integer programming. Dans H. Topaloglu (édit.), Theory driven by influential applications (p. 1-12). Catonsville, MD: INFORMS. Tiré de https://doi.org/10.1287/educ.2013.0112
      • Chapitre de livre
        Lodi, A. (2013). The heuristic (dark) side of MIP solvers. Dans E.-G. Talbi (édit.), Hybrid metaheuristics (p. 273-284). Berlin, Germany: Springer. Tiré de https://doi.org/10.1007/978-3-642-30671-6_10
    • 2011
      • Chapitre de livre
        D'Ambrosio, C., Lodi, A. & Martello, S. (2011). Combinatorial traveling salesman problem algorithms. Dans Wiley encyclopedia of operations research and management science. Hoboken, NJ: Wiley. Tiré de https://doi.org/10.1002/9780470400531.eorms0160
      • Chapitre de livre
        Bonami, P., Linderoth, J. & Lodi, A. (2011). Disjunctive cuts for mixed integer nonlinear programming problems. Dans A.R. Mahjoub (édit.), Progress in combinatorial optimization (p. 521-541). Hoboken, NJ: Wiley.
      • Chapitre de livre
        Belotti, P., Liberti, L., Lodi, A., Nannicini, G. & Tramontani, A. (2011). Disjunctive inequalities: applications and extensions. Dans Wiley encyclopedia of operations research and management science. Hoboken, NJ: Wiley. Tiré de https://doi.org/10.1002/9780470400531.eorms0537
      • Chapitre de livre
        Fischetti, M. & Lodi, A. (2011). Heuristics in mixed integer programming. Dans Wiley encyclopedia of operations research and management science. Hoboken, NJ: Wiley. Tiré de https://doi.org/10.1002/9780470400531.eorms0376
      • Chapitre de livre
        Achterberg, T. & Lodi, A. (2011). Hybrid solving techniques. Dans P.v. Hentenryck & M. Milano (édit.), Hybrid optimization (p. 169-190). New York: Springer. Tiré de https://doi.org/10.1007/978-1-4419-1644-0_5
    • 2010
      • Chapitre de livre
        Fischetti, M., Lodi, A. & Salvagnin, D. (2010). Just MIP it! Dans V. Maniezzo, T. Stützle & S. Voß (édit.), Matheuristics (p. 39-70). New York: Springer. Tiré de https://doi.org/10.1007/978-1-4419-1306-7_2
      • Chapitre de livre
        Letchford, A.N., Lodi, A., Cochran, J.J., Cox, L.A., Keskinocak, P., Kharoufeh, J.P. & Smith, J.C. (2010). Mathematical programming approaches to the traveling salesman problem. Dans Wiley encyclopedia of operations research and management science. Hoboken, NJ: Wiley. Tiré de https://doi.org/10.1002/9780470400531.eorms0505
      • Chapitre de livre
        Lodi, A. (2010). Mixed integer programming computation. Dans M. Jünger, T.M. Liebling, D. Naddef, G.L. Nemhauser, W.R. Pulleyblank, G. Reinelt, G. Rinaldi & L.A. Wolsey (édit.), 50 years of integer programming 1958-2008 (p. 619-645). Berlin, Germany: Springer. Tiré de https://doi.org/10.1007/978-3-540-68279-0_16
    • 2007
      • Chapitre de livre
        Fischetti, M., Lodi, A. & Toth, P. (2007). Exact methods for the asymmetric traveling salesman problem. Dans G. Gutin & A.P. Punnen (édit.), The traveling salesman problem and its variations (p. 169-205). New York: Springer. Tiré de https://doi.org/10.1007/0-306-48213-4_4
      • Chapitre de livre
        Lodi, A., Martello, S. & Vigo, D. (2007). Récentes avancées sur le problème de bin packing à deux dimensions. Dans V.T. Paschos (édit.), Optimisation combinatoire 4 : problèmes paradigmatiques (p. 137-161). Paris, France: Hermès Science Publications.
      • Chapitre de livre
        Lodi, A. & Punnen, A.P. (2007). TSP software. Dans G. Gutin & A.P. Punnen (édit.), The traveling salesman problem and its variations (p. 737-749). New York: Springer. Tiré de https://doi.org/10.1007/0-306-48213-4_16
    • 2005
      • Chapitre de livre
        Dell'Amico, M. & Lodi, A. (2005). On the integration of metaheuristic strategies in constraint programming. Dans R. Sharda, S. Voß, C. Rego & B. Alidaee (édit.), Metaheuristic optimization via memory and evolution (p. 357-371). New York: Springer. Tiré de https://doi.org/10.1007/0-387-23667-8_16
    • 2004
      • Chapitre de livre
        Focacci, F., Lodi, A. & Milano, M. (2004). Exploiting relaxations in CP. Dans M. Milano (édit.), Constraint and integer programming (p. 137-167). New York: Springer. Tiré de https://doi.org/10.1007/978-1-4419-8917-8_5
      • Chapitre de livre
        Focacci, F., Laburthe, F. & Lodi, A. (2004). Local search and constraint programming: LS and CP illustrated on a transportation problem. Dans M. Milano (édit.), Constraint and integer programming (p. 293-329). New York: Springer. Tiré de https://doi.org/10.1007/978-1-4419-8917-8
    • 2003
      • Chapitre de livre
        Focacci, F., Laburthe, F. & Lodi, A. (2003). Local search and constraint programming. Dans F. Glover & G.A. Kochenberger (édit.), Handbook of metaheuristics (p. 369-403). New York: Springer. Tiré de https://doi.org/10.1007/0-306-48056-5_13
    • 1999
      • Chapitre de livre
        Lodi, A., Martello, S. & Vigo, D. (1999). Neighborhood search algorithm for the guillotine non-oriented two-dimensional bin packing problem. Dans S. Voß, S. Martello, I.H. Osman & C. Roucairol (édit.), Meta-heuristics advances and trends in local search paradigms for optimization (p. 125-139). New York: Springer. Tiré de https://doi.org/10.1007/978-1-4615-5775-3_9
  • Brevets (4)
    • 2014
    • 2010
    • 2008
      • Brevet
        Ciccarelli, L., Chiesa, C., Lodi, A., Giansante, R., Toma, M. & Campi, F. (2008). Switch block and corresponding switch matrix, in particular for FPGA architectures (Brevet n° US 7463055). Tiré de https://www.google.ca/patents/US7463055
    • 2007
      • Brevet
        Cappelli, A., Ciccarelli, L., Lodi, A., Toma, M. & Campi, F. (2007). Architecture for a connection block in reconfigurable gate arrays (Brevet n° US 7193437). Tiré de https://www.google.ca/patents/US7193437
  • Rapports (37)
  • Thèses (1)
    • 1999
      • Thèse
        Lodi, A. (1999). Algorithms for two-dimensional bin packing and assignment problems (Thèse de doctorat, Università degli studi di Bologna).