Unconstrained binary models of the travelling salesman problem variants for quantum optimization (Q2102287)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Unconstrained binary models of the travelling salesman problem variants for quantum optimization |
scientific article; zbMATH DE number 7624228
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unconstrained binary models of the travelling salesman problem variants for quantum optimization |
scientific article; zbMATH DE number 7624228 |
Statements
Unconstrained binary models of the travelling salesman problem variants for quantum optimization (English)
0 references
28 November 2022
0 references
QUBO
0 references
quantum annealing
0 references
travelling salesman problem
0 references
TSP
0 references
TSPTW
0 references
time windows
0 references
optimization
0 references
0 references
0 references
0 references
0 references
0.7681019902229309
0 references
0.7625879645347595
0 references
0.7624775171279907
0 references
0.7622408270835876
0 references
