Paola Festa

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 41

Top Topics

Mathematical Formulation

Iterated Local Search

Vehicle Routing Problem

Top Venues

Comput. Oper. Res.

Eur. J. Oper. Res.

Publications

Paola Festa, Francesca Guerriero, Mauricio G. C. Resende, Edoardo Scalzo
A biased random-key genetic algorithm with variable mutants to solve a vehicle routing problem. CoRR (2024)
Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore
The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm. Networks 81 (2) (2023)
Daniele Ferone, Paola Festa, Tommaso Pastore, Mauricio G. C. Resende
Efficient GRASP solution approach for the Prisoner Transportation Problem. Comput. Oper. Res. 153 (2023)
Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa, Francesca Guerriero, Giusy Macrina
Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping. Optim. Lett. 17 (9) (2023)
Paola Festa, Serena Fugaro, Francesca Guerriero
Shortest path reoptimization vs resolution from scratch: a computational comparison. Optim. Methods Softw. 37 (3) (2022)
Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa, Francesca Guerriero, Giusy Macrina
Solution approaches for the vehicle routing problem with occasional drivers and time windows. Optim. Methods Softw. 37 (4) (2022)
Paola Festa, Francesca Guerriero, Mauricio G. C. Resende, Edoardo Scalzo
A BRKGA with Implicit Path-Relinking for the Vehicle Routing Problem with Occasional Drivers and Time Windows. MIC (2022)
Daniele Ferone, Paola Festa, Francesca Guerriero
The Rainbow Steiner Tree Problem. Comput. Oper. Res. 139 (2022)
Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa, Francesca Guerriero
A generalized shortest path tour problem with time windows. Comput. Optim. Appl. 83 (2) (2022)
Maurizio Bruglieri, Daniele Ferone, Paola Festa, Ornella Pisacane
A GRASP with penalty objective function for the Green Vehicle Routing Problem with Private Capacitated Stations. Comput. Oper. Res. 143 (2022)
Dario Asprone, Sergio Di Martino, Paola Festa, Luigi Libero Lucio Starace
Vehicular crowd-sensing: a parametric routing algorithm to increase spatio-temporal road network coverage. Int. J. Geogr. Inf. Sci. 35 (9) (2021)
Giulio Mariniello, Tommaso Pastore, Costantino Menna, Paola Festa, Domenico Asprone
Structural damage detection and localization using decision tree ensemble and vibration data. Comput. Aided Civ. Infrastructure Eng. 36 (9) (2021)
Francesco Carrabs, Ciriaco D'Ambrosio, Daniele Ferone, Paola Festa, Federica Laureana
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions. Networks 78 (1) (2021)
Mirko Alicastro, Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore
A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems. Comput. Oper. Res. 131 (2021)
Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore
A dynamic programming algorithm for solving the k-Color Shortest Path Problem. Optim. Lett. 15 (6) (2021)
Angela Serra, Serli Önlü, Paola Festa, Vittorio Fortino, Dario Greco
MaNGA: a novel multi-niche multi-objective genetic algorithm for QSAR modelling. Bioinform. 36 (1) (2020)
Tommaso Pastore, Anna Martínez-Gavara, Antonio Napoletano, Paola Festa, Rafael Martí
Tabu search for min-max edge crossing in graphs. Comput. Oper. Res. 114 (2020)
Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore
On the Shortest Path Problems with Edge Constraints. ICTON (2020)
Daniele Ferone, Paola Festa, Francesca Guerriero
An efficient exact approach for the constrained shortest path tour problem. Optim. Methods Softw. 35 (1) (2020)
Daniele Ferone, Sara Hatami, Eliana María González-Neira, Angel A. Juan, Paola Festa
A biased-randomized iterated local search for the distributed assembly permutation flow-shop problem. Int. Trans. Oper. Res. 27 (3) (2020)
Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa, Francesca Guerriero
Shortest path tour problem with time windows. Eur. J. Oper. Res. 282 (1) (2020)
Daniele Ferone, Aljoscha Gruler, Paola Festa, Angel A. Juan
Enhancing and extending the classical GRASP framework with biased randomisation and simulation. J. Oper. Res. Soc. 70 (8) (2019)
Antonio Napoletano, Anna Martínez-Gavara, Paola Festa, Tommaso Pastore, Rafael Martí
Heuristics for the Constrained Incremental Graph Drawing Problem. Eur. J. Oper. Res. 274 (2) (2019)
Paola Festa, Francesca Guerriero, Antonio Napoletano
An auction-based approach for the re-optimization shortest path tree problem. Comput. Optim. Appl. 74 (3) (2019)
Sergio Di Martino, Paola Festa, Dario Asprone
Adapting the A* Algorithm to Increase Vehicular Crowd-Sensing Coverage. ICCL (2018)
Fernando Morales, Paola Festa, Marc Ruiz, Luis Velasco
Performance Evaluation of the VNT Reconfiguration Algorithm Based on Traffic Prediction. ICTON (2018)
Michele Mele, Paola Festa
Scheduling Assistance for Passengers with Special Needs in Large Scale Airports. ICCL (2018)
Dario Asprone, Sergio Di Martino, Paola Festa
Improving Sensing Coverage of Probe Vehicles with Probabilistic Routing. W2GIS (2018)
Paola Festa, Tommaso Pastore, Daniele Ferone, Angel A. Juan, Christopher Bayliss
Integrating biased-Randomized grasp with Monte Carlo simulation for solving the Vehicle Routing Problem with stochastic demands. WSC (2018)
Daniele Ferone, Paola Festa, Antonio Napoletano, Mauricio G. C. Resende
On the fast solution of the p-center problem. ICTON (2017)
Fernando Morales, Paola Festa, Marc Ruiz, Luis Velasco
Adapting the virtual network topology to near future traffic. ICTON (2017)
Daniele Ferone, Paola Festa, Antonio Napoletano, Mauricio G. C. Resende
A New Local Search for the p-Center Problem Based on the Critical Vertex Concept. LION (2017)
Giovanni Felici, Daniele Ferone, Paola Festa, Antonio Napoletano, Tommaso Pastore
A GRASP for the Minimum Cost SAT Problem. LION (2017)
Marianna De Santis, Paola Festa, Giampaolo Liuzzi, Stefano Lucidi, Francesco Rinaldi
A nonmonotone GRASP. Math. Program. Comput. 8 (3) (2016)
Daniele Ferone, Angelo M. Facchiano, Anna Marabotti, Paola Festa
A new GRASP metaheuristic for biclustering of gene expression data. PeerJ Prepr. 4 (2016)
Paola Bertolazzi, Giovanni Felici, Paola Festa, Giulia Fiscon, Emanuel Weitschek
Integer programming models for feature selection: New extensions and a randomized solution algorithm. Eur. J. Oper. Res. 250 (2) (2016)
Daniele Ferone, Paola Festa, Antonio Napoletano, Tommaso Pastore
Reoptimizing shortest paths: From state of the art to new recent perspectives. ICTON (2016)
Daniele Ferone, Paola Festa, Aljoscha Gruler, Angel A. Juan
Combining simulation with a GRASP metaheuristic for solving the permutation flow-shop problem with stochastic processing times. WSC (2016)
Daniele Ferone, Paola Festa, Mauricio G. C. Resende
Hybridizations of GRASP with path relinking for the far from most string problem. Int. Trans. Oper. Res. 23 (3) (2016)
Giovanni Felici, Daniele Ferone, Paola Festa, Antonio Napoletano, Tommaso Pastore
The solution of large-scale Minimum Cost SAT Problem as a tool for data analysis in bioinformatics. PeerJ Prepr. 4 (2016)
Daniele Ferone, Paola Festa, Francesca Guerriero, Demetrio Laganà
The constrained shortest path tour problem. Comput. Oper. Res. 74 (2016)
Giuseppe Vettigli, Mingyue Ji, Antonia Maria Tulino, Jaime Llorca, Paola Festa
An Efficient Coded Multicasting Scheme Preserving the Multiplicative Caching Gain. CoRR (2015)
Giuseppe Vettigli, Mingyue Ji, Antonia Maria Tulino, Jaime Llorca, Paola Festa
An efficient coded multicasting scheme preserving the multiplicative caching gain. INFOCOM Workshops (2015)
Ricardo M. A. Silva, Diego M. Silva, Mauricio G. C. Resende, Geraldo R. Mateus, José Fernando Gonçalves, Paola Festa
An edge-swap heuristic for generating spanning trees with minimum number of branch vertices. Optim. Lett. 8 (4) (2014)
Christian Blum, Paola Festa
A Hybrid Ant Colony Optimization Algorithm for the Far From Most String Problem. EvoCOP (2014)
Ricardo M. A. Silva, Mauricio G. C. Resende, Paola Festa, Filipe L. Valentim, Francisco Nascimento Junior
GRASP with Path-Relinking for the Maximum Contact Map Overlap Problem. LION (2014)
Daniele Ferone, Paola Festa, Mauricio G. C. Resende
Hybrid Metaheuristics for the Far From Most String Problem. Hybrid Metaheuristics (2013)
Paola Festa
Foreword to the special issue SEA 2010. ACM J. Exp. Algorithmics 18 (2013)
Paola Festa, Francesca Guerriero, Demetrio Laganà, Roberto Musmanno
Solving the shortest path tour problem. Eur. J. Oper. Res. 230 (3) (2013)
Paola Festa
Complexity analysis and optimization of the shortest path tour problem. Optim. Lett. 6 (1) (2012)
Paola Festa, Panos M. Pardalos
Efficient solutions for the far from most string problem. Ann. Oper. Res. 196 (1) (2012)
Paola Festa, Mauricio G. C. Resende
GRASP: basic components and enhancements. Telecommun. Syst. 46 (3) (2011)
Renato De Leone, Paola Festa, Emilia Marchitto
A Bus Driver Scheduling Problem: a new mathematical model and a GRASP approximate solution. J. Heuristics 17 (4) (2011)
Rafael M. D. Frinhani, Ricardo M. A. Silva, Geraldo R. Mateus, Paola Festa, Mauricio G. C. Resende
GRASP with Path-Relinking for Data Clustering: A Case Study for Biological Data. SEA (2011)
Diego M. Silva, Ricardo M. A. Silva, Geraldo R. Mateus, José Fernando Gonçalves, Mauricio G. C. Resende, Paola Festa
An Iterative Refinement Algorithm for the Minimum Branch Vertices Problem. SEA (2011)
Angelo M. Facchiano, Paola Festa, Anna Marabotti, Luciano Milanesi, Francesco Musacchia
Solving Biclustering with a GRASP-Like Metaheuristic: Two Case-Studies on Gene Expression Analysis. CIBB (2011)
Renato De Leone, Paola Festa, Emilia Marchitto
Solving a bus driver scheduling problem with randomized multistart heuristics. Int. Trans. Oper. Res. 18 (6) (2011)
Paola Festa, José Fernando Gonçalves, Mauricio G. C. Resende, Ricardo M. A. Silva
Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm. SEA (2010)
Paola Bertolazzi, Giovanni Felici, Paola Festa
Logic based methods for SNPs tagging and reconstruction. Comput. Oper. Res. 37 (8) (2010)
Paola Festa
Cooperative networks, control and optimization. Optim. Methods Softw. 24 (6) (2009)
Paola Festa, Mauricio G. C. Resende
An annotated bibliography of GRASP - Part I: Algorithms. Int. Trans. Oper. Res. 16 (1) (2009)
Paola Festa, Mauricio G. C. Resende
An annotated bibliography of GRASP-Part II: Applications. Int. Trans. Oper. Res. 16 (2) (2009)
Paola Bertolazzi, Giovanni Felici, Paola Festa, Giuseppe Lancia
Logic classification and feature selection for biomedical data. Comput. Math. Appl. 55 (5) (2008)
Gionatan D'Annibale, Renato De Leone, Paola Festa, Emilia Marchitto
A new meta-heuristic for the Bus Driver Scheduling Problem: GRASP combined with Rollout. CISched (2007)
Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
GRASP with path relinking for the weighted MAXSAT problem. ACM J. Exp. Algorithmics 11 (2006)
Piero A. Bonatti, Paola Festa
On optimal service selection. WWW (2005)
Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem. WEA (2005)
Raffaele Cerulli, Paola Festa, Giancarlo Raiconi
Shortest Path Auction Algorithm Without Contractions Using Virtual Source Concept. Comput. Optim. Appl. 26 (2) (2003)
Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende, Celso C. Ribeiro
Randomized heuristics for the Max-Cut problem. Optim. Methods Softw. 17 (6) (2002)
Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende
Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP. ACM Trans. Math. Softw. 27 (4) (2001)
Patrizia Cerulli, Paola Festa, Giancarlo Raiconi
Graph Collapsing in Shortest Path Auction Algorithms. Comput. Optim. Appl. 18 (3) (2001)
R. Cernili, Paola Festa, G. Raiconi
Rendezvous of mobile robots in unknown environment via graph optimization approach. ECC (1999)
Raffaele Cerulli, Paola Festa, Giancarlo Raiconi, G. Visciano
The Auction Technique for the Sensor Based Navigation Planning of an Autonomous Mobile Robot. J. Intell. Robotic Syst. 21 (4) (1998)