Paola Festa

According to our database, Paola Festa authored at least 85 papers between 1998 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping.

Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa, Francesca Guerriero, Giusy Macrina

Optim. Lett., December, 2023

Efficient GRASP solution approach for the Prisoner Transportation Problem.

Daniele Ferone, Paola Festa, Tommaso Pastore, Mauricio G. C. Resende

Comput. Oper. Res., May, 2023

The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm.

Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore

Networks, March, 2023

2022

Solution approaches for the vehicle routing problem with occasional drivers and time windows.

Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa, Francesca Guerriero, Giusy Macrina

Optim. Methods Softw., 2022

Shortest path reoptimization vs resolution from scratch: a computational comparison.

Paola Festa, Serena Fugaro, Francesca Guerriero

Optim. Methods Softw., 2022

The Rainbow Steiner Tree Problem.

Daniele Ferone, Paola Festa, Francesca Guerriero

Comput. Oper. Res., 2022

A GRASP with penalty objective function for the Green Vehicle Routing Problem with Private Capacitated Stations.

Maurizio Bruglieri, Daniele Ferone, Paola Festa, Ornella Pisacane

Comput. Oper. Res., 2022

A generalized shortest path tour problem with time windows.

Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa, Francesca Guerriero

Comput. Optim. Appl., 2022

A BRKGA with Implicit Path-Relinking for the Vehicle Routing Problem with Occasional Drivers and Time Windows.

Paola Festa, Francesca Guerriero, Mauricio G. C. Resende, Edoardo Scalzo

Proceedings of the Metaheuristics - 14th International Conference, 2022

2021

A dynamic programming algorithm for solving the k-Color Shortest Path Problem.

Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore

Optim. Lett., 2021

The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions.

Francesco Carrabs, Ciriaco D'Ambrosio, Daniele Ferone, Paola Festa, Federica Laureana

Networks, 2021

Vehicular crowd-sensing: a parametric routing algorithm to increase spatio-temporal road network coverage.

Dario Asprone, Sergio Di Martino, Paola Festa, Luigi Libero Lucio Starace

Int. J. Geogr. Inf. Sci., 2021

A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems.

Mirko Alicastro, Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore

Comput. Oper. Res., 2021

Structural damage detection and localization using decision tree ensemble and vibration data.

Giulio Mariniello, Tommaso Pastore, Costantino Menna, Paola Festa, Domenico Asprone

Comput. Aided Civ. Infrastructure Eng., 2021

2020

An efficient exact approach for the constrained shortest path tour problem.

Daniele Ferone, Paola Festa, Francesca Guerriero

Optim. Methods Softw., 2020

A biased-randomized iterated local search for the distributed assembly permutation flow-shop problem.

Daniele Ferone, Sara Hatami, Eliana María González-Neira, Angel A. Juan, Paola Festa

Int. Trans. Oper. Res., 2020

Shortest path tour problem with time windows.

Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa, Francesca Guerriero

Eur. J. Oper. Res., 2020

Tabu search for min-max edge crossing in graphs.

Tommaso Pastore, Anna Martínez-Gavara, Antonio Napoletano, Paola Festa, Rafael Martí

Comput. Oper. Res., 2020

MaNGA: a novel multi-niche multi-objective genetic algorithm for QSAR modelling.

Angela Serra, Serli Önlü, Paola Festa, Vittorio Fortino, Dario Greco

Bioinform., 2020

On the Shortest Path Problems with Edge Constraints.

Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore

Proceedings of the 22nd International Conference on Transparent Optical Networks, 2020

2019

Enhancing and extending the classical GRASP framework with biased randomisation and simulation.

Daniele Ferone, Aljoscha Gruler, Paola Festa, Angel A. Juan

J. Oper. Res. Soc., 2019

Heuristics for the Constrained Incremental Graph Drawing Problem.

Antonio Napoletano, Anna Martínez-Gavara, Paola Festa, Tommaso Pastore, Rafael Martí

Eur. J. Oper. Res., 2019

An auction-based approach for the re-optimization shortest path tree problem.

Paola Festa, Francesca Guerriero, Antonio Napoletano

Comput. Optim. Appl., 2019

2018

GRASP.

Paola Festa, Mauricio G. C. Resende

Proceedings of the Handbook of Heuristics., 2018

Selected String Problems.

Christian Blum, Paola Festa

Proceedings of the Handbook of Heuristics., 2018

Integrating biased-Randomized grasp with Monte Carlo simulation for solving the Vehicle Routing Problem with stochastic demands.

Paola Festa, Tommaso Pastore, Daniele Ferone, Angel A. Juan, Christopher Bayliss

Proceedings of the 2018 Winter Simulation Conference, 2018

Improving Sensing Coverage of Probe Vehicles with Probabilistic Routing.

Dario Asprone, Sergio Di Martino, Paola Festa

Proceedings of the Web and Wireless Geographical Information Systems, 2018

Performance Evaluation of the VNT Reconfiguration Algorithm Based on Traffic Prediction.

