Roberto Montemanni
Orcid: 0000-0002-0229-0465
  According to our database1,
  Roberto Montemanni
  authored at least 106 papers
  between 2001 and 2025.
  
  
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
  2025
    EURO J. Comput. Optim., 2025
    
  
    Comput. Oper. Res., 2025
    
  
    Comput. Oper. Res., 2025
    
  
    Algorithms, 2025
    
  
  2024
    Comput. Oper. Res., March, 2024
    
  
Compact Models to Solve the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times.
    
  
    Algorithms, 2024
    
  
    Proceedings of the Industrial Engineering and Applications - Europe, 2024
    
  
Combining Heuristics and Constraint Programming for the Parallel Drone Scheduling Vehicle Routing Problem with Collective Drones.
    
  
    Proceedings of the Metaheuristics - 15th International Conference, 2024
    
  
Enhancing Real-World Applicability in Home Healthcare: A Metaheuristic Approach for Advanced Routing and Scheduling.
    
  
    Proceedings of the Metaheuristics - 15th International Conference, 2024
    
  
  2023
A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem.
    
  
    Comput. Oper. Res., August, 2023
    
  
    EURO J. Comput. Optim., January, 2023
    
  
Constraint programming models for the parallel drone scheduling vehicle routing problem.
    
  
    EURO J. Comput. Optim., January, 2023
    
  
Solving the Parallel Drone Scheduling Traveling Salesman Problem via Constraint Programming.
    
  
    Algorithms, January, 2023
    
  
Modelling and Solving the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting-Times.
    
  
    Proceedings of the 18th Conference on Computer Science and Intelligence Systems, 2023
    
  
  2022
    J. Optim. Theory Appl., 2022
    
  
    Int. Trans. Oper. Res., 2022
    
  
A decision support tool for intelligent manufacturing systems via an elevator kinematic optimisation based method.
    
  
    Expert Syst. Appl., 2022
    
  
    EURO J. Comput. Optim., 2022
    
  
AMR-Assisted Order Picking: Models for Picker-to-Parts Systems in a Two-Blocks Warehouse.
    
  
    Algorithms, 2022
    
  
  2021
Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem.
    
  
    Optim. Lett., 2021
    
  
    Networks, 2021
    
  
Benchmark Instances and Optimal Solutions for the Traveling Salesman Problem with Drone.
    
  
    CoRR, 2021
    
  
    Comput. Oper. Res., 2021
    
  
The Buy-Online-Pick-Up-in-Store Retailing Model: Optimization Strategies for In-Store Picking and Packing.
    
  
    Algorithms, 2021
    
  
A New Constructive Heuristic Driven by Machine Learning for the Traveling Salesman Problem.
    
  
    Algorithms, 2021
    
  
Machine Learning Constructives and Local Searches for the Travelling Salesman Problem.
    
  
    Proceedings of the Operations Research Proceedings 2021, Selected Papers of the International Conference of the Swiss, German and Austrian Operations Research Societies (SVOR/ASRO, GOR e.V., ÖGOR), University of Bern, Switzerland, August 31, 2021
    
  
    Proceedings of the Operations Research Proceedings 2021, Selected Papers of the International Conference of the Swiss, German and Austrian Operations Research Societies (SVOR/ASRO, GOR e.V., ÖGOR), University of Bern, Switzerland, August 31, 2021
    
  
    Proceedings of the Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems, 2021
    
  
  2020
Matheuristic algorithms for the parallel drone scheduling traveling salesman problem.
    
  
    Ann. Oper. Res., 2020
    
  
    Algorithms, 2020
    
  
  2019
Steepest ant sense algorithm for parameter optimisation of multi-response processes based on taguchi design.
    
  
    J. Intell. Manuf., 2019
    
  
    Int. J. Metaheuristics, 2019
    
  
    Proceedings of the 2nd International Conference on Machine Learning and Machine Intelligence, 2019
    
  
  2018
Machine Learning and Monte Carlo Sampling for the Probabilistic Orienteering Problem.
    
  
    Proceedings of the 2018 Joint 10th International Conference on Soft Computing and Intelligent Systems (SCIS) and 19th International Symposium on Advanced Intelligent Systems (ISIS), 2018
    
  
  2017
    PLoS Comput. Biol., 2017
    
  
    Proceedings of the 2017 IEEE Symposium Series on Computational Intelligence, 2017
    
  
A Fast Prize-Collecting Steiner Forest Algorithm for Functional Analyses in Biological Networks.
    
  
    Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017
    
  
  2016
A divide and conquer matheuristic algorithm for the Prize-collecting Steiner Tree Problem.
    
  
    Comput. Oper. Res., 2016
    
  
    Proceedings of the New Advances in Information Systems and Technologies, 2016
    
  
A Sampling-Based Metaheuristic for the Orienteering Problem with Stochastic Travel Times.
    
  
    Proceedings of the Theory and Practice of Natural Computing - 5th International Conference, 2016
    
  
    Proceedings of the 2016 Joint 8th International Conference on Soft Computing and Intelligent Systems (SCIS) and 17th International Symposium on Advanced Intelligent Systems (ISIS), 2016
    
  
Integrated home health care optimization via genetic algorithms and mathematical programming.
    
  
    Proceedings of the IEEE Congress on Evolutionary Computation, 2016
    
  
  2015
    Proceedings of the ICT Innovations for Sustainability, 2015
    
  
A Comparison of Heuristic Methods for the Prize-Collecting Steiner Tree Problem and Their Application in Genomics.
    
  
    Proceedings of the Operations Research Proceedings 2015, 2015
    
  
  2014
Thermodynamic Post-Processing versusGC-Content Pre-Processing for DNA CodesSatisfying the Hamming Distance andReverse-Complement Constraints.
    
  
    IEEE ACM Trans. Comput. Biol. Bioinform., 2014
    
  
