default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaola Festa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j46]Paola Festa, Luca Di Gaspero, Mario Pavone, Mauricio G. C. Resende:
Preface to the Special Issue on Metaheuristics: Recent Advances and Applications. Int. Trans. Oper. Res. 32(1): 5 (2025)- [j45]Daniele Ferone
, Paola Festa, Serena Fugaro, Tommaso Pastore:
Hybridizing a matheuristic with ALNS for the optimal collection and delivery of medical specimens. Int. Trans. Oper. Res. 32(1): 90-116 (2025) - 2024
- [i4]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 abs/2405.00268 (2024) - 2023
- [j44]Daniele Ferone, Paola Festa, Tommaso Pastore, Mauricio G. C. Resende:
Efficient GRASP solution approach for the Prisoner Transportation Problem. Comput. Oper. Res. 153: 106161 (2023) - [j43]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): 204-219 (2023) - [j42]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): 1981-2003 (2023) - [e4]Luca Di Gaspero, Paola Festa, Amir Nakib, Mario Pavone:
Metaheuristics - 14th International Conference, MIC 2022, Syracuse, Italy, July 11-14, 2022, Proceedings. Lecture Notes in Computer Science 13838, Springer 2023, ISBN 978-3-031-26503-7 [contents] - 2022
- [j41]Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa, Francesca Guerriero:
A generalized shortest path tour problem with time windows. Comput. Optim. Appl. 83(2): 593-614 (2022) - [j40]Daniele Ferone, Paola Festa, Francesca Guerriero:
The Rainbow Steiner Tree Problem. Comput. Oper. Res. 139: 105621 (2022) - [j39]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: 105770 (2022) - [j38]Paola Festa, Serena Fugaro, Francesca Guerriero:
Shortest path reoptimization vs resolution from scratch: a computational comparison. Optim. Methods Softw. 37(3): 1122-1144 (2022) - [j37]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): 1384-1414 (2022) - [c27]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: 17-29 - 2021
- [j36]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): 1129-1149 (2021) - [j35]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: 105272 (2021) - [j34]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): 1876-1904 (2021) - [j33]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): 17-31 (2021) - [j32]Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore:
A dynamic programming algorithm for solving the k-Color Shortest Path Problem. Optim. Lett. 15(6): 1973-1992 (2021) - 2020
- [j31]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): 145-153 (2020) - [j30]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) - [j29]Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa, Francesca Guerriero:
Shortest path tour problem with time windows. Eur. J. Oper. Res. 282(1): 334-344 (2020) - [j28]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): 1368-1391 (2020) - [j27]Daniele Ferone, Paola Festa, Francesca Guerriero:
An efficient exact approach for the constrained shortest path tour problem. Optim. Methods Softw. 35(1): 1-20 (2020) - [c26]Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore:
On the Shortest Path Problems with Edge Constraints. ICTON 2020: 1-4
2010 – 2019
- 2019
- [j26]Paola Festa, Francesca Guerriero, Antonio Napoletano:
An auction-based approach for the re-optimization shortest path tree problem. Comput. Optim. Appl. 74(3): 851-893 (2019) - [j25]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): 710-729 (2019) - [j24]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): 1362-1375 (2019) - 2018
- [c25]Sergio Di Martino, Paola Festa, Dario Asprone:
Adapting the A* Algorithm to Increase Vehicular Crowd-Sensing Coverage. ICCL 2018: 331-343 - [c24]Michele Mele, Paola Festa:
Scheduling Assistance for Passengers with Special Needs in Large Scale Airports. ICCL 2018: 388-400 - [c23]Fernando Morales, Paola Festa, Marc Ruiz, Luis Velasco:
Performance Evaluation of the VNT Reconfiguration Algorithm Based on Traffic Prediction. ICTON 2018: 1-4 - [c22]Dario Asprone, Sergio Di Martino, Paola Festa:
Improving Sensing Coverage of Probe Vehicles with Probabilistic Routing. W2GIS 2018: 1-10 - [c21]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: 2989-3000 - [r7]Paola Festa, Mauricio G. C. Resende:
GRASP. Handbook of Heuristics 2018: 465-488 - [r6]Christian Blum, Paola Festa:
Selected String Problems. Handbook of Heuristics 2018: 1221-1240 - 2017
- [c20]Daniele Ferone, Paola Festa, Antonio Napoletano, Mauricio G. C. Resende:
On the fast solution of the p-center problem. ICTON 2017: 1-4 - [c19]Fernando Morales, Paola Festa, Marc Ruiz, Luis Velasco:
Adapting the virtual network topology to near future traffic. ICTON 2017: 1-4 - [c18]Giovanni Felici, Daniele Ferone, Paola Festa, Antonio Napoletano, Tommaso Pastore:
A GRASP for the Minimum Cost SAT Problem. LION 2017: 64-78 - [c17]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: 79-92 - 2016
- [j23]Daniele Ferone, Paola Festa, Francesca Guerriero, Demetrio Laganà:
The constrained shortest path tour problem. Comput. Oper. Res. 74: 64-77 (2016) - [j22]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): 389-399 (2016) - [j21]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): 481-506 (2016) - [j20]Marianna De Santis, Paola Festa, Giampaolo Liuzzi, Stefano Lucidi, Francesco Rinaldi:
A nonmonotone GRASP. Math. Program. Comput. 8(3): 271-309 (2016) - [c16]Daniele Ferone, Paola Festa, Antonio Napoletano, Tommaso Pastore:
Reoptimizing shortest paths: From state of the art to new recent perspectives. ICTON 2016: 1-5 - [c15]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: 2205-2215 - [e3]Paola Festa, Meinolf Sellmann, Joaquin Vanschoren:
Learning and Intelligent Optimization - 10th International Conference, LION 10, Ischia, Italy, May 29 - June 1, 2016, Revised Selected Papers. Lecture Notes in Computer Science 10079, Springer 2016, ISBN 978-3-319-50348-6 [contents] - [i3]Daniele Ferone, Angelo M. Facchiano, Anna Marabotti, Paola Festa:
A new GRASP metaheuristic for biclustering of gene expression data. PeerJ Prepr. 4: e1679 (2016) - [i2]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: e2635 (2016) - 2015
- [c14]Paola Festa:
Constrained shortest path problems: state-of-the-art and recent advances. ICTON 2015: 1-17 - [c13]Giuseppe Vettigli, Mingyue Ji, Antonia M. Tulino, Jaime Llorca, Paola Festa:
An efficient coded multicasting scheme preserving the multiplicative caching gain. INFOCOM Workshops 2015: 251-256 - [i1]Giuseppe Vettigli, Mingyue Ji, Antonia M. Tulino, Jaime Llorca, Paola Festa:
An Efficient Coded Multicasting Scheme Preserving the Multiplicative Caching Gain. CoRR abs/1511.07531 (2015) - 2014
- [j19]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): 1225-1243 (2014) - [c12]Christian Blum, Paola Festa:
A Hybrid Ant Colony Optimization Algorithm for the Far From Most String Problem. EvoCOP 2014: 1-12 - [c11]Paola Festa:
A brief introduction to exact, approximation, and heuristic algorithms for solving hard combinatorial optimization problems. ICTON 2014: 1-20 - [c10]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: 223-226 - [p5]Paola Festa:
On Data Clustering: Exact and Approximate Solutions. Examining Robustness and Vulnerability of Networked Systems 2014: 65-82 - 2013
- [j18]Paola Festa, Francesca Guerriero, Demetrio Laganà, Roberto Musmanno:
Solving the shortest path tour problem. Eur. J. Oper. Res. 230(3): 464-474 (2013) - [j17]Paola Festa:
Foreword to the special issue SEA 2010. ACM J. Exp. Algorithmics 18 (2013) - [c9]Daniele Ferone, Paola Festa, Mauricio G. C. Resende:
Hybrid Metaheuristics for the Far From Most String Problem. Hybrid Metaheuristics 2013: 174-188 - [p4]Paola Festa, Mauricio G. C. Resende:
Hybridizations of GRASP with Path-Relinking. Hybrid Metaheuristics 2013: 135-155 - [e2]Maria J. Blesa, Christian Blum, Paola Festa, Andrea Roli, Michael Sampels:
Hybrid Metaheuristics - 8th International Workshop, HM 2013, Ischia, Italy, May 23-25, 2013. Proceedings. Lecture Notes in Computer Science 7919, Springer 2013, ISBN 978-3-642-38515-5 [contents] - 2012
- [j16]Paola Festa, Panos M. Pardalos:
Efficient solutions for the far from most string problem. Ann. Oper. Res. 196(1): 663-682 (2012) - [j15]Paola Festa:
Complexity analysis and optimization of the shortest path tour problem. Optim. Lett. 6(1): 163-175 (2012) - 2011
- [j14]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): 441-466 (2011) - [j13]Renato De Leone, Paola Festa, Emilia Marchitto:
Solving a bus driver scheduling problem with randomized multistart heuristics. Int. Trans. Oper. Res. 18(6): 707-727 (2011) - [j12]Paola Festa, Mauricio G. C. Resende:
GRASP: basic components and enhancements. Telecommun. Syst. 46(3): 253-271 (2011) - [c8]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: 253-267 - [c7]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: 410-420 - [c6]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: 421-433 - 2010
- [j11]Paola Bertolazzi, Giovanni Felici, Paola Festa:
Logic based methods for SNPs tagging and reconstruction. Comput. Oper. Res. 37(8): 1419-1426 (2010) - [c5]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: 338-349 - [e1]Paola Festa:
Experimental Algorithms, 9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings. Lecture Notes in Computer Science 6049, Springer 2010, ISBN 978-3-642-13192-9 [contents]
2000 – 2009
- 2009
- [j10]Paola Festa, Mauricio G. C. Resende:
An annotated bibliography of GRASP - Part I: Algorithms. Int. Trans. Oper. Res. 16(1): 1-24 (2009) - [j9]Paola Festa, Mauricio G. C. Resende:
An annotated bibliography of GRASP-Part II: Applications. Int. Trans. Oper. Res. 16(2): 131-172 (2009) - [j8]Paola Festa:
Cooperative networks, control and optimization. Optim. Methods Softw. 24(6): 989-992 (2009) - [p3]Paola Festa, Mauricio G. C. Resende:
Hybrid GRASP Heuristics. Foundations of Computational Intelligence (3) 2009: 75-100 - [r5]Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende:
Feedback Set Problems. Encyclopedia of Optimization 2009: 1005-1016 - [r4]Paola Festa:
Linear Ordering Problem. Encyclopedia of Optimization 2009: 1881-1883 - [r3]Paola Festa:
Matroids. Encyclopedia of Optimization 2009: 1975-1981 - [r2]Paola Festa:
Oriented Matroids. Encyclopedia of Optimization 2009: 2878-2886 - [r1]Paola Festa:
Shortest Path Tree Algorithms. Encyclopedia of Optimization 2009: 3507-3519 - 2008
- [j7]Paola Bertolazzi, Giovanni Felici, Paola Festa, Giuseppe Lancia:
Logic classification and feature selection for biomedical data. Comput. Math. Appl. 55(5): 889-899 (2008) - 2007
- [c4]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: 192-197 - 2006
- [j6]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) - [p2]Paola Festa:
Shortest Path Algorithms. Handbook of Optimization in Telecommunications 2006: 185-210 - 2005
- [c3]Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende:
GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem. WEA 2005: 367-379 - [c2]Piero A. Bonatti, Paola Festa:
On optimal service selection. WWW 2005: 530-538 - 2003
- [j5]Raffaele Cerulli, Paola Festa, Giancarlo Raiconi:
Shortest Path Auction Algorithm Without Contractions Using Virtual Source Concept. Comput. Optim. Appl. 26(2): 191-208 (2003) - 2002
- [j4]Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende, Celso C. Ribeiro:
Randomized heuristics for the Max-Cut problem. Optim. Methods Softw. 17(6): 1033-1058 (2002) - 2001
- [j3]Patrizia Cerulli, Paola Festa, Giancarlo Raiconi:
Graph Collapsing in Shortest Path Auction Algorithms. Comput. Optim. Appl. 18(3): 199-220 (2001) - [j2]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): 456-464 (2001)
1990 – 1999
- 1999
- [c1]R. Cernili, Paola Festa, G. Raiconi:
Rendezvous of mobile robots in unknown environment via graph optimization approach. ECC 1999: 4750-4755 - [p1]Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende:
Feedback Set Problems. Handbook of Combinatorial Optimization 1999: 209-258 - 1998
- [j1]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): 373-395 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
