Efficiently finding earliest and latest paths via binary weighting in multi-objective network routing.

Yeh WC, Forghani-Elahabad M, Kumar A.

Open source

DOI: 10.1038/s41598-026-51627-3
Published: 2026-05-07
Container: Sci Rep
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. Source: Crossref; license: CC0 metadata
cautionDOI resolves: No matching Crossref record was present in this response. Source: Crossref; license: CC0 metadata
supportingDirectory of Open Access Journals: A matching record was returned by DOAJ. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
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. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
supportingOpen access status: Normalized open-access status: open. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
not scoredPublication license: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication version: A publication version was supplied but is not scored. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
cautionMetadata completeness: 5 of 6 scored descriptive metadata groups are present; missing fields increase uncertainty. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.1038/s41598-026-51627-3,
  title = {Efficiently finding earliest and latest paths via binary weighting in multi-objective network routing.},
  author = {Yeh WC and  Forghani-Elahabad M and  Kumar A.},
  year = {2026},
  journal = {Sci Rep},
  doi = {10.1038/s41598-026-51627-3},
  url = {https://doi.org/10.1038/s41598-026-51627-3}
}

RIS

TY  - JOUR
TI  - Efficiently finding earliest and latest paths via binary weighting in multi-objective network routing.
AU  - Yeh WC
AU  -  Forghani-Elahabad M
AU  -  Kumar A.
PY  - 2026
JO  - Sci Rep
DO  - 10.1038/s41598-026-51627-3
UR  - https://doi.org/10.1038/s41598-026-51627-3
ER  -

APA

WC, Y., M, F., & A., K. (2026). Efficiently finding earliest and latest paths via binary weighting in multi-objective network routing.. Sci Rep. https://doi.org/10.1038/s41598-026-51627-3

Source records

europe-pmc · retrieved 2026-09-26T15:42:32.476Z
doaj · retrieved 2026-09-26T15:42:32.483Z