Antonio Napoletano

According to our database, Antonio Napoletano authored at least 9 papers between 2016 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2020

Tabu search for min-max edge crossing in graphs.

Tommaso Pastore, Anna Martínez-Gavara, Antonio Napoletano, Paola Festa, Rafael Martí

Comput. Oper. Res., 2020

2019

Heuristics for the Constrained Incremental Graph Drawing Problem.

Antonio Napoletano, Anna Martínez-Gavara, Paola Festa, Tommaso Pastore, Rafael Martí

Eur. J. Oper. Res., 2019

An auction-based approach for the re-optimization shortest path tree problem.

Paola Festa, Francesca Guerriero, Antonio Napoletano

Comput. Optim. Appl., 2019

2017

On Some Optimization Problems on Dynamic Networks.

Antonio Napoletano

PhD thesis, 2017

A New Local Search for the p-Center Problem Based on the Critical Vertex Concept.

Daniele Ferone, Paola Festa, Antonio Napoletano, Mauricio G. C. Resende

Proceedings of the Learning and Intelligent Optimization - 11th International Conference, 2017

A GRASP for the Minimum Cost SAT Problem.

Giovanni Felici, Daniele Ferone, Paola Festa, Antonio Napoletano, Tommaso Pastore

Proceedings of the Learning and Intelligent Optimization - 11th International Conference, 2017

On the fast solution of the p-center problem.

Daniele Ferone, Paola Festa, Antonio Napoletano, Mauricio G. C. Resende

Proceedings of the 2017 19th International Conference on Transparent Optical Networks (ICTON), 2017

2016

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

Giovanni Felici, Daniele Ferone, Paola Festa, Antonio Napoletano, Tommaso Pastore

PeerJ Prepr., 2016

Reoptimizing shortest paths: From state of the art to new recent perspectives.

Daniele Ferone, Paola Festa, Antonio Napoletano, Tommaso Pastore

Proceedings of the 18th International Conference on Transparent Optical Networks, 2016