Zobrazeno 1 - 10
of 601
pro vyhledávání: '"Rodriguez, Esther"'
Autor:
Osaba, Eneko, Villar-Rodriguez, Esther
In this paper, we propose a quantum computing oriented benchmark for combinatorial optimization. This benchmark, coined as QOPTLib, is composed of 40 instances equally distributed over four well-known problems: Traveling Salesman Problem, Vehicle Rou
Externí odkaz:
http://arxiv.org/abs/2404.15852
Autor:
Makarov, Antón, Pérez-Herradón, Carlos, Franceschetto, Giacomo, Taddei, Márcio M., Osaba, Eneko, del Barrio, Paloma, Villar-Rodriguez, Esther, Oregi, Izaskun
Publikováno v:
IEEE Access 12 71808-71820 (2024)
Satellite mission planning for Earth observation satellites is a combinatorial optimization problem that consists of selecting the optimal subset of imaging requests, subject to constraints, to be fulfilled during an orbit pass of a satellite. The ev
Externí odkaz:
http://arxiv.org/abs/2404.05516
Research focused on the conjunction between quantum computing and routing problems has been very prolific in recent years. Most of the works revolve around classical problems such as the Traveling Salesman Problem or the Vehicle Routing Problem. The
Externí odkaz:
http://arxiv.org/abs/2403.15114
Hybrid quantum computing is considered the present and the future within the field of quantum computing. Far from being a passing fad, this trend cannot be considered just a stopgap to address the limitations of NISQ-era devices. The foundations link
Externí odkaz:
http://arxiv.org/abs/2401.10302
One of the problems in quantitative finance that has received the most attention is the portfolio optimization problem. Regarding its solving, this problem has been approached using different techniques, with those related to quantum computing being
Externí odkaz:
http://arxiv.org/abs/2309.12627
The expectations arising from the latest achievements in the quantum computing field are causing that researchers coming from classical artificial intelligence to be fascinated by this new paradigm. In turn, quantum computing, on the road towards usa
Externí odkaz:
http://arxiv.org/abs/2308.10513
The Bin Packing Problem is a classic problem with wide industrial applicability. In fact, the efficient packing of items into bins is one of the toughest challenges in many logistic corporations and is a critical issue for reducing storage costs or i
Externí odkaz:
http://arxiv.org/abs/2308.02787
Autor:
Makarov, Antón, Taddei, Márcio M., Osaba, Eneko, Franceschetto, Giacomo, Villar-Rodriguez, Esther, Oregi, Izaskun
Publikováno v:
Proceedings of Intelligent Data Engineering and Automated Learning -- IDEAL 2023. Lecture Notes in Computer Science, vol 14404. Springer, Cham
Satellite image acquisition scheduling is a problem that is omnipresent in the earth observation field; its goal is to find the optimal subset of images to be taken during a given orbit pass under a set of constraints. This problem, which can be mode
Externí odkaz:
http://arxiv.org/abs/2307.14419
Publikováno v:
Data in Brief, 109309 (2023)
In this article, a benchmark for real-world bin packing problems is proposed. This dataset consists of 12 instances of varying levels of complexity regarding size (with the number of packages ranging from 38 to 53) and user-defined requirements. In f
Externí odkaz:
http://arxiv.org/abs/2304.14712
Autor:
Andres, Alain, Schäfer, Lukas, Villar-Rodriguez, Esther, Albrecht, Stefano V., Del Ser, Javier
One of the key challenges of Reinforcement Learning (RL) is the ability of agents to generalise their learned policy to unseen settings. Moreover, training RL agents requires large numbers of interactions with the environment. Motivated by the recent
Externí odkaz:
http://arxiv.org/abs/2304.09825