( en | de | ru )

 

Disambiguation of "Napoletano, Antonio"

Author of the publication

copydeleteadd this publication to your clipboard
The solution of large-scale Minimum Cost SAT Problem as a tool for data analysis in bioinformatics.

, , , , and . PeerJ PrePrints, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Gino Napoletano

Antonio Nuzzo

Antonio Galeano

Antonio Souto

Antonio Peter

 

Other publications of authors with the same name

The solution of large-scale Minimum Cost SAT Problem as a tool for data analysis in bioinformatics., , , , and . PeerJ PrePrints, (2016)On Some Optimization Problems on Dynamic Networks.. University of Naples Federico II, Italy, (2017)base-search.net (ftunivnapoli:oai:fedoa.unina.it:12063).Tabu search for min-max edge crossing in graphs., , , , and . Comput. Oper. Res., (2020)Reoptimizing shortest paths: From state of the art to new recent perspectives., , , and . ICTON, page 1-5. IEEE, (2016)A GRASP for the Minimum Cost SAT Problem., , , , and . LION, volume 10556 of Lecture Notes in Computer Science, page 64-78. Springer, (2017)A New Local Search for the p-Center Problem Based on the Critical Vertex Concept., , , and . LION, volume 10556 of Lecture Notes in Computer Science, page 79-92. Springer, (2017)An auction-based approach for the re-optimization shortest path tree problem., , and . Comput. Optim. Appl., 74 (3): 851-893 (2019)Heuristics for the Constrained Incremental Graph Drawing Problem., , , , and . Eur. J. Oper. Res., 274 (2): 710-729 (2019)On the fast solution of the p-center problem., , , and . ICTON, page 1-4. IEEE, (2017)