Carmine Cerrone

Orcid: 0000-0002-6243-4512

According to our database1, Carmine Cerrone authored at least 26 papers between 2014 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The generalized close enough traveling salesman problem.
Eur. J. Oper. Res., November, 2023

An exact reduction technique for the k-Colour Shortest Path Problem.
Comput. Oper. Res., 2023

Carousel Greedy Algorithms for Feature Selection in Linear Regression.
Algorithms, 2023

2022
VRP in urban areas to optimize costs while mitigating environmental impact.
Soft Comput., 2022

A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance.
Comput. Oper. Res., 2022

A Constructive Heuristics and an Iterated Neighborhood Search Procedure to Solve the Cost-Balanced Path Problem.
Algorithms, 2022

2021
Image convolution: a linear programming approach for filters design.
Soft Comput., 2021

Grocery distribution plans in urban networks with street crossing penalties.
Networks, 2021

2020
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem.
INFORMS J. Comput., 2020

2019
Heuristics for the strong generalized minimum label spanning tree problem.
Networks, 2019

A multiethnic genetic approach for the minimum conflict weighted spanning tree problem.
Networks, 2019

A two-stage solution approach for the Directed Rural Postman Problem with Turn Penalties.
Eur. J. Oper. Res., 2019

2018
The rainbow spanning forest problem.
Soft Comput., 2018

Business-Savvy Blockchains with Gamification: A Framework for Collaborative Problem Solving.
EAI Endorsed Trans. Serious Games, 2018

On the complexity of rainbow spanning forest problem.
Optim. Lett., 2018

2017
Partitioning a street network into compact, balanced, and visually appealing routes.
Networks, 2017

Carousel greedy: A generalized greedy algorithm with applications in optimization.
Comput. Oper. Res., 2017

A novel discretization scheme for the close enough traveling salesman problem.
Comput. Oper. Res., 2017

Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem.
Proceedings of the Green, Pervasive, and Cloud Computing - 12th International Conference, 2017

2016
OMEGA one multi ethnic genetic approach.
Optim. Lett., 2016

2015
Vehicle-ID sensor location for route flow recognition: Models and algorithms.
Eur. J. Oper. Res., 2015

2014
A memetic algorithm for the weighted feedback vertex set problem.
Networks, 2014

Multi-period street scheduling and sweeping.
Int. J. Metaheuristics, 2014

Relations, models and a memetic approach for three degree-dependent spanning tree problems.
Eur. J. Oper. Res., 2014

Locating sensors to observe network arc flows: Exact and heuristic approaches.
Comput. Oper. Res., 2014

A Tabu Search Approach for the Circle Packing Problem.
Proceedings of the 17th International Conference on Network-Based Information Systems, 2014


  Loading...