Lower Bounds for Fixed Spectrum Frequency Assignment. - Roberto Montemanni; D. H. Smith; Stuart M. Allen (Ann. Oper. Res., 2001)

An ANTS algorithm for the minimum-span frequency-assignment problem with multiple interference. - Roberto Montemanni; Derek H. Smith; Stuart M. Allen (IEEE Trans. Veh. Technol., 2002)

Upper and lower bounds for the fixed spectrum frequency assignment problem. - Roberto Montemanni (4OR, 2003)

An improved tabu search algorithm for the fixed-spectrum frequency-assignment problem. - Roberto Montemanni; Jim N. J. Moon; Derek H. Smith (IEEE Trans. Veh. Technol., 2003)

Minimum Power Symmetric Connectivity Problem in Wireless Networks: A New Approach. - Roberto Montemanni; Luca Maria Gambardella (MWCN, 2004)

An exact algorithm for the robust shortest path problem with interval data. - Roberto Montemanni; Luca Maria Gambardella (Comput. Oper. Res., 2004)

An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem. - Roberto Montemanni; D. H. Smith; Stuart M. Allen (Eur. J. Oper. Res., 2004)

A branch and bound algorithm for the robust shortest path problem with interval data. - Roberto Montemanni; Luca Maria Gambardella; Alberto V. Donati (Oper. Res. Lett., 2004)

Models and Algorithms for the MPSCP. - Roberto Montemanni; Luca Maria Gambardella; Arindam Kumar Das (Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks, 2005)

Power-Aware Distributed Protocol for a Connectivity Problem in Wireless Sensor Networks. - Roberto Montemanni; Luca Maria Gambardella (Self-star Properties in Complex Information Systems, 2005)

Swarm approach for a connectivity problem in wireless networks. - Roberto Montemanni; Luca Maria Gambardella (SIS, 2005)

The minimum power broadcast problem in wireless networks: a simulated annealing approach. - Roberto Montemanni; Luca Maria Gambardella; Arindam Kumar Das (WCNC, 2005)

The robust shortest path problem with interval data via Benders decomposition. - Roberto Montemanni; Luca Maria Gambardella (4OR, 2005)

Exact algorithms for the minimum power symmetric connectivity problem in wireless networks. - Roberto Montemanni; Luca Maria Gambardella (Comput. Oper. Res., 2005)

A branch and bound algorithm for the robust spanning tree problem with interval data. - Roberto Montemanni; Luca Maria Gambardella (Eur. J. Oper. Res., 2005)

Ant Colony System for a Dynamic Vehicle Routing Problem. - Roberto Montemanni; Luca Maria Gambardella; Andrea Emilio Rizzoli; Alberto V. Donati (J. Comb. Optim., 2005)

A Benders decomposition approach for the robust spanning tree problem with interval data. - Roberto Montemanni (Eur. J. Oper. Res., 2006)

Design patterns from biology for distributed computing. - Ö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 (ACM Trans. Auton. Adapt. Syst., 2006)

Ant Colony Systems for Large Sequential Ordering Problems. - Roberto Montemanni; Derek H. Smith; Luca Maria Gambardella (SIS, 2007)

A Mixed Integer Programming Formulation for the Total Flow Time Single Machine Robust Scheduling Problem with Interval Data. - Roberto Montemanni (J. Math. Model. Algorithms, 2007)

Ant colony optimization for real-world vehicle routing problems. - Andrea Emilio Rizzoli; Roberto Montemanni; Enzo Lucibello; Luca Maria Gambardella (Swarm Intell., 2007)

The Robust Traveling Salesman Problem with Interval Data. - Roberto Montemanni; János Barta; Monaldo Mastrolilli; Luca Maria Gambardella (Transp. Sci., 2007)

Measuring the Effectiveness of Frequency Assignment Algorithms. - Derek H. Smith; Lesley A. Hughes; Jim N. J. Moon; Roberto Montemanni (IEEE Trans. Veh. Technol., 2007)

Power-Optimized Topology Formation and Configuration in Bluetooth Sensor Networks: An Experimental Approach. - Luca Negri; Davide Zanetti; Roberto Montemanni; Silvia Giordano (Ad Hoc Sens. Wirel. Networks, 2008)

A heuristic manipulation technique for the sequential ordering problem. - Roberto Montemanni; D. H. Smith; Luca Maria Gambardella (Comput. Oper. Res., 2008)

Time dependent vehicle routing problem with a multi ant colony system. - Alberto V. Donati; Roberto Montemanni; Norman Casagrande; Andrea Emilio Rizzoli; Luca Maria Gambardella (Eur. J. Oper. Res., 2008)

Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks. - Roberto Montemanni; Valeria Leggieri; Chefi Triki (Eur. J. Oper. Res., 2008)

Construction of Constant GC-Content DNA Codes via a Variable Neighbourhood Search Algorithm. - Roberto Montemanni; Derek H. Smith (J. Math. Model. Algorithms, 2008)

Frequency assignment, multiple interference and binary constraints. - J. S. Graham; Roberto Montemanni; Jim N. J. Moon; D. H. Smith (Wirel. Networks, 2008)

Maximum Lifetime Broadcasting Topologies in Wireless Sensor Networks: Advanced Mathematical Programming Models. - Roberto Montemanni (HICSS, 2009)

Sequential ordering problems for crane scheduling in port terminals. - Roberto Montemanni; Derek H. Smith; Andrea Emilio Rizzoli; Luca Maria Gambardella (Int. J. Simul. Process. Model., 2009)

Heuristic algorithms for constructing binary constant weight codes. - Roberto Montemanni; Derek H. Smith (IEEE Trans. Inf. Theory, 2009)

Heuristic manipulation, tabu search and frequency assignment. - Roberto Montemanni; Derek H. Smith (Comput. Oper. Res., 2010)

Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem. - János Barta; Valeria Leggieri; Roberto Montemanni; Paolo Nobili; Chefi Triki (Electron. Notes Discret. Math., 2010)

An exact algorithm for the Minimum Power Multicasting Problem in Wireless Sensor Networks. - Roberto Montemanni; Valeria Leggieri (Electron. Notes Discret. Math., 2010)

Integer Programming Formulations for Maximum Lifetime Broadcasting Problems in Wireless Sensor Networks. - Roberto Montemanni (Wirel. Sens. Netw., 2010)

Using Statistical Tests for Improving State-of-the-Art Heuristics for the Probabilistic Traveling Salesman Problem with Deadlines. - Dennis Weyland; Roberto Montemanni; Luca Maria Gambardella (EUROCAST (1), 2011)

A Matheuristic Algorithm for a Large-Scale Energy Management Problem. - Davide Anghinolfi; Luca Maria Gambardella; Roberto Montemanni; Cristiano Nattero; Massimo Paolucci 002; N. E. Toklu (LSSC, 2011)

An Enhanced Ant Colony System for the Sequential Ordering Problem. - Luca Maria Gambardella; Roberto Montemanni; Dennis Weyland (OR, 2011)

Minimum power multicasting in wireless networks under probabilistic node failures. - János Barta; Valeria Leggieri; Roberto Montemanni; Paolo Nobili; Chefi Triki (Comput. Optim. Appl., 2011)

A hybrid particle swarm optimization approach for the sequential ordering problem. - Davide Anghinolfi; Roberto Montemanni; Massimo Paolucci 002; Luca Maria Gambardella (Comput. Oper. Res., 2011)

Linear and nonlinear constructions of DNA codes with Hamming distance d and constant GC-content. - Derek H. Smith; Niema Aboluion; Roberto Montemanni; Stephanie Perkins (Discret. Math., 2011)

A Linear Programming-based Evolutionary Algorithm for the Minimum Power Broadcast Problem in Wireless Sensor Networks. - Roberto Montemanni; Parvaz Mahdabi (J. Math. Model. Algorithms, 2011)

