Items where Author is "Monaci, Michele"

B

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. External link

Belotti, P., Bonami, P., Fischetti, M., Lodi, A., Monaci, M., Nogales-Gómez, A., & Salvagnin, D. (2015). On handling indicator constraints in mixed-integer programming. (Technical Report). Unavailable

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. External link

C

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. External link

Caprara, A., Lodi, A., & Monaci, M. (2010). An approximation scheme for the two-stage, two-dimensional knapsack problem. Discrete Optimization, 7(3), 114-124. External link

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. External link

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. External link

Caprara, A., Lodi, A., & Monaci, M. (2002, May). An approximation scheme for the two-stage, two-dimensional bin packing problem [Paper]. 9th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2002), Cambridge, MA, United states. External link

D

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

F

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. External link

Fischetti, M., Lodi, A., Monaci, M., Salvagnin, D., & Tramontani, A. (2013). Tree search stabilization by random sampling. (Technical Report). Unavailable

L

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. External link

Lodi, A., Martello, S., Monaci, M., & Vigo, D. (2014). Two‐dimensional bin packing problems. In Paschos, V. T. (ed.), Paradigms of combinatorial optimization (107-129). External link

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. External link

Lodi, A., & Monaci, M. (2003). Integer linear programming models for 2-staged two-dimensional Knapsack problems. Mathematical Programming, 94(2-3), 257-278. External link

Lodi, A., Martello, S., & Monaci, M. (2002). Two-dimensional packing problems: a survey. European Journal of Operational Research, 141(2), 241-252. External link

Lodi, A., & Monaci, M. (2001, April). ILP models for the 2-staged cutting stock [Paper]. 3e conférence francophone de modélisation et simulation (MOSIM 2001), Troyes, France. Unavailable