Luis Quesada

Publication Activity (10 Years)

Years Active: 2001-2023
Publications (10 Years): 18

Top Topics

Search Algorithm

Constraint Programming

Top Venues

Constraints An Int. J.

Publications

Ágnes Cseh, Guillaume Escamocher, Luis Quesada
Computing relaxations for the three-dimensional stable matching problem with cyclic preferences. Constraints An Int. J. 28 (2) (2023)
Juan F. Diaz, Hugo A. López, Luis Quesada, Juan C. Rosero
Pareto-Optimal Trace Generation from Declarative Process Models. Business Process Management Workshops (2023)
Ágnes Cseh, Guillaume Escamocher, Luis Quesada
Computing Relaxations for the Three-Dimensional Stable Matching Problem with Cyclic Preferences. CP (2022)
Ágnes Cseh, Guillaume Escamocher, Begüm Genç, Luis Quesada
A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences. Constraints An Int. J. 27 (3) (2022)
Ágnes Cseh, Guillaume Escamocher, Begüm Genç, Luis Quesada
A Collection of Constraint Programming Models for the Three-Dimensional Stable Matching Problem with Cyclic Preferences. CP (2021)
Seán Óg Murphy, Liam O'Toole, Luis Quesada, Kenneth N. Brown, Cormac J. Sreenan
Ambient access control for smart spaces: dynamic guidance and zone configuration. ANT/EDI40 (2021)
Luis Quesada, Kenneth N. Brown
Positive and Negative Length-Bound Reachability Constraints. CP (2021)
Michele Garraffa, Deepak Mehta, Barry O'Sullivan, Cemalettin Ozturk, Luis Quesada
An adaptive large neighbourhood search algorithm for diameter bounded network design problems. J. Heuristics 27 (5) (2021)
Mark Antunes, Vincent Armant, Kenneth N. Brown, Daniel A. Desmond, Guillaume Escamocher, Anne-Marie George, Diarmuid Grimes, Mike O'Keeffe, Yiqing Lin, Barry O'Sullivan, Cemalettin Ozturk, Luis Quesada, Mohamed Siala, Helmut Simonis, Nic Wilson
Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting. Int. J. Artif. Intell. Tools 29 (03n04) (2020)
Maximilian Thiessen, Luis Quesada, Kenneth N. Brown
Improving a Branch-and-Bound Approach for the Degree-Constrained Minimum Spanning Tree Problem with LKH. CPAIOR (2020)
Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada
A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem. J. Heuristics 24 (3) (2018)
Mark Antunes, Vincent Armant, Kenneth N. Brown, Daniel A. Desmond, Guillaume Escamocher, Anne-Marie George, Diarmuid Grimes, Mike O'Keeffe, Yiqing Lin, Barry O'Sullivan, Cemalettin Ozturk, Luis Quesada, Mohamed Siala, Helmut Simonis, Nic Wilson
Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting. ICTAI (2018)
Carmen Benavides, Isaías Garcia, Héctor Alaiz-Moretón, Luis Quesada
An ontology-based approach to knowledge representation for Computer-Aided Control System Design. Data Knowl. Eng. 118 (2018)
Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Ata Sasmaz
Generation of a reference network for Ireland and its contribution to the design of an optical network architecture. ICTON (2017)
Marco Ruffini, Mohand Achouche, Alejandro Arbelaez, René Bonk, Andrea Di Giglio, Nick J. Doran, Marija Furdek, R. Jensen, Julio Montalvo-Garcia, Nicholas Parsons, Thomas Pfeiffer, Luis Quesada, Christian Raack, H. Rohde, Marco Schiano, Giuseppe Talli, Paul D. Townsend, Roland Wessäly, Lena Wosinska, Xin Yin, David B. Payne
Access and Metro Network Convergence for Flexible End-to-End Network Design [Invited]. JOCN 9 (6) (2017)
David B. Payne, Alejandro Arbelaez, René Bonk, N. J. Doran, Marija Furdek, R. Jensen, Nick Parsons, Thomas Pfeiffer, Luis Quesada, Christian Raack, Giuseppe Talli, Paul D. Townsend, Roland Wessäly, Lena Wosinska, Xin Yin, Marco Ruffini
End-to-end network design and experimentation in the DISCUS project. ICTON (2017)
Maribell Sacanamboy, Luis Quesada, Freddy Bolanos, Álvaro Bernal Noreña, Barry O'Sullivan
A Comparison between Two Optimisation Alternatives for Mapping in Wireless Network on Chip. ICTAI (2016)
Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada
Comparing tree and chain topologies for designing resilient backhaul access network. ONDM (2016)
Deepak Mehta, Barry O'Sullivan, Cemalletin Ozturk, Luis Quesada
Computing distance-bounded node-disjoint paths for all pairs of nodes - An application to optical core network design. RNDM@WMNC (2015)
Luis Quesada, Lanny Sitanayah, Kenneth N. Brown, Barry O'Sullivan, Cormac J. Sreenan
A constraint programming approach to the additional relay placement problem in wireless sensor networks. Constraints An Int. J. 20 (4) (2015)
Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada
Optimising dual homing for long-reach passive optical networks. DRCN (2015)
Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Cemalettin Ozturk, Luis Quesada
A scalable approach for computing distance-bounded node-disjoint paths in optical networks. ICTON (2015)
Deepak Mehta, Barry O'Sullivan, Luis Quesada
Extending the Notion of Preferred Explanations for Quantified Constraint Satisfaction Problems. ICTAC (2015)
Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada
A Constraint-Based Local Search for Edge Disjoint Rooted Distance-Constrained Minimum Spanning Tree Problem. CPAIOR (2015)
Deepak Mehta, Barry O'Sullivan, Cemalettin Ozturk, Luis Quesada
An adaptive large neighbourhood search for designing transparent optical core network. ConTEL (2015)
Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada
A constraint-based local search for designing tree networks with distance and disjoint constraints. RNDM@WMNC (2015)
Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada
Constraint-Based Local Search for the Distance- and Capacity-Bounded Network Design Problem. ICTAI (2014)
Deepak Mehta, Barry O'Sullivan, Luis Quesada, Marco Ruffini, David B. Payne, Linda Doyle
A scalable optimisation approach to minimising IP protection capacity for Long-Reach PON. ONDM (2014)
David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson
Developing Approaches for Solving a Telecommunications Feature Subscription Problem. CoRR (2014)
Deepak Mehta, Barry O'Sullivan, Cemalettin Ozturk, Luis Quesada, Helmut Simonis
Designing an Optical Island in the Core Network: From Routing to Spectrum Allocation. ICTAI (2014)
Luis Quesada, Kenneth N. Brown, Barry O'Sullivan, Lanny Sitanayah, Cormac J. Sreenan
A Constraint Programming Approach to the Additional Relay Placement Problem in Wireless Sensor Networks. ICTAI (2013)
Alejandro Arbelaez, Luis Quesada
Parallelising the k-Medoids Clustering Problem Using Space-Partitioning. SOCS (2013)
Marco Ruffini, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Linda Doyle, David B. Payne
Deployment Strategies for Protected Long-Reach PON. JOCN 4 (2) (2012)
Marco Ruffini, Linda Doyle, David B. Payne, Deepak Mehta, Barry O'Sullivan, Luis Quesada
Deployment case studies of an energy efficient protected LR-PON architecture. ONDM (2012)
Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Luis Quesada
A Computational Geometry-Based Local Search Algorithm for Planar Location Problems. CPAIOR (2012)
Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Marco Ruffini, David B. Payne, Linda Doyle
A Combinatorial Optimisation Approach to the Design of Dual Parented Long-Reach Passive Optical Networks. ICTAI (2011)
Deepak Mehta, Barry O'Sullivan, Luis Quesada
Value Ordering for Finding All Solutions: Interactions with Adaptive Variable Ordering. CP (2011)
Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Marco Ruffini, David B. Payne, Linda Doyle
A Combinatorial Optimisation Approach to Designing Dual-Parented Long-Reach Passive Optical Networks CoRR (2011)
Deepak Mehta, Barry O'Sullivan, Luis Quesada, Marco Ruffini, David B. Payne, Linda Doyle
Designing Resilient Long-Reach Passive Optical Networks. IAAI (2011)
Helmut Simonis, Paul Davern, Jacob Feldman, Deepak Mehta, Luis Quesada, Mats Carlsson
A Generic Visualization Platform for CP. CP (2010)
David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson
Improving the Global Constraint SoftPrec. ECAI (2010)
Deepak Mehta, Barry O'Sullivan, Luis Quesada
Preferred Explanations for Quantified Constraint Satisfaction Problems. ICTAI (1) (2010)
David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson
Developing Approaches for Solving a Telecommunications Feature Subscription Problem. J. Artif. Intell. Res. 38 (2010)
David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson
Context-Sensitive Call Control Using Constraints and Rules. CP (2010)
Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson
Search Space Extraction. CP (2009)
David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson
A Soft Global Precedence Constraint. IJCAI (2009)
David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson
Solving a Telecommunications Feature Subscription Configuration Problem. CP (2008)
Tarik Hadzic, David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson
A BDD Approach to the Feature Subscription Problem. ECAI (2008)
David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson
Personalisation of Telecommunications Services as Combinatorial Optimisation. AAAI (2008)
David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson
Consistency Techniques for Finding an Optimal Relaxation of a Feature Subscription. ICTAI (1) (2008)
Luis Quesada, Peter Van Roy, Yves Deville, Raphaël Collet
Using Dominators for Solving Constrained Path Problems. PADL (2006)
Luis Quesada, Peter Van Roy, Yves Deville
Speeding Up Constrained Path Solvers with a Reachability Propagator. CP (2005)
Luis Quesada, Peter Van Roy
A Concurrent Constraint Programming Approach for Trajectory Determination of Autonomous Vehicles. CP (2002)
Camilo Rueda, Gloria Alvarez, Luis Quesada, Gabriel Tamura, Frank D. Valencia, Juan Francisco Díaz, Gérard Assayag
Integrating Constraints and Concurrent Objects in Musical Applications: A Calculus and its Visual Language. Constraints An Int. J. 6 (1) (2001)