Roberto Javier Asín Achá

20 papers B 2Journal 16Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
A Theoretical Bound Which Improves the Performance of Compilation-Based Multi-Agent Path Finding.
IEEE Access
Rodrigo López, Roberto Javier Asín Achá, Jorge A. Baier
2025 J jnl
Automatic algorithm selection for Pseudo-Boolean optimization with given computational time limits.
Comput. Oper. Res.
Catalina Pezo, Dorit S. Hochbaum, Julio Godoy, Roberto Javier Asín Achá
2025 J jnl
Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study.
CoRR
Dorit S. Hochbaum, Ayleen Irribarra-Cortés, Olivier Goldschmidt, Roberto Javier Asín Achá
2025 J jnl
Heuristic-based computation of tailored spanning trees to speed up compact planar graphs.
Comput. J.
Ayleen Irribarra-Cortés, Roberto Javier Asín Achá, José Fuentes-Sepúlveda, Diego Seco
2024 B conf
A New Upper Bound for the Makespan of Cost-Optimal Solutions for Multi-Agent Path Finding (Extended Abstract).
SOCS
Rodrigo López, Roberto Javier Asín Achá, Jorge A. Baier
2024 J jnl
Anytime Automatic Algorithm Selection for the Multi-Agent Path Finding Problem.
IEEE Access
Angelo Zapata, Julio Godoy, Roberto Javier Asín Achá
2024 J jnl
Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques.
Networks
Roberto Javier Asín Achá, Alexis Espinoza, Olivier Goldschmidt, Dorit S. Hochbaum, Isaías I. Huerta
2024 — conf
Text-Based Feature-Free Automatic Algorithm Selection.
KDIR
Amanda Salinas-Pinto, Bryan Alvarado-Ulloa, Dorit S. Hochbaum, Matías Francia-Carramiñana, Ricardo Ñanculef, Roberto Javier Asín Achá
2023 J jnl
Automatic Algorithm Selection for Pseudo-Boolean Optimization with Given Computational Time Limits.
CoRR
Catalina Pezo, Dorit S. Hochbaum, Julio Godoy, Roberto Javier Asín Achá
2022 — conf
Fast Algorithms for the Capacitated Vehicle Routing Problem using Machine Learning Selection of Algorithm's Parameters.
KDIR
Roberto Javier Asín Achá, Olivier Goldschmidt, Dorit S. Hochbaum, Isaías I. Huerta
2022 J jnl
Improving the state-of-the-art in the Traveling Salesman Problem: An Anytime Automatic Algorithm Selection.
Expert Syst. Appl.
Isaías I. Huerta, Daniel A. Neira, Daniel A. Ortega, Vicente Varas, Julio Godoy, Roberto Javier Asín Achá
2022 J jnl
Multi-Agent Path Finding: A New Boolean Encoding.
J. Artif. Intell. Res.
Roberto Javier Asín Achá, Rodrigo López, Sebastián Hagedorn, Jorge A. Baier
2021 B conf
A New Boolean Encoding for MAPF and its Performance with ASP and MaxSAT Solvers.
SOCS
Roberto Javier Asín Achá, Rodrigo López, Sebastián Hagedorn, Jorge A. Baier
2020 J jnl
Anytime automatic algorithm selection for knapsack.
Expert Syst. Appl.
Isaías I. Huerta, Daniel A. Neira, Daniel A. Ortega, Vicente Varas, Julio Godoy, Roberto Javier Asín Achá
2020 J jnl
HNCcorr: combinatorial optimization for neuron identification.
Ann. Oper. Res.
Roberto Javier Asín Achá, Dorit S. Hochbaum, Quico Spaen
2020 J jnl
Multipath Adaptive A*: Factors That Influence Performance in Goal-Directed Navigation in Unknown Terrain.
IEEE Access
Carlos Hernández Ulloa, Jorge A. Baier, Roberto Javier Asín Achá
2018 J jnl
A column generation approach and new bounds for the car sequencing problem.
Ann. Oper. Res.
Eivind Jahren, Roberto Javier Asín Achá
2018 J jnl
Resizing cardinality constraints for MaxSAT.
AI Commun.
Eivind Jahren, Roberto Javier Asín Achá
2014 J jnl
Curriculum-based course timetabling with SAT and MaxSAT.
Ann. Oper. Res.
Roberto Javier Asín Achá, Robert Nieuwenhuis
2010 J jnl
Practical algorithms for unsatisfiability proof and core generation in SAT solvers.
AI Commun.
Roberto Javier Asín Achá, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell