Roberto Montemanni

112 papers B 4C 2Journal 77Unranked 27
YearRankTypeTitle / Venue / Authors
2025 J jnl
A Data-Driven Informatics Framework for Regional Sustainability: Integrating Twin Mean-Variance Two-Stage DEA with Decision Analytics.
Informatics
Pasura Aungkulanon, Roberto Montemanni, Atiwat Nanphang, Pongchanun Luangpaiboon
2025 J jnl
A compact model for the home healthcare routing and scheduling problem.
EURO J. Comput. Optim.
Roberto Montemanni, Sara Ceschia, Andrea Schaerf
2025 J jnl
A model-based algorithm for the Probabilistic Orienteering Problem.
Comput. Oper. Res.
Roberto Montemanni, Derek H. Smith
2025 J jnl
An Exact Algorithm for the Hazardous Orienteering Problem.
Networks
Roberto Montemanni, Derek H. Smith
2025 J jnl
Compact Models for Some Cluster Problems on Node-Colored Graphs.
Algorithms
Roberto Montemanni, Derek H. Smith, Pongchanun Luangpaiboon, Pasura Aungkulanon
2025 J jnl
Model-based algorithms for the 0-1 Time-Bomb Knapsack Problem.
Comput. Oper. Res.
Roberto Montemanni, Derek H. Smith
2025 J jnl
On Solving the Minimum Spanning Tree Problem with Conflicting Edge Pairs.
Algorithms
Roberto Montemanni, Derek H. Smith
2025 — conf
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts.
ICCSIT
Roberto Montemanni, Derek H. Smith
2024 — conf
Combining Heuristics and Constraint Programming for the Parallel Drone Scheduling Vehicle Routing Problem with Collective Drones.
MIC (1)
Roberto Montemanni, Mauro Dell'Amico, Andrea Corsini
2024 J jnl
Compact Models to Solve the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times.
Algorithms
Mauro Dell'Amico, Jafar Jamal, Roberto Montemanni
2024 — conf
Enhancing Real-World Applicability in Home Healthcare: A Metaheuristic Approach for Advanced Routing and Scheduling.
MIC (1)
Sara Ceschia, Luca Di Gaspero, Simona Mancini, Vittorio Maniezzo, Roberto Montemanni, Roberto Maria Rosati, Andrea Schaerf
2024 J jnl
On Solving the Set Orienteering Problem.
Symmetry
Roberto Montemanni, Derek H. Smith
2024 J jnl
Parallel drone scheduling vehicle routing problems with collective drones.
Comput. Oper. Res.
Roberto Montemanni, Mauro Dell'Amico, Andrea Corsini
2024 — conf
Picking Optimization in U-Shaped Corridors with a Movable Depot.
ICIEA-EU
Roberto Montemanni, Agnese Cervino, Francesco Lolli
2024 J jnl
Potential Subgraphs of the Missing Moore Graph.
Symmetry
Derek H. Smith, Roberto Montemanni
2023 J jnl
A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem.
Comput. Oper. Res.
Mauro Dell'Amico, Jafar Jamal, Roberto Montemanni
2023 J jnl
Constraint programming models for the parallel drone scheduling vehicle routing problem.
EURO J. Comput. Optim.
Roberto Montemanni, Mauro Dell'Amico
2023 C conf
Modelling and Solving the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting-Times.
FedCSIS
Mauro Dell'Amico, Jafar Jamal, Roberto Montemanni
2023 J jnl
Precedence-Constrained arborescences.
Eur. J. Oper. Res.
Xiaochen Chou, Mauro Dell'Amico, Jafar Jamal, Roberto Montemanni
2023 J jnl
Solving the Parallel Drone Scheduling Traveling Salesman Problem via Constraint Programming.
Algorithms
Roberto Montemanni, Mauro Dell'Amico
2023 J jnl
The missing Moore graph as an optimization problem.
EURO J. Comput. Optim.
Derek H. Smith, Roberto Montemanni
2022 J jnl
A decision support tool for intelligent manufacturing systems via an elevator kinematic optimisation based method.
Expert Syst. Appl.
Pongchanun Luangpaiboon, Pasura Aungkulanon, Roberto Montemanni
2022 J jnl
AMR-Assisted Order Picking: Models for Picker-to-Parts Systems in a Two-Blocks Warehouse.
Algorithms
Giulia Pugliese, Xiaochen Chou, Dominic Loske, Matthias Klumpp, Roberto Montemanni
2022 J jnl
Exact models for the flying sidekick traveling salesman problem.
Int. Trans. Oper. Res.
Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani
2022 J jnl
The Maximum Clique Problem for Permutation Hamming Graphs.
J. Optim. Theory Appl.
János Barta, Roberto Montemanni
2022 J jnl
Upper and lower bounds based on linear programming for the b-coloring problem.
EURO J. Comput. Optim.
Roberto Montemanni, Xiaochen Chou, Derek H. Smith
2021 J jnl
A New Constructive Heuristic Driven by Machine Learning for the Traveling Salesman Problem.
Algorithms
Umberto Junior Mele, Luca Maria Gambardella, Roberto Montemanni
2021 J jnl
A New Constructive Heuristic driven by Machine Learning for the Traveling Salesman Problem.
CoRR
Umberto Junior Mele, Luca Maria Gambardella, Roberto Montemanni
2021 J jnl
A Tabu Search algorithm for the Probabilistic Orienteering Problem.
Comput. Oper. Res.
Xiaochen Chou, Luca Maria Gambardella, Roberto Montemanni
2021 J jnl
Benchmark Instances and Optimal Solutions for the Traveling Salesman Problem with Drone.
CoRR
Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani
2021 J jnl
Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem.
Optim. Lett.
Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani
2021 — conf
Machine Learning Constructives and Local Searches for the Travelling Salesman Problem.
OR
Tommaso Vitali, Umberto Junior Mele, Luca Maria Gambardella, Roberto Montemanni
2021 J jnl
Machine Learning Constructives and Local Searches for the Travelling Salesman Problem.
CoRR
Tommaso Vitali, Umberto Junior Mele, Luca Maria Gambardella, Roberto Montemanni
2021 J jnl
Machine learning and combinatorial optimization, editorial.
OR Spectr.
Gianni A. Di Caro, Vittorio Maniezzo, Roberto Montemanni, Matteo Salani
2021 J jnl
Modeling the flying sidekick traveling salesman problem with multiple drones.
Networks
Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani
2021 — conf
Optimization Strategies for In-Store Order Picking in Omnichannel Retailing.
APMS (2)
Xiaochen Chou, Nicola Ognibene Pietri, Dominic Loske, Matthias Klumpp, Roberto Montemanni
2021 J jnl
The Buy-Online-Pick-Up-in-Store Retailing Model: Optimization Strategies for In-Store Picking and Packing.
Algorithms
Nicola Ognibene Pietri, Xiaochen Chou, Dominic Loske, Matthias Klumpp, Roberto Montemanni
2021 — conf
The Picking and Packing Problem in Buy-Online-Pick-up-in-Store Retailing.
OR
Nicola Ognibene Pietri, Xiaochen Chou, Dominic Loske, Matthias Klumpp, Jafar Jamal, Roberto Montemanni
2020 J jnl
Matheuristic algorithms for the parallel drone scheduling traveling salesman problem.
Ann. Oper. Res.
Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani
2020 J jnl
The Use of an Exact Algorithm within a Tabu Search Maximum Clique Algorithm.
Algorithms
Derek H. Smith, Roberto Montemanni, Stephanie Perkins
2019 — conf
A Metaheuristic Algorithm for the Probabilistic Orienteering Problem.
MLMI
Xiaochen Chou, Luca Maria Gambardella, Roberto Montemanni
2019 J jnl
Solving the maximum clique problem with a hybrid algorithm.
Int. J. Metaheuristics
Derek H. Smith, Stephanie Perkins, Roberto Montemanni
2019 J jnl
Steepest ant sense algorithm for parameter optimisation of multi-response processes based on taguchi design.
J. Intell. Manuf.
Pongchanun Luangpaiboon, S. Boonhao, Roberto Montemanni
2018 — conf
Machine Learning and Monte Carlo Sampling for the Probabilistic Orienteering Problem.
SCIS&ISIS
Roberto Montemanni, Federico D'ignazio, Xiaochen Chou, Luca Maria Gambardella
2017 B conf
A Fast Prize-Collecting Steiner Forest Algorithm for Functional Analyses in Biological Networks.
CPAIOR
Murodzhon Akhmedov, Alexander LeNail, Francesco Bertoni, Ivo Kwee, Ernest Fraenkel, Roberto Montemanni
2017 J jnl
PCSF: An R-package for network-based interpretation of high-throughput data.
PLoS Comput. Biol.
Murodzhon Akhmedov, Amanda J. Kedaigle, Renan Escalante Chong, Roberto Montemanni, Francesco Bertoni, Ernest Fraenkel, Ivo Kwee
2017 — conf
Solving the sequential ordering problem using branch and bound.
SSCI
Jafar Jamal, Ghassan Shobaki, Vassilis Papapanagiotou, Luca Maria Gambardella, Roberto Montemanni
2016 — conf
A Sampling-Based Metaheuristic for the Orienteering Problem with Stochastic Travel Times.
TPNC
Vassilis Papapanagiotou, Roberto Montemanni, Luca Maria Gambardella
2016 J jnl
A divide and conquer matheuristic algorithm for the Prize-collecting Steiner Tree Problem.
Comput. Oper. Res.
Murodzhon Akhmedov, Ivo Kwee, Roberto Montemanni
2016 — conf
Comparison of Objective Function Evaluators for a Stochastic Orienteering Problem.
SCIS&ISIS
Vassilis Papapanagiotou, Roberto Montemanni, Luca Maria Gambardella
2016 — conf
Graph Colouring and Branch and Bound Approaches for Permutation Code Algorithms.
WorldCIST (1)
Roberto Montemanni, János Barta, Derek H. Smith
2016 B conf
Integrated home health care optimization via genetic algorithms and mathematical programming.
CEC
Thi Viet Ly Nguyen, Roberto Montemanni
2015 — conf
A Comparison of Heuristic Methods for the Prize-Collecting Steiner Tree Problem and Their Application in Genomics.
OR
Murodzhon Akhmedov, Ivo Kwee, Roberto Montemanni
2015 — ch.
Software Support for Sustainable Supply Chain Configuration and Management.
ICT Innovations for Sustainability
Andrea Emilio Rizzoli, Roberto Montemanni, Andrea Bettoni, Luca Canetta
2014 — conf
Green Bullwhip Effect Cost Simulation in Distribution Networks.
LDIC
Matthias Klumpp, Nihat Engin Toklu, Vassilis Papapanagiotou, Roberto Montemanni, Luca Maria Gambardella
2014 — conf
Sampling-Based Objective Function Evaluation Techniques for the Orienteering Problem with Stochastic Travel and Service Times.
OR
Vassilis Papapanagiotou, Roberto Montemanni, Luca Maria Gambardella
2014 J jnl
Thermodynamic Post-Processing versusGC-Content Pre-Processing for DNA CodesSatisfying the Hamming Distance andReverse-Complement Constraints.
IEEE ACM Trans. Comput. Biol. Bioinform.
Dan Tulpan, Derek H. Smith, Roberto Montemanni
2013 B conf
A Robust Multiple Ant Colony System for the Capacitated Vehicle Routing Problem.
SMC
N. E. Toklu, Roberto Montemanni, Luca Maria Gambardella
2013 J jnl
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.
Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella
2013 — conf
An Improved Heuristic for the Probabilistic Traveling Salesman Problem with Deadlines Based on GPGPU.
EUROCAST (1)
Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella
2013 — conf
An ant colony system for the capacitated vehicle routing problem with uncertain travel costs.
SIS
N. E. Toklu, Roberto Montemanni, Luca Maria Gambardella
2013 J jnl
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling.
Comput. Oper. Res.
Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella
2013 J jnl
Permutation codes with specified packing radius.
Des. Codes Cryptogr.
Derek H. Smith, Roberto Montemanni
2012 J jnl
A new table of permutation codes.
Des. Codes Cryptogr.
Derek H. Smith, Roberto Montemanni
2012 — conf
An Enhanced Ant Colony System for the Probabilistic Traveling Salesman Problem.
BIONETICS
Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella
2012 J jnl
Coupling ant colony systems with strong local searches.
Eur. J. Oper. Res.
Luca Maria Gambardella, Roberto Montemanni, Dennis Weyland
2012 C conf
Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines.
ISCO
Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella
2012 J jnl
Some Constant Weight Codes from Primitive Permutation Groups.
Electron. J. Comb.
Derek H. Smith, Roberto Montemanni
2011 J jnl
A Linear Programming-based Evolutionary Algorithm for the Minimum Power Broadcast Problem in Wireless Sensor Networks.
J. Math. Model. Algorithms
Roberto Montemanni, Parvaz Mahdabi
2011 — conf
A Matheuristic Algorithm for a Large-Scale Energy Management Problem.
LSSC
Davide Anghinolfi, Luca Maria Gambardella, Roberto Montemanni, Cristiano Nattero, Massimo Paolucci, N. E. Toklu
2011 J jnl
A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks.
Math. Methods Oper. Res.
Roberto Montemanni, Valeria Leggieri
2011 J jnl
A hybrid particle swarm optimization approach for the sequential ordering problem.
Comput. Oper. Res.
Davide Anghinolfi, Roberto Montemanni, Massimo Paolucci, Luca Maria Gambardella
2011 — conf
An Enhanced Ant Colony System for the Sequential Ordering Problem.
OR
Luca Maria Gambardella, Roberto Montemanni, Dennis Weyland
2011 J jnl
Linear and nonlinear constructions of DNA codes with Hamming distance d and constant GC-content.
Discret. Math.
Derek H. Smith, Niema Aboluion, Roberto Montemanni, Stephanie Perkins
2011 J jnl
Minimum power multicasting in wireless networks under probabilistic node failures.
Comput. Optim. Appl.
János Barta, Valeria Leggieri, Roberto Montemanni, Paolo Nobili, Chefi Triki
2011 — conf
Using Statistical Tests for Improving State-of-the-Art Heuristics for the Probabilistic Traveling Salesman Problem with Deadlines.
EUROCAST (1)
Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella
2010 J jnl
An exact algorithm for the Minimum Power Multicasting Problem in Wireless Sensor Networks.
Electron. Notes Discret. Math.
Roberto Montemanni, Valeria Leggieri
2010 J jnl
Heuristic manipulation, tabu search and frequency assignment.
Comput. Oper. Res.
Roberto Montemanni, Derek H. Smith
2010 J jnl
Integer Programming Formulations for Maximum Lifetime Broadcasting Problems in Wireless Sensor Networks.
Wirel. Sens. Netw.
Roberto Montemanni
2010 J jnl
Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem.
Electron. Notes Discret. Math.
János Barta, Valeria Leggieri, Roberto Montemanni, Paolo Nobili, Chefi Triki
2009 J jnl
Heuristic algorithms for constructing binary constant weight codes.
IEEE Trans. Inf. Theory
Roberto Montemanni, Derek H. Smith
2009 — conf
Maximum Lifetime Broadcasting Topologies in Wireless Sensor Networks: Advanced Mathematical Programming Models.
HICSS
Roberto Montemanni
2009 J jnl
Sequential ordering problems for crane scheduling in port terminals.
Int. J. Simul. Process. Model.
Roberto Montemanni, Derek H. Smith, Andrea Emilio Rizzoli, Luca Maria Gambardella
2008 J jnl
A heuristic manipulation technique for the sequential ordering problem.
Comput. Oper. Res.
Roberto Montemanni, D. H. Smith, Luca Maria Gambardella
2008 J jnl
Construction of Constant GC-Content DNA Codes via a Variable Neighbourhood Search Algorithm.
J. Math. Model. Algorithms
Roberto Montemanni, Derek H. Smith
2008 J jnl
Frequency assignment, multiple interference and binary constraints.
Wirel. Networks
J. S. Graham, Roberto Montemanni, Jim N. J. Moon, D. H. Smith
2008 J jnl
Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks.
Eur. J. Oper. Res.
Roberto Montemanni, Valeria Leggieri, Chefi Triki
2008 J jnl
Power-Optimized Topology Formation and Configuration in Bluetooth Sensor Networks: An Experimental Approach.
Ad Hoc Sens. Wirel. Networks
Luca Negri, Davide Zanetti, Roberto Montemanni, Silvia Giordano
2008 J jnl
Time dependent vehicle routing problem with a multi ant colony system.
Eur. J. Oper. Res.
Alberto V. Donati, Roberto Montemanni, Norman Casagrande, Andrea Emilio Rizzoli, Luca Maria Gambardella
2007 J jnl
A Mixed Integer Programming Formulation for the Total Flow Time Single Machine Robust Scheduling Problem with Interval Data.
J. Math. Model. Algorithms
Roberto Montemanni
2007 — conf
Ant Colony Systems for Large Sequential Ordering Problems.
SIS
Roberto Montemanni, Derek H. Smith, Luca Maria Gambardella
2007 J jnl
Ant colony optimization for real-world vehicle routing problems.
Swarm Intell.
Andrea Emilio Rizzoli, Roberto Montemanni, Enzo Lucibello, Luca Maria Gambardella
2007 J jnl
Measuring the Effectiveness of Frequency Assignment Algorithms.
IEEE Trans. Veh. Technol.
Derek H. Smith, Lesley A. Hughes, Jim N. J. Moon, Roberto Montemanni
2007 J jnl
The Robust Traveling Salesman Problem with Interval Data.
Transp. Sci.
Roberto Montemanni, János Barta, Monaldo Mastrolilli, Luca Maria Gambardella
2006 J jnl
A Benders decomposition approach for the robust spanning tree problem with interval data.
Eur. J. Oper. Res.
Roberto Montemanni
2006 J jnl
Design patterns from biology for distributed computing.
ACM Trans. Auton. Adapt. Syst.
Özalp Babaoglu, Geoffrey Canright, Andreas Deutsch, Gianni Di Caro, Frederick Ducatelle, Luca Maria Gambardella, Niloy Ganguly, Márk Jelasity, Roberto Montemanni, Alberto Montresor, Tore Urnes
2005 J jnl
A branch and bound algorithm for the robust spanning tree problem with interval data.
Eur. J. Oper. Res.
Roberto Montemanni, Luca Maria Gambardella
2005 J jnl
Ant Colony System for a Dynamic Vehicle Routing Problem.
J. Comb. Optim.
Roberto Montemanni, Luca Maria Gambardella, Andrea Emilio Rizzoli, Alberto V. Donati
2005 J jnl
Exact algorithms for the minimum power symmetric connectivity problem in wireless networks.
Comput. Oper. Res.
Roberto Montemanni, Luca Maria Gambardella
2005 — ch.
Models and Algorithms for the MPSCP.
Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks
Roberto Montemanni, Luca Maria Gambardella, Arindam Kumar Das
2005 — conf
Power-Aware Distributed Protocol for a Connectivity Problem in Wireless Sensor Networks.
Self-star Properties in Complex Information Systems
Roberto Montemanni, Luca Maria Gambardella
2005 — conf
Swarm approach for a connectivity problem in wireless networks.
SIS
Roberto Montemanni, Luca Maria Gambardella
2005 B conf
The minimum power broadcast problem in wireless networks: a simulated annealing approach.
WCNC
Roberto Montemanni, Luca Maria Gambardella, Arindam Kumar Das
2005 J jnl
The robust shortest path problem with interval data via Benders decomposition.
4OR
Roberto Montemanni, Luca Maria Gambardella
2004 J jnl
A branch and bound algorithm for the robust shortest path problem with interval data.
Oper. Res. Lett.
Roberto Montemanni, Luca Maria Gambardella, Alberto V. Donati
2004 J jnl
An exact algorithm for the robust shortest path problem with interval data.
Comput. Oper. Res.
Roberto Montemanni, Luca Maria Gambardella
2004 J jnl
An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem.
Eur. J. Oper. Res.
Roberto Montemanni, D. H. Smith, Stuart M. Allen
2004 — conf
Minimum Power Symmetric Connectivity Problem in Wireless Networks: A New Approach.
MWCN
Roberto Montemanni, Luca Maria Gambardella
2003 J jnl
An improved tabu search algorithm for the fixed-spectrum frequency-assignment problem.
IEEE Trans. Veh. Technol.
Roberto Montemanni, Jim N. J. Moon, Derek H. Smith
2003 J jnl
Upper and lower bounds for the fixed spectrum frequency assignment problem.
4OR
Roberto Montemanni
2002 J jnl
An ANTS algorithm for the minimum-span frequency-assignment problem with multiple interference.
IEEE Trans. Veh. Technol.
Roberto Montemanni, Derek H. Smith, Stuart M. Allen
2001 J jnl
Lower Bounds for Fixed Spectrum Frequency Assignment.
Ann. Oper. Res.
Roberto Montemanni, D. H. Smith, Stuart M. Allen