Home ›
Entities
› academia
› A Scenario Based Heuristic for the Robust Shortest Path Tree Problem**This work was partially supported by CNPq, CAPES, and FAPEMIG.
A Scenario Based Heuristic for the Robust Shortest Path Tree Problem**This work was partially supported by CNPq, CAPES, and FAPEMIG.
Research article (IFAC-PapersOnLine, 2016) · cited 13× · AI/ML
A Scenario Based Heuristic for the Robust Shortest Path Tree Problem**This work was partially supported by CNPq, CAPES, and FAPEMIG.
Summary
A Scenario Based Heuristic for the Robust Shortest Path Tree Problem**This work was partially supported by CNPq, CAPES, and FAPEMIG. is a scholarly article[1].
Key Facts
A Scenario Based Heuristic for the Robust Shortest Path Tree Problem**This work was partially supported by CNPq, CAPES, and FAPEMIG.'s instance of is recorded as scholarly article[2].
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). A Scenario Based Heuristic for the Robust Shortest Path Tree Problem**This work was partially supported by CNPq, CAPES, and FAPEMIG.. Retrieved May 24, 2026, from https://4ort.xyz/entity/a-scenario-based-heuristic-for-the-robust-shortest-path-tree-problem-this-work-was-partially-supported-by-cnpq-capes-and
MLA“A Scenario Based Heuristic for the Robust Shortest Path Tree Problem**This work was partially supported by CNPq, CAPES, and FAPEMIG..” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/a-scenario-based-heuristic-for-the-robust-shortest-path-tree-problem-this-work-was-partially-supported-by-cnpq-capes-and.
BibTeX@misc{4ortxyz_a-scenario-based-heuristic-for-the-robust-shortest-path-tree-problem-this-work-was-partially-supported-by-cnpq-capes-and_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{A Scenario Based Heuristic for the Robust Shortest Path Tree Problem**This work was partially supported by CNPq, CAPES, and FAPEMIG.}}, year = {2026}, url = {https://4ort.xyz/entity/a-scenario-based-heuristic-for-the-robust-shortest-path-tree-problem-this-work-was-partially-supported-by-cnpq-capes-and}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): A Scenario Based Heuristic for the Robust Shortest Path Tree Problem**This work was partially supported by CNPq, CAPES, and FAPEMIG. — https://4ort.xyz/entity/a-scenario-based-heuristic-for-the-robust-shortest-path-tree-problem-this-work-was-partially-supported-by-cnpq-capes-and (retrieved 2026-05-24)
