Efficient bit labeling in factorization machines with annealing for traveling salesman problem
Abstract To efficiently determine an optimum parameter combination in a large-scale problem, it is essential to convert the parameters into available variables in actual machines. Specifically, quadratic unconstrained binary optimization problems are solved using machine learning, for example, facto...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-07-01
|
| Series: | Scientific Reports |
| Subjects: | |
| Online Access: | https://doi.org/10.1038/s41598-025-10064-4 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|