A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks. - Roberto Montemanni; Valeria Leggieri (Math. Methods Oper. Res., 2011)

An Enhanced Ant Colony System for the Probabilistic Traveling Salesman Problem. - Dennis Weyland; Roberto Montemanni; Luca Maria Gambardella (BIONETICS, 2012)

Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines. - Dennis Weyland; Roberto Montemanni; Luca Maria Gambardella (ISCO, 2012)

Some Constant Weight Codes from Primitive Permutation Groups. - Derek H. Smith; Roberto Montemanni (Electron. J. Comb., 2012)

A new table of permutation codes. - Derek H. Smith; Roberto Montemanni (Des. Codes Cryptogr., 2012)

Coupling ant colony systems with strong local searches. - Luca Maria Gambardella; Roberto Montemanni; Dennis Weyland (Eur. J. Oper. Res., 2012)

An Improved Heuristic for the Probabilistic Traveling Salesman Problem with Deadlines Based on GPGPU. - Dennis Weyland; Roberto Montemanni; Luca Maria Gambardella (EUROCAST (1), 2013)

A Robust Multiple Ant Colony System for the Capacitated Vehicle Routing Problem. - N. E. Toklu; Roberto Montemanni; Luca Maria Gambardella (SMC, 2013)

An ant colony system for the capacitated vehicle routing problem with uncertain travel costs. - N. E. Toklu; Roberto Montemanni; Luca Maria Gambardella (SIS, 2013)

Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling. - Dennis Weyland; Roberto Montemanni; Luca Maria Gambardella (Comput. Oper. Res., 2013)

Permutation codes with specified packing radius. - Derek H. Smith; Roberto Montemanni (Des. Codes Cryptogr., 2013)

A metaheuristic framework for stochastic combinatorial optimization problems based on GPGPU with a case study on the probabilistic traveling salesman problem with deadlines. - Dennis Weyland; Roberto Montemanni; Luca Maria Gambardella (J. Parallel Distributed Comput., 2013)

Green Bullwhip Effect Cost Simulation in Distribution Networks. - Matthias Klumpp; Nihat Engin Toklu; Vassilis Papapanagiotou; Roberto Montemanni; Luca Maria Gambardella (LDIC, 2014)

Sampling-Based Objective Function Evaluation Techniques for the Orienteering Problem with Stochastic Travel and Service Times. - Vassilis Papapanagiotou; Roberto Montemanni; Luca Maria Gambardella (OR, 2014)

Thermodynamic Post-Processing versusGC-Content Pre-Processing for DNA CodesSatisfying the Hamming Distance andReverse-Complement Constraints. - Dan Tulpan; Derek H. Smith; Roberto Montemanni (IEEE ACM Trans. Comput. Biol. Bioinform., 2014)

A Comparison of Heuristic Methods for the Prize-Collecting Steiner Tree Problem and Their Application in Genomics. - Murodzhon Akhmedov; Ivo Kwee; Roberto Montemanni (OR, 2015)

Software Support for Sustainable Supply Chain Configuration and Management. - Andrea Emilio Rizzoli; Roberto Montemanni; Andrea Bettoni; Luca Canetta (ICT Innovations for Sustainability, 2015)

Integrated home health care optimization via genetic algorithms and mathematical programming. - Thi Viet Ly Nguyen; Roberto Montemanni (CEC, 2016)

Comparison of Objective Function Evaluators for a Stochastic Orienteering Problem. - Vassilis Papapanagiotou; Roberto Montemanni; Luca Maria Gambardella (SCIS&ISIS, 2016)

A Sampling-Based Metaheuristic for the Orienteering Problem with Stochastic Travel Times. - Vassilis Papapanagiotou; Roberto Montemanni; Luca Maria Gambardella (TPNC, 2016)

Graph Colouring and Branch and Bound Approaches for Permutation Code Algorithms. - Roberto Montemanni; János Barta; Derek H. Smith (WorldCIST (1), 2016)

