Jose M. G. Salmerón

According to our database, Jose M. G. Salmerón authored at least 5 papers between 2016 and 2018.

Collaborative distances:

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

2018

Parallel algorithms for computing the smallest binary tree size in unit simplex refinement.

Guillermo Aparicio, Jose M. G. Salmerón, Leocadio G. Casado, Rafael Asenjo, Eligius M. T. Hendrix

J. Parallel Distributed Comput., 2018

2017

On parallel Branch and Bound frameworks for Global Optimization.

Juan F. R. Herrera, Jose M. G. Salmerón, Eligius M. T. Hendrix, Rafael Asenjo, Leocadio G. Casado

J. Glob. Optim., 2017

Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement.

Jose M. G. Salmerón, Guillermo Aparicio, Leocadio G. Casado, Inmaculada García, Eligius M. T. Hendrix, Boglárka G.-Tóth

J. Comb. Optim., 2017

On Grid Aware Refinement of the Unit Hypercube and Simplex: Focus on the Complete Tree Size.

Leocadio G. Casado, Eligius M. T. Hendrix, Jose M. G. Salmerón, Boglárka G.-Tóth, Inmaculada García

Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

2016

On Bisecting the Unit Simplex Using Various Distance Norms.

Jose M. G. Salmerón, Leocadio G. Casado, Eligius M. T. Hendrix

Informatica, 2016