Sampling-Based Objective Function Evaluation Techniques for the Orienteering Problem with Stochastic Travel and Service Times.
    
  
    Proceedings of the Operations Research Proceedings 2014, 2014
    
  
    Proceedings of the Dynamics in Logistics, 2014
    
  
  2013
A metaheuristic framework for stochastic combinatorial optimization problems based on GPGPU with a case study on the probabilistic traveling salesman problem with deadlines.
    
  
    J. Parallel Distributed Comput., 2013
    
  
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling.
    
  
    Comput. Oper. Res., 2013
    
  
An ant colony system for the capacitated vehicle routing problem with uncertain travel costs.
    
  
    Proceedings of the 2013 IEEE Symposium on Swarm Intelligence, 2013
    
  
    Proceedings of the IEEE International Conference on Systems, 2013
    
  
An Improved Heuristic for the Probabilistic Traveling Salesman Problem with Deadlines Based on GPGPU.
    
  
    Proceedings of the Computer Aided Systems Theory - EUROCAST 2013, 2013
    
  
  2012
    Electron. J. Comb., 2012
    
  
    Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
    
  
    Proceedings of the Bio-Inspired Models of Network, Information, and Computing Systems, 2012
    
  
  2011
A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks.
    
  
    Math. Methods Oper. Res., 2011
    
  
A Linear Programming-based Evolutionary Algorithm for the Minimum Power Broadcast Problem in Wireless Sensor Networks.
    
  
    J. Math. Model. Algorithms, 2011
    
  
Linear and nonlinear constructions of DNA codes with Hamming distance d and constant GC-content.
    
  
    Discret. Math., 2011
    
  
    Comput. Oper. Res., 2011
    
  
    Comput. Optim. Appl., 2011
    
  
    Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011
    
  
    Proceedings of the Large-Scale Scientific Computing - 8th International Conference, 2011
    
  
Using Statistical Tests for Improving State-of-the-Art Heuristics for the Probabilistic Traveling Salesman Problem with Deadlines.
    
  
    Proceedings of the Computer Aided Systems Theory - EUROCAST 2011, 2011
    
  
  2010
Integer Programming Formulations for Maximum Lifetime Broadcasting Problems in Wireless Sensor Networks.
    
  
    Wirel. Sens. Netw., 2010
    
  
An exact algorithm for the Minimum Power Multicasting Problem in Wireless Sensor Networks.
    
  
    Electron. Notes Discret. Math., 2010
    
  
    Electron. Notes Discret. Math., 2010
    
  
    Comput. Oper. Res., 2010
    
  
  2009
    IEEE Trans. Inf. Theory, 2009
    
  
    Int. J. Simul. Process. Model., 2009
    
  
Maximum Lifetime Broadcasting Topologies in Wireless Sensor Networks: Advanced Mathematical Programming Models.
    
  
    Proceedings of the 42st Hawaii International International Conference on Systems Science (HICSS-42 2009), 2009
    
  
  2008
    Wirel. Networks, 2008
    
  
Construction of Constant GC-Content DNA Codes via a Variable Neighbourhood Search Algorithm.
    
  
    J. Math. Model. Algorithms, 2008
    
  
Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks.
    
  
    Eur. J. Oper. Res., 2008
    
  
    Eur. J. Oper. Res., 2008
    
  
    Comput. Oper. Res., 2008
    
  
Power-Optimized Topology Formation and Configuration in Bluetooth Sensor Networks: An Experimental Approach.
    
  
    Ad Hoc Sens. Wirel. Networks, 2008
    
  
  2007
    IEEE Trans. Veh. Technol., 2007
    
  
A Mixed Integer Programming Formulation for the Total Flow Time Single Machine Robust Scheduling Problem with Interval Data.
    
  
    J. Math. Model. Algorithms, 2007
    
  
    Proceedings of the 2007 IEEE Swarm Intelligence Symposium, 2007
    
  
  2006
    ACM Trans. Auton. Adapt. Syst., 2006
    
  
A Benders decomposition approach for the robust spanning tree problem with interval data.
    
  
    Eur. J. Oper. Res., 2006
    
  
  2005
A branch and bound algorithm for the robust spanning tree problem with interval data.
    
  
    Eur. J. Oper. Res., 2005
    
  
Exact algorithms for the minimum power symmetric connectivity problem in wireless networks.
    
  
    Comput. Oper. Res., 2005
    
  
    4OR, 2005
    
  
The minimum power broadcast problem in wireless networks: a simulated annealing approach.
    
  
    Proceedings of the IEEE Wireless Communications and Networking Conference, 2005
    
  
    Proceedings of the 2005 IEEE Swarm Intelligence Symposium, 2005
    
  
Power-Aware Distributed Protocol for a Connectivity Problem in Wireless Sensor Networks.
    
  
    Proceedings of the Self-star Properties in Complex Information Systems, 2005
    
  
    Proceedings of the Handbook on Theoretical and Algorithmic Aspects of Sensor, 2005
    
  
  2004
A branch and bound algorithm for the robust shortest path problem with interval data.
    
  
    Oper. Res. Lett., 2004
    
  
An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem.
    
  
    Eur. J. Oper. Res., 2004
    
  
    Comput. Oper. Res., 2004
    
  
    Proceedings of the Mobile and Wireless Communication Networks, 2004
    
  
  2003
An improved tabu search algorithm for the fixed-spectrum frequency-assignment problem.
    
  
    IEEE Trans. Veh. Technol., 2003
    
  
    4OR, 2003
    
  
  2002
An ANTS algorithm for the minimum-span frequency-assignment problem with multiple interference.
    
  
    IEEE Trans. Veh. Technol., 2002
    
  
  2001