Research output per year
Research output per year
Personal profile
Research Interests
I am mostly interested in combinatorial optimization problems encountered during the configuration of telecommunication networks (e.g. the implementation of location based services), and in the techniques in the area of Artificial Intelligence and Operations Research that can be used to tackle such problems (e.g., Constraint Programming, Mixed Integer Linear Programming, Boolean Satisfiability, Local Search, etc...).
Fingerprint
Dive into the research topics where Luis Quesada is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Counterfactual Explanation Through Constraint Relaxation
Gupta, S. D., O'Sullivan, B. & Quesada, L., 2024, Proceedings - 2024 IEEE 36th International Conference on Tools with Artificial Intelligence, ICTAI 2024. IEEE Computer Society, p. 396-403 8 p. (Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI).Research output: Chapter in Book/Report/Conference proceedings › Chapter › peer-review
-
Pareto-Optimal Trace Generation from Declarative Process Models
Diaz, J. F., López, H. A., Quesada, L. & Rosero, J. C., 2024, Business Process Management Workshops - BPM 2023 International Workshops, Utrecht, The Netherlands, September 11–15, 2023, Revised Selected Papers. De Weerdt, J. & Pufahl, L. (eds.). Springer Science and Business Media Deutschland GmbH, p. 314-325 12 p. (Lecture Notes in Business Information Processing; vol. 492 LNBIP).Research output: Chapter in Book/Report/Conference proceedings › Chapter › peer-review
Open Access -
Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
Cseh, Á., Escamocher, G. & Quesada, L., Jun 2023, In: Constraints. 28, 2, p. 138-165 28 p.Research output: Contribution to journal › Article › peer-review
Open Access -
A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences
Cseh, Á., Escamocher, G., Genç, B. & Quesada, L., Jul 2022, In: Constraints. 27, 3, p. 249-283 35 p.Research output: Contribution to journal › Article › peer-review
Open Access -
Computing Relaxations for the Three-Dimensional Stable Matching Problem with Cyclic Preferences
Cseh, Á., Escamocher, G. & Quesada, L., 1 Jul 2022, 28th International Conference on Principles and Practice of Constraint Programming, CP 2022. Solnon, C. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 16. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 235).Research output: Chapter in Book/Report/Conference proceedings › Chapter › peer-review
Press/Media
-
Dortmund: Petrovskyi beats Yoo, takes the lead with two rounds to go
17/08/24
1 item of Media coverage
Press/Media
-
-
FAA says it has sent 250 cases of unruly passengers to FBI
13/04/23
2 items of Media coverage
Press/Media
-
-