Urmăriți
Pablo San Segundo
Pablo San Segundo
Associate Professor (UPM-Spain)
Adresă de e-mail confirmată pe upm.es - Pagina de pornire
Titlu
Citat de
Citat de
Anul
An exact bit-parallel algorithm for the maximum clique problem
P San Segundo, D Rodríguez-Losada, A Jiménez
Computers & Operations Research 38 (2), 571-581, 2011
1852011
An improved bit parallel exact maximum clique algorithm
P San Segundo Carrillo, F Matía Espada, D Rodríguez-Losada González, ...
Optimization Letters 4 (3), 3-15, 2011
1092011
A new DSATUR-based algorithm for exact vertex coloring
P San Segundo
Computers & Operations Research 39 (7), 1724-1733, 2012
772012
A new exact maximum clique algorithm for large and massive sparse graphs
P San Segundo, A Lopez, PM Pardalos
Computers & Operations Research 66, 81-94, 2016
702016
Infra-chromatic bound for exact maximum clique search
P San Segundo, A Nikolaev, M Batsyn
Computers & Operations Research 64, 293-303, 2015
492015
Relaxed approximate coloring in exact maximum clique search
P San Segundo, C Tapia
Computers & Operations Research 44, 185-192, 2014
492014
A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
S Coniglio, F Furini, P San Segundo
European Journal of Operational Research 289 (2), 435-455, 2021
412021
Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver
P San Segundo, D Rodríguez-Losada, F Matía, R Galán
Applied Intelligence 32, 311-329, 2010
342010
The maximum clique interdiction problem
F Furini, I Ljubić, S Martin, P San Segundo
European Journal of Operational Research 277 (1), 112-127, 2019
332019
Robust global feature based data association with a sparse bit optimized maximum clique algorithm
P San Segundo, D Rodriguez-Losada
IEEE Transactions on Robotics 29 (5), 1332-1339, 2013
272013
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
P San Segundo, S Coniglio, F Furini, I Ljubić
European Journal of Operational Research 278 (1), 76-90, 2019
262019
A novel clique formulation for the visual feature matching problem
P San Segundo, J Artieda
Applied Intelligence 43, 325-342, 2015
252015
Efficiently enumerating all maximal cliques with bit-parallelism
P San Segundo, J Artieda, D Strash
Computers & Operations Research 92, 37-46, 2018
222018
Efficient search using bitboard models
P San Segundo, R Galán, F Matia, D Rodriguez-Losada, A Jimenez
2006 18th IEEE International Conference on Tools with Artificial …, 2006
212006
Improved initial vertex ordering for exact maximum clique search
PS Segundo, A Lopez, M Batsyn, A Nikolaev, PM Pardalos
Applied Intelligence 45, 868-880, 2016
202016
A new branch-and-bound algorithm for the maximum weighted clique problem
P San Segundo, F Furini, J Artieda
Computers & Operations Research 110, 18-33, 2019
192019
Improved infra-chromatic bound for exact maximum clique search
P San Segundo, A Nikolaev, M Batsyn, PM Pardalos
Informatica 27 (2), 463-487, 2016
192016
A branch-and-cut algorithm for the edge interdiction clique problem
F Furini, I Ljubić, P San Segundo, Y Zhao
European Journal of Operational Research 294 (1), 54-69, 2021
172021
A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
L Komosko, M Batsyn, PS Segundo, PM Pardalos
Journal of Combinatorial Optimization 31, 1665-1677, 2016
152016
Gpu-mapping: Robotic map building with graphical multiprocessors
D Rodriguez-Losada, P San Segundo, M Hernando, P de la Puente, ...
IEEE Robotics & Automation Magazine 20 (2), 40-51, 2013
152013
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20