default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoberto Javier Asín Achá
Person information
- affiliation: Polytechnic University of Catalonia, Barcelona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j14]Catalina Pezo
, Dorit S. Hochbaum, Julio Godoy, Roberto Javier Asín Achá:
Automatic algorithm selection for Pseudo-Boolean optimization with given computational time limits. Comput. Oper. Res. 173: 106836 (2025)- 2024
- [j13]Angelo Zapata, Julio Godoy, Roberto Javier Asín Achá:
Anytime Automatic Algorithm Selection for the Multi-Agent Path Finding Problem. IEEE Access 12: 62177-62188 (2024) - [c9]Rodrigo López, Roberto Javier Asín Achá, Jorge A. Baier:
A New Upper Bound for the Makespan of Cost-Optimal Solutions for Multi-Agent Path Finding (Extended Abstract). SOCS 2024: 275-276 - 2023
- [i2]Catalina Pezo, Dorit S. Hochbaum, Julio Godoy, Roberto Javier Asín Achá:
Automatic Algorithm Selection for Pseudo-Boolean Optimization with Given Computational Time Limits. CoRR abs/2309.03924 (2023) - 2022
- [j12]Isaías I. Huerta, Daniel A. Neira, Daniel A. Ortega, Vicente Varas, Julio Godoy, Roberto Javier Asín Achá:
Improving the state-of-the-art in the Traveling Salesman Problem: An Anytime Automatic Algorithm Selection. Expert Syst. Appl. 187: 115948 (2022) - [j11]Roberto Javier Asín Achá, Rodrigo López, Sebastián Hagedorn, Jorge A. Baier:
Multi-Agent Path Finding: A New Boolean Encoding. J. Artif. Intell. Res. 75: 323-350 (2022) - [c8]Alexander Irribarra-Cortés, José Fuentes-Sepúlveda, Diego Seco, Roberto Asín:
Speeding up compact planar graphs by using shallower trees. DCC 2022: 282-291 - [c7]Roberto Javier Asín Achá, Olivier Goldschmidt, Dorit S. Hochbaum, Isaías I. Huerta:
Fast Algorithms for the Capacitated Vehicle Routing Problem using Machine Learning Selection of Algorithm's Parameters. KDIR 2022: 29-39 - 2021
- [c6]Roberto Javier Asín Achá, Rodrigo López, Sebastián Hagedorn, Jorge A. Baier:
A New Boolean Encoding for MAPF and its Performance with ASP and MaxSAT Solvers. SOCS 2021: 11-19 - 2020
- [j10]Carlos Hernández Ulloa, Jorge A. Baier, Roberto Javier Asín Achá:
Multipath Adaptive A*: Factors That Influence Performance in Goal-Directed Navigation in Unknown Terrain. IEEE Access 8: 116724-116732 (2020) - [j9]Roberto Javier Asín Achá, Dorit S. Hochbaum, Quico Spaen:
HNCcorr: combinatorial optimization for neuron identification. Ann. Oper. Res. 289(1): 5-32 (2020) - [j8]Isaías I. Huerta, Daniel A. Neira, Daniel A. Ortega, Vicente Varas, Julio Godoy, Roberto Javier Asín Achá:
Anytime automatic algorithm selection for knapsack. Expert Syst. Appl. 158: 113613 (2020)
2010 – 2019
- 2018
- [j7]Eivind Jahren, Roberto Javier Asín Achá:
Resizing cardinality constraints for MaxSAT. AI Commun. 31(4): 355-367 (2018) - [j6]Eivind Jahren, Roberto Javier Asín Achá:
A column generation approach and new bounds for the car sequencing problem. Ann. Oper. Res. 264(1-2): 193-211 (2018) - 2016
- [j5]Roberto Asín, Marc Bezem, Robert Nieuwenhuis:
Improving IntSat by expressing disjunctions of bounds as linear constraints. AI Commun. 29(1): 205-209 (2016) - [j4]Carlos Hernández, Jorge A. Baier, Roberto Asín:
Time-Bounded Best-First Search for Reversible and Non-reversible Search Graphs. J. Artif. Intell. Res. 56: 547-571 (2016) - 2015
- [c5]Carlos Hernández, Roberto Asín, Jorge A. Baier:
Reusing Previously Found A* Paths for Fast Goal-Directed Navigation in Dynamic Terrain. AAAI 2015: 1158-1164 - 2014
- [j3]Roberto Javier Asín Achá, Robert Nieuwenhuis:
Curriculum-based course timetabling with SAT and MaxSAT. Ann. Oper. Res. 218(1): 71-91 (2014) - [c4]Carlos Hernández, Jorge A. Baier, Roberto Asín:
Making A* Run Faster than D*-Lite for Path-Planning in Partially Known Terrain. ICAPS 2014 - [c3]Carlos Hernández, Roberto Asín, Jorge A. Baier:
Time-Bounded Best-First Search. SOCS 2014: 97-104 - 2013
- [i1]Roberto Asín, Juan Olate, Leo Ferres:
Cache Performance Study of Portfolio-Based Parallel CDCL SAT Solvers. CoRR abs/1309.3187 (2013) - 2011
- [j2]Roberto Asín, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell:
Cardinality Networks: a theoretical and empirical study. Constraints An Int. J. 16(2): 195-221 (2011) - 2010
- [j1]Roberto Javier Asín Achá, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell:
Practical algorithms for unsatisfiability proof and core generation in SAT solvers. AI Commun. 23(2-3): 145-157 (2010)
2000 – 2009
- 2009
- [c2]Roberto Asín, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell:
Cardinality Networks and Their Applications. SAT 2009: 167-180 - 2008
- [c1]Roberto Asín, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell:
Efficient Generation of Unsatisfiability Proofs and Cores in SAT. LPAR 2008: 16-30
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
