Solving the clustered traveling salesman problem via traveling salesman problem methods.
- DOI
- 10.7717/peerj-cs.972
- Published
- 2022
- Container
- PeerJ. Computer science
- Publisher
- Not recorded
- Open access
- yes
Credibility signals
uncertain Score 53/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.
- supportingDirectory of Open Access Journals: A matching record was returned by DOAJ.
- 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.7717/peerj-cs.972,
title = {Solving the clustered traveling salesman problem via traveling salesman problem methods.},
author = {Lu Y and Hao JK and Wu Q},
year = {2022},
journal = {PeerJ. Computer science},
doi = {10.7717/peerj-cs.972},
url = {https://doi.org/10.7717/peerj-cs.972}
}RIS
TY - JOUR TI - Solving the clustered traveling salesman problem via traveling salesman problem methods. AU - Lu Y AU - Hao JK AU - Wu Q PY - 2022 JO - PeerJ. Computer science DO - 10.7717/peerj-cs.972 UR - https://doi.org/10.7717/peerj-cs.972 ER -
APA
Y, L., JK, H., & Q, W. (2022). Solving the clustered traveling salesman problem via traveling salesman problem methods.. PeerJ. Computer science. https://doi.org/10.7717/peerj-cs.972