default search action
Francesco Carrabs
Person information
- affiliation: University of Salerno, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j34]Francesco Carrabs
, Raffaele Cerulli
Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP. Comput. Oper. Res. 166: 106620 (2024) - [j33]Francesco Carrabs
A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem. EURO J. Comput. Optim. 12: 100092 (2024) - [j32]Claudia Archetti
A new formulation and a branch-and-cut algorithm for the set orienteering problem. Eur. J. Oper. Res. 314(2): 446-465 (2024) - [j31]Claudia Archetti, Francesco Carrabs, Raffaele Cerulli, Federica Laureana:
Corrigendum to "A New Formulation and a Branch-and-Cut Algorithm for the Set Orienteering Problem" [European Journal of Operational Research, Volume 314, Issue 2, 16 April 2024, Pages 446-465]. Eur. J. Oper. Res. 316(2): 798 (2024) - [i1]Francesco Carrabs, Martina Cerulli, Domenico Serra:
Kernel Search approach to solve the Minimum Spanning Tree Problem with conflicting edge pairs. CoRR abs/2401.02222 (2024) - 2023
- [j30]Francesco Carrabs
A genetic approach for the 2-edge-connected minimum branch vertices problem. Networks 82(4): 301-317 (2023) - 2021
- [j29]Francesco Carrabs
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach. Ann. Oper. Res. 298(1): 65-78 (2021) - [j28]Francesco Carrabs
A biased random-key genetic algorithm for the set orienteering problem. Eur. J. Oper. Res. 292(3): 830-854 (2021) - [j27]Francesco Carrabs
The Generalized Minimum Branch Vertices Problem: Properties and Polyhedral Analysis. J. Optim. Theory Appl. 188(2): 356-377 (2021) - [j26]Francesco Carrabs
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions. Networks 78(1): 17-31 (2021) - [j25]Francesco Carrabs
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs. Networks 78(1): 32-45 (2021) - [j24]Francesco Carrabs
Optimization of sensor battery charging to maximize lifetime in a wireless sensors network. Optim. Lett. 15(5): 1587-1600 (2021) - [j23]Francesco Carrabs
A reduction heuristic for the all-colors shortest path problem. RAIRO Oper. Res. 55(Supplement): S2071-S2082 (2021) - 2020
- [j22]Francesco Carrabs
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem. INFORMS J. Comput. 32(4): 1030-1048 (2020)
2010 – 2019
- 2019
- [j21]Francesco Carrabs
Exact approaches for the orderly colored longest path problem: Performance comparison. Comput. Oper. Res. 101: 275-284 (2019) - [j20]Francesco Carrabs
A multiethnic genetic approach for the minimum conflict weighted spanning tree problem. Networks 74(2): 134-147 (2019) - 2018
- [j19]Francesco Carrabs
A two-level metaheuristic for the all colors shortest path problem. Comput. Optim. Appl. 71(2): 525-551 (2018) - [j18]Claudia Archetti
The Set Orienteering Problem. Eur. J. Oper. Res. 267(1): 264-272 (2018) - [j17]Francesco Carrabs
Preface: Theoretical and algorithmic contributions to network optimization problems. Networks 71(4): 325 (2018) - [j16]Francesco Carrabs
On the complexity of rainbow spanning forest problem. Optim. Lett. 12(3): 443-454 (2018) - [j15]Francesco Carrabs
The rainbow spanning forest problem. Soft Comput. 22(8): 2765-2776 (2018) - 2017
- [j14]Francesco Carrabs
A novel discretization scheme for the close enough traveling salesman problem. Comput. Oper. Res. 78: 163-171 (2017) - [j13]Francesco Carrabs
An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints. Optim. Lett. 11(7): 1341-1356 (2017) - [j12]Francesco Carrabs
Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints. RAIRO Oper. Res. 51(3): 607-625 (2017) - [j11]Francesco Carrabs
An exact approach for the grocery delivery problem in urban areas. Soft Comput. 21(9): 2439-2450 (2017) - [c6]Francesco Carrabs
Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem. GPC 2017: 165-177 - [c5]Francesco Carrabs
Prolonging Lifetime in Wireless Sensor Networks with Interference Constraints. GPC 2017: 285-297 - 2015
- [j10]Francesco Carrabs
Maximizing lifetime in wireless sensor networks with multiple sensor families. Comput. Oper. Res. 60: 121-137 (2015) - [j9]Francesco Carrabs
A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints. J. Netw. Comput. Appl. 58: 12-22 (2015) - 2014
- [j8]Francesco Carrabs
A memetic algorithm for the weighted feedback vertex set problem. Networks 64(4): 339-356 (2014) - [c4]Francesco Carrabs
A Tabu Search Approach for the Circle Packing Problem. NBiS 2014: 165-171 - 2013
- [j7]Francesco Carrabs
Lower and upper bounds for the spanning tree with minimum branch vertices. Comput. Optim. Appl. 56(2): 405-438 (2013) - [j6]Francesco Carrabs
A branch-and-bound algorithm for the double travelling salesman problem with two stacks. Networks 61(1): 58-75 (2013) - 2011
- [c3]Paolo Dell'Olmo, Raffaele Cerulli, Francesco Carrabs:
The maximum labeled clique problem. CTW 2011: 146-149 - [c2]Francesco Carrabs
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem. INOC 2011: 589-602
2000 – 2009
- 2009
- [j5]Francesco Carrabs
The labeled maximum matching problem. Comput. Oper. Res. 36(6): 1859-1871 (2009) - 2007
- [j4]Francesco Carrabs
An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading. INFOR Inf. Syst. Oper. Res. 45(4): 223-238 (2007) - [j3]Francesco Carrabs
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading. INFORMS J. Comput. 19(4): 618-632 (2007) - 2005
- [j2]Francesco Carrabs
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds. Inf. Process. Lett. 94(1): 29-35 (2005) - 2004
- [j1]Francesco Carrabs
Minimum Weighted Feedback Vertex Set on Diamonds. Electron. Notes Discret. Math. 17: 87-91 (2004) - [c1]Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato:
Minimum Weighted Feedback Vertex Set on Diamonds. CTW 2004: 81-85
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:45 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: