Documents publiés en "2012"

A

Álvarez-Miranda, E., Cacchiani, V., Dorneth, T., Jünger, M., Liers, F., Lodi, A., Parriani, T., & Schmidt, D. R. (avril 2012). Models and algorithms for robust network design with several traffic scenarios [Communication écrite]. 2nd International Symposium on Combinatorial Optimization (ISCO 2012), Athens, Greece. Lien externe

B

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. Lien externe

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. Lien externe

D

D'Ambrosio, C., Frangioni, A., Liberti, L., & Lodi, A. (avril 2012). Extending feasibility pump to nonconvex mixed integer nonlinear programming problems [Communication écrite]. 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. Non disponible

D'Ambrosio, C., Frangioni, A., Liberti, L., & Lodi, A. (mars 2012). Feasibility pump algorithms for nonconvex mixed integer nonlinear programming problems [Communication écrite]. International Conference on Applied Mathematical Optimization and Modelling (APMOD 2012), Paderborn, Germany. Non disponible

D'Ambrosio, C., Frangioni, A., Liberti, L., & Lodi, A. (avril 2010). A storm of feasibility pumps for nonconvex MINLP [Communication écrite]. European Workshop on Mixed Integer Nonlinear Program-ming (EWMINLP 2010), Marseille, France. Publié dans Mathematical Programming, 136(2). Lien externe

D'Ambrosio, C., Lodi, A., Martello, S., & Rovatti, R. (août 2012). Optimistic modeling of non-linear optimization problems by mixed-integer linear programming [Communication écrite]. 21st International Symposium on Mathematical Programming (ISMP 2012), Berlin, Germany. Non disponible

D'Ambrosio, C., Lodi, A., Martello, S., & Rovatti, R. (juillet 2012). Optimistically approximating non-linear optimization problems through MILP [Communication écrite]. 25th European Conference on Operational Research (EURO 2012), Vilnius, Lithuania. Non disponible

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. Lien externe

Dolatabadi, M., Lodi, A., & Monaci, M. (2012). Exact algorithms for the two-dimensional guillotine knapsack. Computers and Operations Research, 39(1), 48-53. Lien externe

H

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. Lien externe

K

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. Lien externe