Paola Festa

Orcid: 0000-0002-2243-6054

According to our database1, Paola Festa authored at least 88 papers between 1998 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Preface to the Special Issue on Metaheuristics: Recent Advances and Applications.
Int. Trans. Oper. Res., January, 2025

Hybridizing a matheuristic with ALNS for the optimal collection and delivery of medical specimens.
Int. Trans. Oper. Res., January, 2025

2024
A biased random-key genetic algorithm with variable mutants to solve a vehicle routing problem.
CoRR, 2024

2023
Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping.
Optim. Lett., December, 2023

Efficient GRASP solution approach for the Prisoner Transportation Problem.
Comput. Oper. Res., May, 2023

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

2022
Solution approaches for the vehicle routing problem with occasional drivers and time windows.
Optim. Methods Softw., 2022

Shortest path reoptimization vs resolution from scratch: a computational comparison.
Optim. Methods Softw., 2022

The Rainbow Steiner Tree Problem.
Comput. Oper. Res., 2022

A GRASP with penalty objective function for the Green Vehicle Routing Problem with Private Capacitated Stations.
Comput. Oper. Res., 2022

A generalized shortest path tour problem with time windows.
Comput. Optim. Appl., 2022

A BRKGA with Implicit Path-Relinking for the Vehicle Routing Problem with Occasional Drivers and Time Windows.
Proceedings of the Metaheuristics - 14th International Conference, 2022

2021
A dynamic programming algorithm for solving the k-Color Shortest Path Problem.
Optim. Lett., 2021

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

Vehicular crowd-sensing: a parametric routing algorithm to increase spatio-temporal road network coverage.
Int. J. Geogr. Inf. Sci., 2021

A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems.
Comput. Oper. Res., 2021

Structural damage detection and localization using decision tree ensemble and vibration data.
Comput. Aided Civ. Infrastructure Eng., 2021

2020
An efficient exact approach for the constrained shortest path tour problem.
Optim. Methods Softw., 2020

A biased-randomized iterated local search for the distributed assembly permutation flow-shop problem.
Int. Trans. Oper. Res., 2020

Shortest path tour problem with time windows.
Eur. J. Oper. Res., 2020

Tabu search for min-max edge crossing in graphs.
Comput. Oper. Res., 2020

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

On the Shortest Path Problems with Edge Constraints.
Proceedings of the 22nd International Conference on Transparent Optical Networks, 2020

2019
Enhancing and extending the classical GRASP framework with biased randomisation and simulation.
J. Oper. Res. Soc., 2019

Heuristics for the Constrained Incremental Graph Drawing Problem.
Eur. J. Oper. Res., 2019

An auction-based approach for the re-optimization shortest path tree problem.
Comput. Optim. Appl., 2019

2018
GRASP.
Proceedings of the Handbook of Heuristics., 2018

Selected String Problems.
Proceedings of the Handbook of Heuristics., 2018

Integrating biased-Randomized grasp with Monte Carlo simulation for solving the Vehicle Routing Problem with stochastic demands.
Proceedings of the 2018 Winter Simulation Conference, 2018

Improving Sensing Coverage of Probe Vehicles with Probabilistic Routing.
Proceedings of the Web and Wireless Geographical Information Systems, 2018

Performance Evaluation of the VNT Reconfiguration Algorithm Based on Traffic Prediction.
Proceedings of the 2018 20th International Conference on Transparent Optical Networks (ICTON), 2018

Scheduling Assistance for Passengers with Special Needs in Large Scale Airports.
Proceedings of the Computational Logistics - 9th International Conference, 2018

Adapting the A* Algorithm to Increase Vehicular Crowd-Sensing Coverage.
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.
Proceedings of the Learning and Intelligent Optimization - 11th International Conference, 2017

A GRASP for the Minimum Cost SAT Problem.
Proceedings of the Learning and Intelligent Optimization - 11th International Conference, 2017

Adapting the virtual network topology to near future traffic.
Proceedings of the 2017 19th International Conference on Transparent Optical Networks (ICTON), 2017

On the fast solution of the p-center problem.
Proceedings of the 2017 19th International Conference on Transparent Optical Networks (ICTON), 2017

2016
A new GRASP metaheuristic for biclustering of gene expression data.
PeerJ Prepr., 2016

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

A nonmonotone GRASP.
Math. Program. Comput., 2016

Hybridizations of GRASP with path relinking for the far from most string problem.
Int. Trans. Oper. Res., 2016

Integer programming models for feature selection: New extensions and a randomized solution algorithm.
Eur. J. Oper. Res., 2016

