Home ›
Entities
› academia
› An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search
An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search
Research article (International Transactions in Operational Research, 2020) · cited 10× · AI/ML
An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search
Summary
An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search is a scholarly article[1].
Key Facts
An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search's instance of is recorded as scholarly article[2].
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
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). An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search. Retrieved May 24, 2026, from https://4ort.xyz/entity/an-effective-twolevel-solution-approach-for-the-prizecollecting-generalized-minimum-spanning-tree-problem-by-iterated-lo
MLA“An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/an-effective-twolevel-solution-approach-for-the-prizecollecting-generalized-minimum-spanning-tree-problem-by-iterated-lo.
BibTeX@misc{4ortxyz_an-effective-twolevel-solution-approach-for-the-prizecollecting-generalized-minimum-spanning-tree-problem-by-iterated-lo_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search}}, year = {2026}, url = {https://4ort.xyz/entity/an-effective-twolevel-solution-approach-for-the-prizecollecting-generalized-minimum-spanning-tree-problem-by-iterated-lo}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search — https://4ort.xyz/entity/an-effective-twolevel-solution-approach-for-the-prizecollecting-generalized-minimum-spanning-tree-problem-by-iterated-lo (retrieved 2026-05-24)
