A polyhedral approach to the generalized minimum labeling spanning tree problem
- DOI
- 10.1007/s13675-018-0099-5
- Published
- 2019-03
- Container
- EURO Journal on Computational Optimization
- Publisher
- Elsevier BV
- Open access
- unknown
Credibility signals
uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.
Show all credibility signals
- supportingDOI registered: A matching record was returned by Crossref.
- supportingDOI resolves: A matching record was returned by Crossref.
- 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.
- not scoredOpen access status: Not checked or no result supplied; no credibility inference made.
- 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.
- supportingMetadata completeness: All 6 scored descriptive metadata groups are present.
Cite this work
BibTeX
@article{allodium:10.1007/s13675-018-0099-5,
title = {A polyhedral approach to the generalized minimum labeling spanning tree problem},
author = {ThiagoGouveiada Silva and Serigne Gueye and Philippe Michelon and LuizSatoru Ochi and LucídiodosAnjosFormiga Cabral},
year = {2019},
journal = {EURO Journal on Computational Optimization},
doi = {10.1007/s13675-018-0099-5},
url = {https://doi.org/10.1007/s13675-018-0099-5}
}RIS
TY - JOUR TI - A polyhedral approach to the generalized minimum labeling spanning tree problem AU - ThiagoGouveiada Silva AU - Serigne Gueye AU - Philippe Michelon AU - LuizSatoru Ochi AU - LucídiodosAnjosFormiga Cabral PY - 2019 JO - EURO Journal on Computational Optimization DO - 10.1007/s13675-018-0099-5 UR - https://doi.org/10.1007/s13675-018-0099-5 ER -
APA
Silva, T., Gueye, S., Michelon, P., Ochi, L., & Cabral, L. (2019). A polyhedral approach to the generalized minimum labeling spanning tree problem. EURO Journal on Computational Optimization. https://doi.org/10.1007/s13675-018-0099-5
Source records
- crossref · retrieved 2026-11-07T05:49:16.786Z