"Hybrid Quantum Computing - Tabu Search Algorithm for Partitioning ..."

Eneko Osaba et al. (2020)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2021-01-02

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-2012-04984
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2012-04984
Eneko Osaba, Esther Villar-Rodriguez, Izaskun Oregi, Aitor Moreno-Fernandez-de-Leceta:
Hybrid Quantum Computing - Tabu Search Algorithm for Partitioning Problems: preliminary study on the Traveling Salesman Problem. CoRR abs/2012.04984 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.