Fernando Morales, Paola Festa, Marc Ruiz, Luis Velasco

Proceedings of the 2018 20th International Conference on Transparent Optical Networks (ICTON), 2018

Scheduling Assistance for Passengers with Special Needs in Large Scale Airports.

Michele Mele, Paola Festa

Proceedings of the Computational Logistics - 9th International Conference, 2018

Adapting the A* Algorithm to Increase Vehicular Crowd-Sensing Coverage.

Sergio Di Martino, Paola Festa, Dario Asprone

Proceedings of the Computational Logistics - 9th International Conference, 2018

2017

A New Local Search for the p-Center Problem Based on the Critical Vertex Concept.

Daniele Ferone, Paola Festa, Antonio Napoletano, Mauricio G. C. Resende

Proceedings of the Learning and Intelligent Optimization - 11th International Conference, 2017

A GRASP for the Minimum Cost SAT Problem.

Giovanni Felici, Daniele Ferone, Paola Festa, Antonio Napoletano, Tommaso Pastore

Proceedings of the Learning and Intelligent Optimization - 11th International Conference, 2017

Adapting the virtual network topology to near future traffic.

Fernando Morales, Paola Festa, Marc Ruiz, Luis Velasco

Proceedings of the 2017 19th International Conference on Transparent Optical Networks (ICTON), 2017

On the fast solution of the p-center problem.

Daniele Ferone, Paola Festa, Antonio Napoletano, Mauricio G. C. Resende

Proceedings of the 2017 19th International Conference on Transparent Optical Networks (ICTON), 2017

2016

A new GRASP metaheuristic for biclustering of gene expression data.

Daniele Ferone, Angelo M. Facchiano, Anna Marabotti, Paola Festa

PeerJ Prepr., 2016

The solution of large-scale Minimum Cost SAT Problem as a tool for data analysis in bioinformatics.

Giovanni Felici, Daniele Ferone, Paola Festa, Antonio Napoletano, Tommaso Pastore

PeerJ Prepr., 2016

A nonmonotone GRASP.

Marianna De Santis, Paola Festa, Giampaolo Liuzzi, Stefano Lucidi, Francesco Rinaldi

Math. Program. Comput., 2016

Hybridizations of GRASP with path relinking for the far from most string problem.

Daniele Ferone, Paola Festa, Mauricio G. C. Resende

Int. Trans. Oper. Res., 2016

Integer programming models for feature selection: New extensions and a randomized solution algorithm.

Paola Bertolazzi, Giovanni Felici, Paola Festa, Giulia Fiscon, Emanuel Weitschek

Eur. J. Oper. Res., 2016

The constrained shortest path tour problem.

Daniele Ferone, Paola Festa, Francesca Guerriero, Demetrio Laganà

Comput. Oper. Res., 2016

Combining simulation with a GRASP metaheuristic for solving the permutation flow-shop problem with stochastic processing times.

Daniele Ferone, Paola Festa, Aljoscha Gruler, Angel A. Juan

Proceedings of the Winter Simulation Conference, 2016

Reoptimizing shortest paths: From state of the art to new recent perspectives.

Daniele Ferone, Paola Festa, Antonio Napoletano, Tommaso Pastore

Proceedings of the 18th International Conference on Transparent Optical Networks, 2016

2015

An efficient coded multicasting scheme preserving the multiplicative caching gain.

Giuseppe Vettigli, Mingyue Ji, Antonia M. Tulino, Jaime Llorca, Paola Festa

Proceedings of the 2015 IEEE Conference on Computer Communications Workshops, 2015

Constrained shortest path problems: state-of-the-art and recent advances.

Paola Festa

Proceedings of the 17th International Conference on Transparent Optical Networks, 2015

2014

On Data Clustering: Exact and Approximate Solutions.

Paola Festa

Proceedings of the Examining Robustness and Vulnerability of Networked Systems, 2014

An edge-swap heuristic for generating spanning trees with minimum number of branch vertices.

Ricardo M. A. Silva, Diego M. Silva, Mauricio G. C. Resende, Geraldo R. Mateus, José Fernando Gonçalves, Paola Festa

Optim. Lett., 2014

GRASP with Path-Relinking for the Maximum Contact Map Overlap Problem.

Ricardo M. A. Silva, Mauricio G. C. Resende, Paola Festa, Filipe L. Valentim, Francisco Nascimento Junior

Proceedings of the Learning and Intelligent Optimization, 2014

A brief introduction to exact, approximation, and heuristic algorithms for solving hard combinatorial optimization problems.

Paola Festa

Proceedings of the 16th International Conference on Transparent Optical Networks, 2014

A Hybrid Ant Colony Optimization Algorithm for the Far From Most String Problem.

Christian Blum, Paola Festa

Proceedings of the Evolutionary Computation in Combinatorial Optimisation, 2014

2013

Hybridizations of GRASP with Path-Relinking.

Paola Festa, Mauricio G. C. Resende

Proceedings of the Hybrid Metaheuristics, 2013

Foreword to the special issue SEA 2010.