A divide and conquer matheuristic algorithm for the Prize-collecting Steiner Tree Problem. - Murodzhon Akhmedov; Ivo Kwee; Roberto Montemanni (Comput. Oper. Res., 2016)

A Fast Prize-Collecting Steiner Forest Algorithm for Functional Analyses in Biological Networks. - Murodzhon Akhmedov; Alexander LeNail; Francesco Bertoni; Ivo Kwee; Ernest Fraenkel; Roberto Montemanni (CPAIOR, 2017)

Solving the sequential ordering problem using branch and bound. - Jafar Jamal; Ghassan Shobaki; Vassilis Papapanagiotou; Luca Maria Gambardella; Roberto Montemanni (SSCI, 2017)

PCSF: An R-package for network-based interpretation of high-throughput data. - Murodzhon Akhmedov; Amanda J. Kedaigle; Renan Escalante Chong; Roberto Montemanni; Francesco Bertoni; Ernest Fraenkel; Ivo Kwee (PLoS Comput. Biol., 2017)

Machine Learning and Monte Carlo Sampling for the Probabilistic Orienteering Problem. - Roberto Montemanni; Federico D'ignazio; Xiaochen Chou; Luca Maria Gambardella (SCIS&ISIS, 2018)

A Metaheuristic Algorithm for the Probabilistic Orienteering Problem. - Xiaochen Chou; Luca Maria Gambardella; Roberto Montemanni (MLMI, 2019)

Solving the maximum clique problem with a hybrid algorithm. - Derek H. Smith; Stephanie Perkins; Roberto Montemanni (Int. J. Metaheuristics, 2019)

Steepest ant sense algorithm for parameter optimisation of multi-response processes based on taguchi design. - Pongchanun Luangpaiboon; S. Boonhao; Roberto Montemanni (J. Intell. Manuf., 2019)

The Use of an Exact Algorithm within a Tabu Search Maximum Clique Algorithm. - Derek H. Smith; Roberto Montemanni; Stephanie Perkins (Algorithms, 2020)

Matheuristic algorithms for the parallel drone scheduling traveling salesman problem. - Mauro Dell'Amico; Roberto Montemanni; Stefano Novellani (Ann. Oper. Res., 2020)

Optimization Strategies for In-Store Order Picking in Omnichannel Retailing. - Xiaochen Chou; Nicola Ognibene Pietri; Dominic Loske; Matthias Klumpp; Roberto Montemanni (APMS (2), 2021)

The Picking and Packing Problem in Buy-Online-Pick-up-in-Store Retailing. - Nicola Ognibene Pietri; Xiaochen Chou; Dominic Loske; Matthias Klumpp; Jafar Jamal; Roberto Montemanni (OR, 2021)

Machine Learning Constructives and Local Searches for the Travelling Salesman Problem. - Tommaso Vitali; Umberto Junior Mele; Luca Maria Gambardella; Roberto Montemanni (OR, 2021)

A New Constructive Heuristic Driven by Machine Learning for the Traveling Salesman Problem. - Umberto Junior Mele; Luca Maria Gambardella; Roberto Montemanni (Algorithms, 2021)

The Buy-Online-Pick-Up-in-Store Retailing Model: Optimization Strategies for In-Store Picking and Packing. - Nicola Ognibene Pietri; Xiaochen Chou; Dominic Loske; Matthias Klumpp; Roberto Montemanni (Algorithms, 2021)

A Tabu Search algorithm for the Probabilistic Orienteering Problem. - Xiaochen Chou; Luca Maria Gambardella; Roberto Montemanni (Comput. Oper. Res., 2021)

Benchmark Instances and Optimal Solutions for the Traveling Salesman Problem with Drone. - Mauro Dell'Amico; Roberto Montemanni; Stefano Novellani (CoRR, 2021)

Modeling the flying sidekick traveling salesman problem with multiple drones. - Mauro Dell'Amico; Roberto Montemanni; Stefano Novellani (Networks, 2021)

Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem. - Mauro Dell'Amico; Roberto Montemanni; Stefano Novellani (Optim. Lett., 2021)

