Ignacio Figueroa

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The set covering problem is a classical optimization benchmark that finds application in several real-world domains, particularly in line balancing production, crew scheduling, and service installation. The problem consists in finding a subset of columns in a zero-one matrix such that they cover all the rows of the matrix at a minimum cost. In this paper,(More)
The Set Covering Problem is a classical problem in combinatorial optimization that belongs to the Karp's 21 NP-hard problems, with many practical applications. In this paper, an approach based on Black Hole Algorithm is proposed to solve this problem. The black hole algorithm is a metaheuristic that is inspired by nature, especially by the black hole(More)
A modified sol-gel process for synthesizing nanocrystalline hydroxyapatite powders (nHA) for biomedical applications, using tetrahydrated calcium nitrate [Ca(NO(3))(2)∙4H(2)O] and phosphorous pentoxide [P(2)O(5)] as precursor, is presented and discussed. The powders were washed and heat-treated at different temperatures and then characterized by X-ray(More)
  • 1