![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Carmine Cerrone
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
- [j24]Jiaqi Wang, Bruce L. Golden, Carmine Cerrone
:
Carousel Greedy Algorithms for Feature Selection in Linear Regression. Algorithms 16(9): 447 (2023) - [j23]Carmine Cerrone
, Davide Donato Russo
:
An exact reduction technique for the k-Colour Shortest Path Problem. Comput. Oper. Res. 149: 106027 (2023) - [j22]Andrea Di Placido
, Claudia Archetti
, Carmine Cerrone
, Bruce L. Golden
:
The generalized close enough traveling salesman problem. Eur. J. Oper. Res. 310(3): 974-991 (2023) - 2022
- [j21]Daniela Ambrosino
, Carmine Cerrone
, Anna Sciomachen
:
A Constructive Heuristics and an Iterated Neighborhood Search Procedure to Solve the Cost-Balanced Path Problem. Algorithms 15(10): 364 (2022) - [j20]Andrea Di Placido
, Claudia Archetti
, Carmine Cerrone
:
A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance. Comput. Oper. Res. 145: 105831 (2022) - [j19]Carmine Cerrone
, Anna Sciomachen
:
VRP in urban areas to optimize costs while mitigating environmental impact. Soft Comput. 26(19): 10223-10237 (2022) - 2021
- [j18]Carmine Cerrone
, Raffaele Cerulli, Anna Sciomachen:
Grocery distribution plans in urban networks with street crossing penalties. Networks 78(3): 248-263 (2021) - [j17]Giovanni Capobianco, Carmine Cerrone
, Andrea Di Placido, Daniel Durand, Luigi Pavone, Davide Donato Russo
, Fabio Sebastiano:
Image convolution: a linear programming approach for filters design. Soft Comput. 25(14): 8941-8956 (2021) - 2020
- [j16]Francesco Carrabs
, Carmine Cerrone
, Raffaele Cerulli
, Bruce L. Golden
:
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) - 2019
- [j15]Carmine Cerrone
, Benjamin Dussault, Xingyin Wang, Bruce L. Golden, Edward A. Wasil:
A two-stage solution approach for the Directed Rural Postman Problem with Turn Penalties. Eur. J. Oper. Res. 272(2): 754-765 (2019) - [j14]Francesco Carrabs
, Carmine Cerrone
, Rosa Pentangelo
:
A multiethnic genetic approach for the minimum conflict weighted spanning tree problem. Networks 74(2): 134-147 (2019) - [j13]Carmine Cerrone
, Ciriaco D'Ambrosio
, Andrea Raiconi
:
Heuristics for the strong generalized minimum label spanning tree problem. Networks 74(2): 148-160 (2019) - 2018
- [j12]Francesco Carrabs
, Carmine Cerrone
, Raffaele Cerulli, Selene Silvestri:
On the complexity of rainbow spanning forest problem. Optim. Lett. 12(3): 443-454 (2018) - [j11]Stefano Dalla Palma, Damian Andrew Tamburri, Remo Pareschi, Carmine Cerrone
, Willem-Jan van den Heuvel:
Business-Savvy Blockchains with Gamification: A Framework for Collaborative Problem Solving. EAI Endorsed Trans. Serious Games 5(16): e5 (2018) - [j10]Francesco Carrabs
, Carmine Cerrone
, Raffaele Cerulli, Selene Silvestri:
The rainbow spanning forest problem. Soft Comput. 22(8): 2765-2776 (2018) - 2017
- [j9]Francesco Carrabs
, Carmine Cerrone
, Raffaele Cerulli, Manlio Gaudioso:
A novel discretization scheme for the close enough traveling salesman problem. Comput. Oper. Res. 78: 163-171 (2017) - [j8]Carmine Cerrone
, Raffaele Cerulli, Bruce L. Golden:
Carousel greedy: A generalized greedy algorithm with applications in optimization. Comput. Oper. Res. 85: 97-112 (2017) - [j7]Oliver Lum, Carmine Cerrone
, Bruce L. Golden, Edward A. Wasil:
Partitioning a street network into compact, balanced, and visually appealing routes. Networks 69(3): 290-303 (2017) - 2016
- [j6]Carmine Cerrone
, Raffaele Cerulli, Manlio Gaudioso
:
OMEGA one multi ethnic genetic approach. Optim. Lett. 10(2): 309-324 (2016) - 2015
- [j5]Carmine Cerrone
, Raffaele Cerulli, Monica Gentili:
Vehicle-ID sensor location for route flow recognition: Models and algorithms. Eur. J. Oper. Res. 247(2): 618-629 (2015) - 2014
- [j4]Lucio Bianco, Carmine Cerrone
, Raffaele Cerulli
, Monica Gentili:
Locating sensors to observe network arc flows: Exact and heuristic approaches. Comput. Oper. Res. 46: 12-22 (2014) - [j3]Carmine Cerrone
, Raffaele Cerulli
, Andrea Raiconi
:
Relations, models and a memetic approach for three degree-dependent spanning tree problems. Eur. J. Oper. Res. 232(3): 442-453 (2014) - [j2]Carmine Cerrone
, Benjamin Dussault, Bruce L. Golden, Edward A. Wasil:
Multi-period street scheduling and sweeping. Int. J. Metaheuristics 3(1): 21-58 (2014) - [j1]Francesco Carrabs
, Carmine Cerrone
, Raffaele Cerulli
:
A memetic algorithm for the weighted feedback vertex set problem. Networks 64(4): 339-356 (2014)
Conference and Workshop Papers
- 2017
- [c2]Francesco Carrabs
, Carmine Cerrone
, Raffaele Cerulli, Ciriaco D'Ambrosio
:
Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem. GPC 2017: 165-177 - 2014
- [c1]Francesco Carrabs
, Carmine Cerrone
, Raffaele Cerulli:
A Tabu Search Approach for the Circle Packing Problem. NBiS 2014: 165-171
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint