2011

[102] R. Cordone, A. Piselli, P. Ravizza, G. Righini, Optimization of multi-skill call centers contracts and work-shifts, Service Science 3 (2011) 67-81.
[101] F. Liberatore, G. Righini, M. Salani, A column generation algorithm for the vehicle routing problem with soft time windows, 4OR 9 (2011) 49-82.
[100] A. Bettinelli, A. Ceselli, G. Righini, A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows, Transportation Research C 19 (2011) 723-740.
[99] G. Righini, E. Tresoldi, A. Donati, N. Policella, E. Rabenau, An automatic planning and scheduling system for the Mars Express uplink scheduling problem, accepted for publication in IEEE Transactions on Systems, Man and Cybernetics - C.
[98] Addis B., Carello G., Ceselli A.Exactly Solving a Two-level Hierarchical Location Problem with modular node capacities, Networks, accepted for publication (2011).
[97] Casazza M., Ceselli A., Nunkesser M. Efficient Algorithms for the Double Travelling Salesman Problem with Multiple Stacks , Computers and Operations Research, accepted for publication (2011).

2010

[96] G. Righini, E. Tresoldi, A mathematical programming solution to the Mars Express memory dumping problem, IEEE Transactions on Systems, Man and Cybernetics - C 40 (2010) 268-277.
[95] A. Bettinelli, A. Ceselli, G. Righini, A branch-and-price algorithm for the Variable Size Bin Packing Problem with Minimum Filling Constraint, Annals of Operations Research 179 (2010) 221-241.

2009

[94] R. Aringhieri, M. Bruglieri, and R. Cordone. Optimal results and tight bounds for the maximum diversity problem. Foundations of Computing and Decision Sciences, 34(2):73-86, 2009.
[93] A. Bosio and G. Righini. A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times. Mathematical Methods of Operations Research, 69:271-280, 2009.
[92] L. Piroddi, R. Cordone, and I. Fumagalli. Combined siphon and marking generation for deadlock prevention in Petri nets. IEEE Transactions on Systems, Man and Cybernetics, Part A, 39(3):650-661, May 2009.
[91] R. Cordone, M. Maggioni, F. Redaelli, M. A. Redaelli, M. D. Santambrogio, and D. Sciuto. Partitioning and scheduling of task graphs on partially dynamically reconfigurable FPGAs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 28(5):662-675, May 2009.
[90] G. Righini, M. Salani, Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming , Computers and Operations Research 36 (2009) 1191-1203.
[89] A. Ceselli, G. Righini, M. Salani, A column generation algorithm for a rich vehicle routing problem , Transportation Science 43 (2009) 56-69.

2008

[88] Ceselli A., Gatto M., L├╝bbecke M., Nunkesser M., Schilling H Optimizing the Cargo Express Service o Swiss Federal RailwaysTransportation Science, 42(4) 450-465 (2008)
[87] R. Cordone, F. Gandellini, G. Righini, Solving the swath segment selection problem through Lagrangean relaxation, Computers and Operations Research 35 (2008) 854-862.
[86] A. Ceselli, G. Righini, An optimization algorithm for the ordered open-end bin packing problem, Operations Research 56 (2008) 425-436.
[85] G. Righini, A branch-and-bound algorithm for the linear ordering problem with cumulative costs, European Journal of Operational Research 186 (2008) 965-971.
[84] G. Righini, M. Salani, New dynamic programming algorithms for the re\-sour\-ce-constrained elementary shortest path problem, Networks 51 (2008) 155-170.
[83] A. Bettinelli, A. Ceselli, G. Righini, A branch-and-price algorithm for the two-dimensional level strip packing problem, 4OR 6 (2008) 361-374.
[82] N. Bianchessi, G. Righini, Planning and scheduling algorithms for the COSMO-SkyMed constellation, Aerospace Science and Technology 12 (2008) 535-544.
[81] A. Ceselli, F. Liberatore, G. Righini, A computational evaluation of a general branch-and-price framework for capacitated network location pro\-blems, Annals of Operations Research 167 (2008) 209-252.

2007