Machine learning and combinatorial optimization, editorial. - Gianni A. Di Caro; Vittorio Maniezzo; Roberto Montemanni; Matteo Salani (OR Spectr., 2021)

AMR-Assisted Order Picking: Models for Picker-to-Parts Systems in a Two-Blocks Warehouse. - Giulia Pugliese; Xiaochen Chou; Dominic Loske; Matthias Klumpp; Roberto Montemanni (Algorithms, 2022)

Upper and lower bounds based on linear programming for the b-coloring problem. - Roberto Montemanni; Xiaochen Chou; Derek H. Smith (EURO J. Comput. Optim., 2022)

A decision support tool for intelligent manufacturing systems via an elevator kinematic optimisation based method. - Pongchanun Luangpaiboon; Pasura Aungkulanon; Roberto Montemanni (Expert Syst. Appl., 2022)

Exact models for the flying sidekick traveling salesman problem. - Mauro Dell'Amico; Roberto Montemanni; Stefano Novellani (Int. Trans. Oper. Res., 2022)

The Maximum Clique Problem for Permutation Hamming Graphs. - János Barta; Roberto Montemanni (J. Optim. Theory Appl., 2022)

Modelling and Solving the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting-Times. - Mauro Dell'Amico; Jafar Jamal; Roberto Montemanni (FedCSIS, 2023)

Solving the Parallel Drone Scheduling Traveling Salesman Problem via Constraint Programming. - Roberto Montemanni; Mauro Dell'Amico (Algorithms, 2023)

Constraint programming models for the parallel drone scheduling vehicle routing problem. - Roberto Montemanni; Mauro Dell'Amico (EURO J. Comput. Optim., 2023)

The missing Moore graph as an optimization problem. - Derek H. Smith; Roberto Montemanni (EURO J. Comput. Optim., 2023)

Precedence-Constrained arborescences. - Xiaochen Chou; Mauro Dell'Amico; Jafar Jamal; Roberto Montemanni (Eur. J. Oper. Res., 2023)

A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem. - Mauro Dell'Amico; Jafar Jamal; Roberto Montemanni (Comput. Oper. Res., 2023)

Enhancing Real-World Applicability in Home Healthcare: A Metaheuristic Approach for Advanced Routing and Scheduling. - Sara Ceschia; Luca Di Gaspero; Simona Mancini; Vittorio Maniezzo; Roberto Montemanni; Roberto Maria Rosati; Andrea Schaerf (MIC (1), 2024)

Combining Heuristics and Constraint Programming for the Parallel Drone Scheduling Vehicle Routing Problem with Collective Drones. - Roberto Montemanni; Mauro Dell'Amico; Andrea Corsini (MIC (1), 2024)

Picking Optimization in U-Shaped Corridors with a Movable Depot. - Roberto Montemanni; Agnese Cervino; Francesco Lolli (ICIEA-EU, 2024)

Compact Models to Solve the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times. - Mauro Dell'Amico; Jafar Jamal; Roberto Montemanni (Algorithms, 2024)

Parallel drone scheduling vehicle routing problems with collective drones. - Roberto Montemanni; Mauro Dell'Amico; Andrea Corsini (Comput. Oper. Res., 2024)

On Solving the Set Orienteering Problem. - Roberto Montemanni; Derek H. Smith (Symmetry, 2024)

A model-based algorithm for the Probabilistic Orienteering Problem. - Roberto Montemanni; Derek H. Smith (Comput. Oper. Res., 2025)

Model-based algorithms for the 0-1 Time-Bomb Knapsack Problem. - Roberto Montemanni; Derek H. Smith (Comput. Oper. Res., 2025)

A compact model for the home healthcare routing and scheduling problem. - Roberto Montemanni; Sara Ceschia; Andrea Schaerf (EURO J. Comput. Optim., 2025)