Alejandro Arbelaez

Orcid: 0000-0003-1622-5645

According to our database1, Alejandro Arbelaez authored at least 36 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A hybrid metaheuristic with learning for a real supply chain scheduling problem.
Eng. Appl. Artif. Intell., November, 2023

Automatic assessment of object oriented programming assignments with unit testing in Python and a real case assignment.
Comput. Appl. Eng. Educ., September, 2023

2022
Iterated Local Search for the eBuses Charging Location Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Large Neighborhood Search for Robust Solutions for Constraint Satisfaction Problems with Ordered Domains.
Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming, 2022

2020
Transition to eBuses with Minimal Timetable Disruptions.
Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Cooperative Parallel SAT Local Search with Path Relinking.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2020

2018
A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem.
J. Heuristics, 2018

Online over time processing of combinatorial problems.
Constraints An Int. J., 2018

Processing Online SAT Instances with Waiting Time Constraints and Completion Weights.
Proceedings of the Machine Learning, Optimization, and Data Science, 2018

Parallel Constraint-Based Local Search: An Application to Designing Resilient Long-Reach Passive Optical Networks.
Proceedings of the Handbook of Parallel Constraint Reasoning., 2018

2017
Access and Metro Network Convergence for Flexible End-to-End Network Design [Invited].
JOCN, 2017

End-to-end network design and experimentation in the DISCUS project.
Proceedings of the 2017 19th International Conference on Transparent Optical Networks (ICTON), 2017

Generation of a reference network for Ireland and its contribution to the design of an optical network architecture.
Proceedings of the 2017 19th International Conference on Transparent Optical Networks (ICTON), 2017

2016
Estimating parallel runtimes for randomized algorithms in constraint solving.
J. Heuristics, 2016

Comparing tree and chain topologies for designing resilient backhaul access network.
Proceedings of the 2016 International Conference on Optical Network Design and Modeling, 2016

Constraint Programming and Machine Learning for Interactive Soccer Analysis.
Proceedings of the Learning and Intelligent Optimization - 10th International Conference, 2016

Learning a Stopping Criterion for Local Search.
Proceedings of the Learning and Intelligent Optimization - 10th International Conference, 2016

Learning Sequential and Parallel Runtime Distributions for Randomized Algorithms.
Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

SABIO: An Implementation of MIP and CP for Interactive Soccer Queries.
Proceedings of the Principles and Practice of Constraint Programming, 2016

2015
A constraint-based local search for designing tree networks with distance and disjoint constraints.
Proceedings of the 7th International Workshop on Reliable Networks Design and Modeling, 2015

A scalable approach for computing distance-bounded node-disjoint paths in optical networks.
Proceedings of the 17th International Conference on Transparent Optical Networks, 2015

Optimising dual homing for long-reach passive optical networks.
Proceedings of the 11th International Conference on the Design of Reliable Communication Networks, 2015

A Constraint-Based Local Search for Edge Disjoint Rooted Distance-Constrained Minimum Spanning Tree Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

Constraint-Based Local Search for Finding Node-Disjoint Bounded-Paths in Optical Access Networks.
Proceedings of the Principles and Practice of Constraint Programming, 2015

2014
A GPU Implementation of Parallel Constraint-Based Local Search.
Proceedings of the 22nd Euromicro International Conference on Parallel, 2014

Constraint-Based Local Search for the Distance- and Capacity-Bounded Network Design Problem.
Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

2013
Using sequential runtime distributions for the parallel speedup prediction of SAT local search.
Theory Pract. Log. Program., 2013

Parallelising the k-Medoids Clustering Problem Using Space-Partitioning.
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

From Sequential to Parallel Local Search for SAT.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2013

2012
Towards Massively Parallel Local Search for SAT - (Poster Presentation).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Massively Parallel Local Search for SAT.
Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

Continuous Search in Constraint Programming.
Proceedings of the Autonomous Search, 2012

2011
Improving Parallel Local Search for SAT.
Proceedings of the Learning and Intelligent Optimization - 5th International Conference, 2011

2010
Continuous Search in Constraint Programming.
Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence, 2010

Building Portfolios for the Protein Structure Prediction Problem.
Proceedings of the Workshop on Constraint Based Methods for Bioinformatics, 2010

2009
Exploiting weak dependencies in tree-based search.
Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009


  Loading...