[1] | Montemanni and V. Leggieri, A Branch and Price Algorithm for the Minimum Power Multicasting Problem in Wireless Sensor Networks, Mathematical Methods of Operations Research, to appear |
[2] | D.H. Smith and R. Montemanni, A new table of permutation codes, Designs, Codes and Cryptography, to appear [New codes] |
[3] | R. Montemanni and N.E. Toklu, S.C. Toklu and Y.C. Toklu, Aggregate Blending via robust linear programming, ASCE Journal of Construction Engineering and Management, to appear |
[4] | R. Montemanni and P. Mahdabi, A Linear Programming-based Evolutionary Algorithm for the Minimum Power Broadcast problem in Wireless Networks, Journal of Mathematical Modelling and Algorithms 10(2), 145-162, 2011 |
[5] | D. Anghinolfi, R. Montemanni, M. Paolucci and L.M. Gambardella, A Hybrid Particle Swarm Optimization approach for the Sequential Ordering Problem, Computers and Operations Research 38(7), 1076-1085, 2011 |
[6] | R. Montemanni, Integer Programming Formulations for Maximum Lifetime Broadcasting Problems in Wireless Sensor Networks, Wireless Sensor Network 2, 924-935, 2010 |
[7] | D.H. Smith, N. Aboluion, R. Montemanni and S. Perkins, Linear and Nonlinear Constructions of DNA Codes with Hamming distance d and constant GC-content, Discrete Mathematics 311(14), 1207-1219, 2011 |
[8] | J. Barta, V. Leggieri, R. Montemanni, P. Nobili and C. Triki, Some valid inequalities for the Probabilistic Minimum Power Multicasting Problem, Electronic Notes in Discrete Mathematics 36, 463-470, 2010 |
[9] | R. Montemanni and V. Leggieri, An Exact algorithm for the minimum power multicasting problem in wireless sensor networks, Electronic Notes in Discrete Mathematics 36, 215-222, 2010 |
[10] | R. Montemanni, D.H. Smith, A.E. Rizzoli and L.M. Gambardella, Sequential Ordering Problems for Crane Scheduling in Port Terminals, International Journal of Simulation and Process Modelling 5(4), 348-361, 2009 |
[11] | R. Montemanni and L.M. Gambardella, An Ant Colony System for Team Orienteering Problems with Time Windows, Foundations of Computing and Decision Sciences 34(4), 287-306, 2009 |
[12] | J. Barta, V. Leggieri, R. Montemanni, P. Nobili and C. Triki, Minimum Power Multicasting in Wireless Networks under Probabilistic Node Failures, Computational Optimization and Applications 49(1), 193-212, 2011 |
[13] | R. Montemanni and D.H. Smith, Heuristic Algorithms for Constructing Binary Constant Weight Codes, IEEE Transactions on Information Theory 55(10), 4651-4656, 2009 [New codes] [Updated results] |
[14] | R. Montemanni and D.H. Smith, Heuristic manipulation, tabu search and frequency assignment, Computers and Operations Research 37(3), 543-551, 2010 |
[15] | R. Montemanni and D.H. Smith, Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm, Journal of Mathematical Modelling and Algorithms 7(3), 311-326, 2008 [New codes] |
[16] | R. Montemanni, V. Leggieri and C. Triki, Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks, European Journal of Operational Research 190(2), 578-585, 2008 |
[17] | R. Montemanni, D.H. Smith and L.M. Gambardella, A heuristic manipulation technique for the sequential ordering problem, Computers and Operations Research 35(12), 3931-3944, 2008 [Instances] |
[18] | A.E. Rizzoli, R. Montemanni, F. Oliverio and L.M. Gambardella Ant Colony Optimisation for real-world vehicle routing problems: from theory to applications, Swarm Intelligence 1(2), 135-151, 2007 |
[19] | J.S. Graham, R. Montemanni, J.N.J. Moon and D.H. Smith, Frequency assignment, multiple interference and binary constraints, Wireless Networks 14(4), 449-464, 2008 |
[20] | R. Montemanni, J. Barta, M. Mastrolilli and L.M. Gambardella, The robust traveling salesman problem with interval data, Transportation Science 41(3), 366-381, 2007 [Instances] |
[21] | L. Negri, D. Zanetti, R. Montemanni and S. Giordano, Power-optimized topology formation and configuration in Bluetooth sensor networks: an experimental approach, Ad Hoc & Sensor Wireless Networks 6 (1-2), 145-175, 2008 |
[22] | R. Montemanni, A mixed integer programming formulation for a single machine robust scheduling with interval data, Journal of Mathematical Modelling and Algorithms 6(2), 287-296, 2007 |
[23] | A.V. Donati, R. Montemanni, N. Casagrande, A.E. Rizzoli and L.M. Gambardella, Time dependent vehicle routine problem with a multi ant colony system, European Journal of Operational Research 185(3), 1174-1191, 2008 |
[24] | D.H. Smith, L.A. Hughes, J.N.J. Moon and R. Montemanni, Measuring the effectiveness of frequency assignment algorithms IEEE Transactions on Vehicular Technology 56(1), 331-341. 2007 |
[25] | R. Montemanni, A Benders decomposition approach for the robust spanning tree problem with interval data, European Journal of Operational Research 174(3), 1479-1490, 2006 |
[26] | O. Babaoglu, G. Canright, A. Deutsch, G. Di Caro, F. Ducatelle, L.M. Gambardella, N. Ganguly, M. Jelasity, R. Montemanni, A. Montresor and T. Urnes, Design patterns from biology for distributed computing, ACM Transactions on Autonomous and Adaptive Systems 1(1), 26-66, 2006 |
[27] | R. Montemanni and L.M. Gambardella, The robust shortest path problem with interval data via Benders decomposition, 4OR 3(4), 315-328, 2005 |
[28] | R. Montemanni, L.M. Gambardella, A.E. Rizzoli and A.V. Donati, Ant Colony system for a dynamic vehicle routing problem, Journal of Combinatorial Optimization 10, 327-343, 2005 |
[29] | R. Montemanni and L.M. Gambardella, Exact algorithms for the minimum power symmetric connectivity problem in wireless networks, Computers and Operations Research 32(11), 2891-2904, 2005 |
[30] | R. Montemanni and L.M. Gambardella, A branch and bound algorithm for the robust spanning tree problem with interval data, European Journal of Operational Research 161(3), 771-779, 2005 |
[31] | R. Montemanni and L.M. Gambardella, An exact algorithm for the robust shortest path problem with interval data, Computers and Operations Research 31(10), 1667-1680, 2004 |
[32] | R. Montemanni, D.H. Smith and S.M. Allen, An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem, European Journal of Operational Research 156(3), 736-751, 2004 |
[33] | R. Montemanni, L.M. Gambardella and A.V. Donati, A branch and bound algorithm for the robust shortest path problem with interval data, Operations Research Letters 32(3), 225-232, 2004 (19th Operations Research Letters-most downloaded paper from April 2002 to April 2004, although the paper was available for only a quarter of the period) |
[34] | R. Montemanni, Upper and lower bounds for the fixed spectrum frequency assignment problem, 4OR 1(3), 257-260, 2003. |
[35] | R. Montemanni, J.N.J. Moon and D.H. Smith, An improved tabu search algorithm for the fixed spectrum frequency assignment problem, IEEE Transactions on Vehicular Technology 52(4), 891-901, 2003 |
[36] | R. Montemanni, D.H. Smith and S.M. Allen, An ANTS algorithm for the minimum span frequency assignment problem with multiple interference, IEEE Transactions on Vehicular Technology 51(5), 949-953, 2002 |
[37] | R. Montemanni, D.H. Smith and S.M. Allen, Lower bounds for fixed spectrum frequency assignment, Annals of Operations Research 107, 237-250, 2001 |