[80] A. Bettinelli, A. Ceselli, and G. Righini. A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint. Technical report, Note del Polo - Ricerca n.106, September 2007. Submitted to Annals of O.R. Presented at CTW 2007 Twente 2007.
[79] N. Bianchessi and G. Righini. Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Computers and Operations Rerearch 34, pages 578-594, 2007. to appear Presented in preliminary version at AIRO 2000 Milano 2000 Presented at AIRO03 Venezia 2003.
[78] S. Bosio and G. Righini. A combinatorial optimization problem arising from text classification. Computers and Operations Research 34, pages 1910-1928, 2007. to appear Presented at CTW03 Enschede 2003 Presented at AIRO03 Venezia 2003.
[77] A. Ceselli, G. Righini, and M. Salani. A column generation algorithm for a vehicle routing problem with economies of scale and additional constraints. Technical report, Note del Polo - Ricerca n.105, September 2007. Presented at TRISTAN VI Pukhet 2007 Submitted to Transportation Science.
[76] A. Ceselli, G. Righini, and M. Salani. A column generation algorithm for a vehicle routing problem with economies of scale and additional constraints. Technical report, Note del Polo - Ricerca n.105, September 2007. Submitted to Transportation Science.
[75] R. Cordone. A subexponential algorithm for the coloured tree partition problem. Discrete Applied Mathematics, 155(10):1326-1335, May 2007.
[74] G. Righini and L. Zaniboni. A branch-and-price algorithm for the multi-source weber problem. International Journal of Operations Research 2, pages 188-207, 2007. to appear Presented at AIRO 2004 Lecce 2004 Presented at INFORMS Annual Meeting Denver 2004.

2006

[73] R. Aringhieri, E. Damiani, S. De Capitani Di Vimercati, S. Paraboschi, and P. Samarati. Fuzzy Techniques for Trust and Reputation Management in Anonymous Peer-to-Peer Systems. Journal of the American Society for Information Science and Technology, 57(4):528 - 537, 2006.
[72] A. Bosio and G. Righini. A dynamic programming algorithm for the single-machine scheduling problem with deteriorating processing times. Technical report, Note del Polo - Ricerca n.94, July 2006. Submitted to Mathematical Methods of O.R. Submitted to Discrete Optimization Presented at Cologne-Twente Workshop on Graphs and Combinatorial Optimization 2006 Lambrecht 2006 Note del Polo - Ricerca n.94 July 2006.
[71] A. Ceselli and G. Righini. A branch-and-price algorithm for the multilevel generalized assignment problem. Operations Research 54, pages 1172-1184, 2006. to appear Presented at ISMP2003 Copenhagen 2003 Presented at AIRO03 Venezia 2003.
[70] A. Ceselli and G. Righini. An optimization algorithm for a penalized knapsack problem. Operations Research Letters 34, pages 394-404, 2006. to appear.
[69] R. Cordone and M. Trubian. An exact algorithm for the node weighted steiner tree problem. 4OR 4, pages 1614-2411, 2006.
[68] M. Dell'Amico, G. Righini, and M. Salani. A branch-and-price algorithm for the vehicle routing problem with simultaneous pick-up and delivery. Transportation Science 40, pages 235-247, 2006. Presented at AIRO03 Venezia 2003 Presented at CORS/INFORMS Joint International Meeting Banff 2004.
[67] G. Righini. A branch-and-bound algorithm for the linear ordering problem with cumulative costs. Technical report, Note del Polo - Ricerca n.92, May 2006. submitted to Eur. J.Op. Res.
[66] G. Righini and M. Salani. Dynamic programming for the orienteering problem with time windows. Technical report, Note del Polo - Ricerca n.91, March 2006.
[65] G. Righini and M. Salani. Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optimization 3, pages 255-273, 2006. to appear Presented at Optimization Days Montreal 2004 Presented at CTW04 Menaggio 2004 Presented at AIRO 2004 Lecce 2004.

2004

[64] M. Ambrosini, T. Caruso, S. Foresti, and G. Righini. A grasp for the pickup and delivery problem with rear loading. Technical report, Note del Polo - Ricerca n.65, August 2004.
[63] R. Aringhieri. Solving Chance-Constrained Programs combining Tabu Search and Simulation. In C. C. Ribeiro and S. L. Martins, editors, Experimental and Efficient Algorithms, volume 3059 of Lecture Notes in Computer Science, pages 30-41. Springer-Verlag Heidelberg, 2004.
[62] A. Ceselli and G. Righini. A branch-and-price algorithm for the multilevel generalized assignment problem. Technical report, Note del Polo - Ricerca n.62, May 2004.
[61] G. Righini and M. Salani. Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Technical report, Note del Polo - Ricerca n.66, October 2004.
[60] G. Righini and M. Trubian. A note on the approximation of the asymmetric traveling salesman problem. European Journal of Operational Research 91, pages 255-265, 2004. Presented at OR 94 Berlin 1994.
[59] G. Righini and L. Zaniboni. A branch-and-price algorithm for the multi-source weber problem. Technical report, Note del Polo - Ricerca n. 67, November 2004.

2003

