Parallelizable search-space decomposition for large-scale combinatorial optimization problems using quadratic unconstrained binary optimization.
- DOI
- 10.1038/s41598-026-57443-z
- Published
- 2026 Jun 17
- Container
- Scientific reports
- Publisher
- Not recorded
- Open access
- yes
Credibility signals
limited evidence Score 45/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.
Show all credibility signals
- cautionDOI registered: No matching Crossref record was present in this response.
- cautionDOI resolves: No matching Crossref record was present in this response.
- not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility.
- not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made.
- not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made.
- not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made.
- not scoredROR affiliation: Not checked or no result supplied; no credibility inference made.
- not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- supportingOpen access status: Normalized open-access status: open.
- not scoredPublication license: Not checked or no result supplied; no credibility inference made.
- not scoredPublication version: A publication version was supplied but is not scored.
- cautionMetadata completeness: 5 of 6 scored descriptive metadata groups are present; missing fields increase uncertainty.
Cite this work
BibTeX
@article{allodium:10.1038/s41598-026-57443-z,
title = {Parallelizable search-space decomposition for large-scale combinatorial optimization problems using quadratic unconstrained binary optimization.},
author = {Kawase E and Kikuchi S and Tamai H and Tanaka S},
year = {2026},
journal = {Scientific reports},
doi = {10.1038/s41598-026-57443-z},
url = {https://doi.org/10.1038/s41598-026-57443-z}
}RIS
TY - JOUR TI - Parallelizable search-space decomposition for large-scale combinatorial optimization problems using quadratic unconstrained binary optimization. AU - Kawase E AU - Kikuchi S AU - Tamai H AU - Tanaka S PY - 2026 JO - Scientific reports DO - 10.1038/s41598-026-57443-z UR - https://doi.org/10.1038/s41598-026-57443-z ER -
APA
E, K., S, K., H, T., & S, T. (2026). Parallelizable search-space decomposition for large-scale combinatorial optimization problems using quadratic unconstrained binary optimization.. Scientific reports. https://doi.org/10.1038/s41598-026-57443-z
Source records
- pubmed · retrieved 2026-09-26T07:24:08.288Z