Luis Quesada

Orcid: 0000-0003-3177-655X

Affiliations:

University College Cork, Ireland

According to our database¹, Luis Quesada authored at least 50 papers between 2001 and 2023.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2023

Computing relaxations for the three-dimensional stable matching problem with cyclic preferences.

[BibT_eX]

[DOI]

Ágnes Cseh

Guillaume Escamocher

Luis Quesada

Constraints An Int. J., 2023

Pareto-Optimal Trace Generation from Declarative Process Models.

[BibT_eX]

[DOI]

Proceedings of the Business Process Management Workshops, 2023

2022

A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences.

[BibT_eX]

[DOI]

Constraints An Int. J., 2022

2021

An adaptive large neighbourhood search algorithm for diameter bounded network design problems.

[BibT_eX]

[DOI]

J. Heuristics, 2021

Positive and Negative Length-Bound Reachability Constraints.

[BibT_eX]

[DOI]

Luis Quesada

Kenneth N. Brown

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Ambient access control for smart spaces: dynamic guidance and zone configuration.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Ambient Systems, 2021

2020

Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 2020

Improving a Branch-and-Bound Approach for the Degree-Constrained Minimum Spanning Tree Problem with LKH.

[BibT_eX]

[DOI]

Maximilian Thiessen

Luis Quesada

Kenneth N. Brown

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

2018

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

[BibT_eX]

[DOI]

J. Heuristics, 2018

An ontology-based approach to knowledge representation for Computer-Aided Control System Design.

[BibT_eX]

[DOI]

Data Knowl. Eng., 2018

Parallel Constraint-Based Local Search: An Application to Designing Resilient Long-Reach Passive Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Parallel Constraint Reasoning., 2018

2017

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

[BibT_eX]

[DOI]

JOCN, 2017

End-to-end network design and experimentation in the DISCUS project.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 2017 19th International Conference on Transparent Optical Networks (ICTON), 2017

2016

Comparing tree and chain topologies for designing resilient backhaul access network.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Optical Network Design and Modeling, 2016

A Comparison between Two Optimisation Alternatives for Mapping in Wireless Network on Chip.

[BibT_eX]

[DOI]

Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

2015

A constraint programming approach to the additional relay placement problem in wireless sensor networks.

[BibT_eX]

[DOI]

Constraints An Int. J., 2015

Computing distance-bounded node-disjoint paths for all pairs of nodes - An application to optical core network design.

[BibT_eX]

[DOI]

Proceedings of the 7th International Workshop on Reliable Networks Design and Modeling, 2015

A constraint-based local search for designing tree networks with distance and disjoint constraints.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Transparent Optical Networks, 2015

Extending the Notion of Preferred Explanations for Quantified Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Deepak Mehta

Barry O'Sullivan

Luis Quesada

Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

Optimising dual homing for long-reach passive optical networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

An adaptive large neighbourhood search for designing transparent optical core network.

[BibT_eX]

[DOI]

Proceedings of the 13th International Conference on Telecommunications, 2015

2014

A scalable optimisation approach to minimising IP protection capacity for Long-Reach PON.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Optical Network Design and Modeling, 2014

Designing an Optical Island in the Core Network: From Routing to Spectrum Allocation.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Constraint-Based Local Search for the Distance- and Capacity-Bounded Network Design Problem.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

2013

Parallelising the k-Medoids Clustering Problem Using Space-Partitioning.

[BibT_eX]

[DOI]

Alejandro Arbelaez

Luis Quesada

Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

2012

Deployment Strategies for Protected Long-Reach PON.

[BibT_eX]

[DOI]

JOCN, 2012

Deployment case studies of an energy efficient protected LR-PON architecture.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Optical Network Design and Modelling, 2012

A Computational Geometry-Based Local Search Algorithm for Planar Location Problems.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

2011

A Combinatorial Optimisation Approach to Designing Dual-Parented Long-Reach Passive Optical Networks

[BibT_eX]

[DOI]

CoRR, 2011

A Combinatorial Optimisation Approach to the Design of Dual Parented Long-Reach Passive Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE 23rd International Conference on Tools with Artificial Intelligence, 2011

Designing Resilient Long-Reach Passive Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Conference on Innovative Applications of Artificial Intelligence, 2011

Value Ordering for Finding All Solutions: Interactions with Adaptive Variable Ordering.

[BibT_eX]

[DOI]

Deepak Mehta

Barry O'Sullivan

Luis Quesada

Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2010

Developing Approaches for Solving a Telecommunications Feature Subscription Problem.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2010

Preferred Explanations for Quantified Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Deepak Mehta

Barry O'Sullivan

Luis Quesada

Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence, 2010

Improving the Global Constraint SoftPrec.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2010, 2010

A Generic Visualization Platform for CP.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

Context-Sensitive Call Control Using Constraints and Rules.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

2009

A Soft Global Precedence Constraint.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

Search Space Extraction.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2009

2008

Consistency Techniques for Finding an Optimal Relaxation of a Feature Subscription.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), 2008

A BDD Approach to the Feature Subscription Problem.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2008, 2008

Solving a Telecommunications Feature Subscription Configuration Problem.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2008

Personalisation of Telecommunications Services as Combinatorial Optimisation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2006

Using Dominators for Solving Constrained Path Problems.

[BibT_eX]

[DOI]

Proceedings of the Practical Aspects of Declarative Languages, 8th International Symposium, 2006

2005

Speeding Up Constrained Path Solvers with a Reachability Propagator.

[BibT_eX]

[DOI]

Luis Quesada

Peter Van Roy

Yves Deville

Proceedings of the Principles and Practice of Constraint Programming, 2005

2002

A Concurrent Constraint Programming Approach for Trajectory Determination of Autonomous Vehicles.

[BibT_eX]

[DOI]

Luis Quesada

Peter Van Roy

Proceedings of the Principles and Practice of Constraint Programming, 2002

2001

Integrating Constraints and Concurrent Objects in Musical Applications: A Calculus and its Visual Language.

[BibT_eX]

[DOI]

Constraints An Int. J., 2001

Luis Quesada

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...