[58] R. Aringhieri, P. Hansen, and F. Malucelli. Chemical Trees Enumeration Algorithms. 4OR, 1:67-83, 2003.
[57] R. Aringhieri and F. Malucelli. Optimal Operations Management and Network Planning of a District Heating System with a Combined Heat and Power Plant. Annals of Operations Research, 120:173-199, 2003.
[56] N. Bianchessi and G. Righini. Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Technical report, Note del Polo - Ricerca n.50, May 2003.
[55] S. Bosio and G. Righini. A combinatorial optimization problem arising from text classification. Technical report, Note del Polo - Ricerca n.57, September 2003.
[54] A. Ceselli. Two optimization algorithms for the capacitated p-median problem. 4OR 1, pages 319-340, 2003.
[53] M. Dell'Amico, G. Righini, and M. Salani. A branch-and-price algorithm for the vehicle routing problem with simultaneous pick-up and delivery. Technical report, Note del Polo - Ricerca n.51, May 2003.

2002

[52] N. Bianchessi. Realizzazione di algoritmi di vehicle routing per un sistema di ausilio alla guida. Technical report, Note del Polo - Progetti n.6, stage at ``La Buona Fattoria'', Ripalta Cremasca (CR)., May 2002.
[51] A. Ceselli and G. Righini. A branch-and-price algorithm for the capacitated p-median problem. Technical report, Note del Polo - Ricerca n.46, October 2002.

2001

[50] R. Aringhieri, G. Gallo, F. Malucelli, and C. Artioli. Un modello per la gestione del teleriscaldamento e la cogenerazione di energia elettrica nella città di ferrara. Logistica & Management, gennaio/febbraio:75-93, 2001.
[49] R. Aringhieri, P. Hansen, and F. Malucelli. A Linear Algorithm for The Hyper Wiener Index of Chemical Trees. Journal of Chemical Information and Computer Science, 41(4):958-963, 2001.
[48] A. Colorni and G. Righini. Modeling and optimizing dynamic dial-a-ride problems. International Transactions in Operational Research 8, pages 155-166, 2001. Presented at the Fifth IFORS Triennial Conference Beijing 1999 Presented in preliminary version at the Sixth International Workshop on Computer-Aided Scheduling of Public Transport Lisboa 1993.

2000

[47] F. Frati. Ottimizzazione della sequenza di scarichi di gas naturale liquido. Technical report, Note del Polo - Progetti n.3 - stage at SNAM - San Donato Milanese (MI)., June 2000.
[46] M. Milesi. Minimum spanning tree: confronto tra gli algoritmi di kruskal e prim. Technical report, Note del Polo - Progetti n.4, October 2000.
[45] G. Righini. Approximation algorithms for the vehicle routing problem with pick-up and delivery. Technical report, Note del Polo - Ricerca n.33, July 2000.
[44] G. Righini. Guida alla realizzazione di algoritmi ``branch-and-bound. newblock Technical report, Note del Polo - Rapporti interni n.5, Dipartimento di Tecnologie dell'Informazione, Universit`a degli Studi di Milano, March 2000.
[43] G. Righini. The largest insertion algorithm for the traveling salesman problem. Technical report, Note del Polo - Ricerca n.29, May 2000.

1999

[42] A. Colorni and G. Righini. Modelling and optimizing dynamic dial-a-ride problems. Technical report, Note del Polo - Ricerca n.15, June 1999.
[41] G. Righini. Bidirectional dijkstra's algorithm. Technical report, Note del Polo - Ricerca n.14, June 1999.
[40] G. Righini. Giornata ``scacchi e informatica 1997. newblock Technical report, Note del Polo - Rapporti Interni n.1, Dipartimento di Tecnologie dell'Informazione, Universit`a degli Studi di Milano, June 1999. newblock proceedings of the workshop - 27 June 1997, in Italian.
[39] G. Righini. Piccola guida alla stesura di una relazione scientifica. Technical report, Note del Polo - Rapporti Interni n.3, Dipartimento di Tecnologie dell'Informazione, Università degli Studi di Milano, April 1999. In italian.
[38] G. Righini and M.Trubian. On the approximation of the asymmetric traveling salesman problem. Technical report, Note del Polo - Ricerca n.24, December 1999.
[37] G. Righini and M. Trubian. Data-dependent bounds for the general and the asymmetric stacker-crane problems. Discrete Applied Mathematics 91, pages 235-242, 1999. Presented at CO 94 Amsterdam 1994.

1998

[36] G. Righini. Giornata ``scacchi e informatica 1998. newblock Technical report, Note del Polo - Rapporti Interni n.2, Dipartimento di Tecnologie dell'Informazione, Universit`a degli Studi di Milano, March 1998. newblock In italian.
[35] G. Righini. Shortest paths without u-turns. Technical report, Note del Polo - Ricerca n.9, December 1998.