The constrained shortest path tour problem.
Comput. Oper. Res., 2016

Combining simulation with a GRASP metaheuristic for solving the permutation flow-shop problem with stochastic processing times.
Proceedings of the Winter Simulation Conference, 2016

Reoptimizing shortest paths: From state of the art to new recent perspectives.
Proceedings of the 18th International Conference on Transparent Optical Networks, 2016

2015
An efficient coded multicasting scheme preserving the multiplicative caching gain.
Proceedings of the 2015 IEEE Conference on Computer Communications Workshops, 2015

Constrained shortest path problems: state-of-the-art and recent advances.
Proceedings of the 17th International Conference on Transparent Optical Networks, 2015

2014
On Data Clustering: Exact and Approximate Solutions.
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.
Optim. Lett., 2014

GRASP with Path-Relinking for the Maximum Contact Map Overlap Problem.
Proceedings of the Learning and Intelligent Optimization, 2014

A brief introduction to exact, approximation, and heuristic algorithms for solving hard combinatorial optimization problems.
Proceedings of the 16th International Conference on Transparent Optical Networks, 2014

A Hybrid Ant Colony Optimization Algorithm for the Far From Most String Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimisation, 2014

2013
Hybridizations of GRASP with Path-Relinking.
Proceedings of the Hybrid Metaheuristics, 2013

Foreword to the special issue SEA 2010.
ACM J. Exp. Algorithmics, 2013

Solving the shortest path tour problem.
Eur. J. Oper. Res., 2013

Hybrid Metaheuristics for the Far From Most String Problem.
Proceedings of the Hybrid Metaheuristics - 8th International Workshop, 2013

2012
Complexity analysis and optimization of the shortest path tour problem.
Optim. Lett., 2012

Efficient solutions for the far from most string problem.
Ann. Oper. Res., 2012

2011
GRASP: basic components and enhancements.
Telecommun. Syst., 2011

Solving a bus driver scheduling problem with randomized multistart heuristics.
Int. Trans. Oper. Res., 2011

A Bus Driver Scheduling Problem: a new mathematical model and a GRASP approximate solution.
J. Heuristics, 2011

An Iterative Refinement Algorithm for the Minimum Branch Vertices Problem.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

GRASP with Path-Relinking for Data Clustering: A Case Study for Biological Data.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Solving Biclustering with a GRASP-Like Metaheuristic: Two Case-Studies on Gene Expression Analysis.
Proceedings of the Computational Intelligence Methods for Bioinformatics and Biostatistics, 2011

2010
Logic based methods for SNPs tagging and reconstruction.
Comput. Oper. Res., 2010

Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2009
Hybrid GRASP Heuristics.
Proceedings of the Foundations of Computational Intelligence, 2009

Feedback Set Problems.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Shortest Path Tree Algorithms.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Oriented Matroids.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Matroids.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Linear Ordering Problem.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Cooperative networks, control and optimization.
Optim. Methods Softw., 2009

An annotated bibliography of GRASP-Part II: Applications.
Int. Trans. Oper. Res., 2009

An annotated bibliography of GRASP - Part I: Algorithms.
Int. Trans. Oper. Res., 2009

2008
Logic classification and feature selection for biomedical data.
Comput. Math. Appl., 2008

2007
A new meta-heuristic for the Bus Driver Scheduling Problem: GRASP combined with Rollout.
Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, 2007

2006
GRASP with path relinking for the weighted MAXSAT problem.
ACM J. Exp. Algorithmics, 2006

Shortest Path Algorithms.
Proceedings of the Handbook of Optimization in Telecommunications, 2006

2005
On optimal service selection.
Proceedings of the 14th international conference on World Wide Web, 2005

GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

2003
Shortest Path Auction Algorithm Without Contractions Using Virtual Source Concept.
Comput. Optim. Appl., 2003

2002
Randomized heuristics for the Max-Cut problem.
Optim. Methods Softw., 2002

2001
Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP.
ACM Trans. Math. Softw., 2001

Graph Collapsing in Shortest Path Auction Algorithms.
Comput. Optim. Appl., 2001

1999
Rendezvous of mobile robots in unknown environment via graph optimization approach.
Proceedings of the 5th European Control Conference, 1999

Feedback Set Problems.
Proceedings of the Handbook of Combinatorial Optimization, 1999

1998
The Auction Technique for the Sensor Based Navigation Planning of an Autonomous Mobile Robot.
J. Intell. Robotic Syst., 1998


  Loading...