Back
Return
Biography
Dr. Roberto Montemanni

Prof. Roberto Montemanni

Dalle Molle Institute for Artificial Intelligence (IDSIA)

Switzerland


Email: roberto@idsia.ch


Qualifications

2002  Ph.D., University of Glamorgan, UK


Publications (Selected)


  1. 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, December 2007.
  2. 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, August 2008.
  3. R. Montemanni, J. Barta, M. Mastrolilli and L.M. Gambardella. The robust traveling salesman problem with interval data. Transportation Science, 41(3), 366-381, August 2007.
  4. 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.
  5. 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, June 2007.
  6. 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, March 2008.
  7. 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. January 2007.
  8. R. Montemanni. A Benders decomposition approach for the robust spanning tree problem with interval data, European Journal of Operational Research, 174(3), 1479-1490, November 2006.
  9. 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, September 2006.
  10. R. Montemanni and L.M. Gambardella. The robust shortest path problem with interval data via Benders decomposition, 4OR, 3(4), 315-328, December 2005.
  11. 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, December 2005.
  12. 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, November 2005.
  13. 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, March 2005.
  14. 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, September 2004.
  15. 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, August 2004.
  16. 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, May 2004.
  17. R. Montemanni. Upper and lower bounds for the fixed spectrum frequency assignment problem. 4OR, 1(3), 257-260, September 2003.
  18. 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, July 2003.
  19. 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, September 2002.
  20. R. Montemanni, D.H. Smith and S.M. Allen. Lower bounds for fixed spectrum frequency assignment. Annals of Operations Research 107, 237-250, October 2001.
  21. R. Montemanni, D.H. Smith and N. Koul. Three metaheuristics for the construction of Constant GC-content DNA codes. In Post-Proceedings of the VIII Metaheuristic International Conference, S. Voβ and M. Caserta eds., Springer, to appear.
  22. R. Montemanni, L.M. Gambardella and A.K. Das. Models and algorithms for the Minimum Power Symmetric Connectivity Problem: an overview. In Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks, J. Wu ed., Auerbach Publications, 133-146, 2006.
  23. R. Montemanni and L.M. Gambardella. Power-aware distributed protocol for a connectivity problem in wireless sensor networks. In Self-Star Properties in Complex Information Systems. Lecture Notes in Computer Science 3460, O. Babaoglu et al. eds., Springer, 403-416, 2005.
  24. R. Montemanni and L.M. Gambardella. Minimum power symmetric connectivity problem in wireless networks: a new approach. InMobileand wireless communications networks. Series: IFIP International Federation for Information Processing, 162(8),  E.M. Belding-Royer, K. Al Agha, G. Pujolle eds., Springer, 496-508, 2004.
  25. R. Montemanni and P. Mahdabi. An Evolutionary Algorithm for a topology problem in Wireless Sensor Networks. Proceedings of Matheuristics 2010 - third international workshop on model-based metaheuristics, pages 140-151,Vienna,Austria, 28-30 June 2010.