Roberto Javier Asín Achá

Comput. Oper. Res., 2025

2024

Anytime Automatic Algorithm Selection for the Multi-Agent Path Finding Problem.

[BibT_eX]

[DOI]

Angelo Zapata

Julio Godoy

IEEE Access, 2024

A New Upper Bound for the Makespan of Cost-Optimal Solutions for Multi-Agent Path Finding (Extended Abstract).

[BibT_eX]

[DOI]

Rodrigo López

Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

2022

Multi-Agent Path Finding: A New Boolean Encoding.

[BibT_eX]

[DOI]

Rodrigo López

Sebastián Hagedorn

J. Artif. Intell. Res., 2022

Improving the state-of-the-art in the Traveling Salesman Problem: An Anytime Automatic Algorithm Selection.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2022

Fast Algorithms for the Capacitated Vehicle Routing Problem using Machine Learning Selection of Algorithm's Parameters.

[BibT_eX]

[DOI]

Alexander Irribarra-Cortés

Olivier Goldschmidt

Dorit S. Hochbaum

Isaías I. Huerta

Proceedings of the 14th International Joint Conference on Knowledge Discovery, 2022

Speeding up compact planar graphs by using shallower trees.

[BibT_eX]

[DOI]

José Fuentes-Sepúlveda

Diego Seco

Proceedings of the Data Compression Conference, 2022

2021

A New Boolean Encoding for MAPF and its Performance with ASP and MaxSAT Solvers.

[BibT_eX]

[DOI]

Rodrigo López

Sebastián Hagedorn

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

2020

Anytime automatic algorithm selection for knapsack.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2020

HNCcorr: combinatorial optimization for neuron identification.

[BibT_eX]

[DOI]

Dorit S. Hochbaum

Quico Spaen

Ann. Oper. Res., 2020

Multipath Adaptive A*: Factors That Influence Performance in Goal-Directed Navigation in Unknown Terrain.

[BibT_eX]

[DOI]

Carlos Hernández Ulloa

IEEE Access, 2020

2018

A column generation approach and new bounds for the car sequencing problem.

[BibT_eX]

[DOI]

Eivind Jahren

Ann. Oper. Res., 2018

Resizing cardinality constraints for MaxSAT.

[BibT_eX]

[DOI]

Eivind Jahren

AI Commun., 2018

2016

Time-Bounded Best-First Search for Reversible and Non-reversible Search Graphs.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2016

Improving IntSat by expressing disjunctions of bounds as linear constraints.

[BibT_eX]

[DOI]

Marc Bezem

AI Commun., 2016

2015

Reusing Previously Found A* Paths for Fast Goal-Directed Navigation in Dynamic Terrain.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Curriculum-based course timetabling with SAT and MaxSAT.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2014

Time-Bounded Best-First Search.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Making A* Run Faster than D*-Lite for Path-Planning in Partially Known Terrain.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

2013

Cache Performance Study of Portfolio-Based Parallel CDCL SAT Solvers.

[BibT_eX]

[DOI]

Juan Olate

Leo Ferres

CoRR, 2013

2011

Cardinality Networks: a theoretical and empirical study.

[BibT_eX]

[DOI]

Constraints An Int. J., 2011

2010

Practical algorithms for unsatisfiability proof and core generation in SAT solvers.

[BibT_eX]

[DOI]

AI Commun., 2010

2009

Cardinality Networks and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008

Efficient Generation of Unsatisfiability Proofs and Cores in SAT.

[BibT_eX]

[DOI]