Paola Festa

ACM J. Exp. Algorithmics, 2013

Solving the shortest path tour problem.

Paola Festa, Francesca Guerriero, Demetrio Laganà, Roberto Musmanno

Eur. J. Oper. Res., 2013

Hybrid Metaheuristics for the Far From Most String Problem.

Daniele Ferone, Paola Festa, Mauricio G. C. Resende

Proceedings of the Hybrid Metaheuristics - 8th International Workshop, 2013

2012

Complexity analysis and optimization of the shortest path tour problem.

Paola Festa

Optim. Lett., 2012

Efficient solutions for the far from most string problem.

Paola Festa, Panos M. Pardalos

Ann. Oper. Res., 2012

2011

GRASP: basic components and enhancements.

Paola Festa, Mauricio G. C. Resende

Telecommun. Syst., 2011

Solving a bus driver scheduling problem with randomized multistart heuristics.

Renato De Leone, Paola Festa, Emilia Marchitto

Int. Trans. Oper. Res., 2011

A Bus Driver Scheduling Problem: a new mathematical model and a GRASP approximate solution.

Renato De Leone, Paola Festa, Emilia Marchitto

J. Heuristics, 2011

An Iterative Refinement Algorithm for the Minimum Branch Vertices Problem.

Diego M. Silva, Ricardo M. A. Silva, Geraldo R. Mateus, José Fernando Gonçalves, Mauricio G. C. Resende, Paola Festa

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

GRASP with Path-Relinking for Data Clustering: A Case Study for Biological Data.

Rafael M. D. Frinhani, Ricardo M. A. Silva, Geraldo R. Mateus, Paola Festa, Mauricio G. C. Resende

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Solving Biclustering with a GRASP-Like Metaheuristic: Two Case-Studies on Gene Expression Analysis.

Angelo M. Facchiano, Paola Festa, Anna Marabotti, Luciano Milanesi, Francesco Musacchia

Proceedings of the Computational Intelligence Methods for Bioinformatics and Biostatistics, 2011

2010

Logic based methods for SNPs tagging and reconstruction.

Paola Bertolazzi, Giovanni Felici, Paola Festa

Comput. Oper. Res., 2010

Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm.

Paola Festa, José Fernando Gonçalves, Mauricio G. C. Resende, Ricardo M. A. Silva

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2009

Hybrid GRASP Heuristics.

Paola Festa, Mauricio G. C. Resende

Proceedings of the Foundations of Computational Intelligence, 2009

Feedback Set Problems.

Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Shortest Path Tree Algorithms.

Paola Festa

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Oriented Matroids.

Paola Festa

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Matroids.

Paola Festa

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Linear Ordering Problem.

Paola Festa

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Cooperative networks, control and optimization.

Paola Festa

Optim. Methods Softw., 2009

An annotated bibliography of GRASP-Part II: Applications.

Paola Festa, Mauricio G. C. Resende

Int. Trans. Oper. Res., 2009

An annotated bibliography of GRASP - Part I: Algorithms.

Paola Festa, Mauricio G. C. Resende

Int. Trans. Oper. Res., 2009

2008

Logic classification and feature selection for biomedical data.

Paola Bertolazzi, Giovanni Felici, Paola Festa, Giuseppe Lancia

Comput. Math. Appl., 2008

2007

A new meta-heuristic for the Bus Driver Scheduling Problem: GRASP combined with Rollout.

Gionatan D'Annibale, Renato De Leone, Paola Festa, Emilia Marchitto

Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, 2007

2006

GRASP with path relinking for the weighted MAXSAT problem.

Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende

ACM J. Exp. Algorithmics, 2006

Shortest Path Algorithms.

Paola Festa

Proceedings of the Handbook of Optimization in Telecommunications, 2006

2005

On optimal service selection.

Piero A. Bonatti, Paola Festa

Proceedings of the 14th international conference on World Wide Web, 2005

GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem.

Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

2003

Shortest Path Auction Algorithm Without Contractions Using Virtual Source Concept.

Raffaele Cerulli, Paola Festa, Giancarlo Raiconi

Comput. Optim. Appl., 2003

2002

Randomized heuristics for the Max-Cut problem.

Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende, Celso C. Ribeiro

Optim. Methods Softw., 2002

2001

Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP.

Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende

ACM Trans. Math. Softw., 2001

Graph Collapsing in Shortest Path Auction Algorithms.

Patrizia Cerulli, Paola Festa, Giancarlo Raiconi

Comput. Optim. Appl., 2001

1999

Rendezvous of mobile robots in unknown environment via graph optimization approach.

R. Cernili, Paola Festa, G. Raiconi

Proceedings of the 5th European Control Conference, 1999

Feedback Set Problems.

Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende

Proceedings of the Handbook of Combinatorial Optimization, 1999

1998

The Auction Technique for the Sensor Based Navigation Planning of an Autonomous Mobile Robot.

Raffaele Cerulli, Paola Festa, Giancarlo Raiconi, G. Visciano

J. Intell. Robotic Syst., 1998