"Solving the Clustered Minimum Routing Tree Problem Using ..."

Cosmin Sabo et al. (2024)

> Home

Details and statistics

DOI: 10.1007/978-3-031-74183-8_26

access: closed

type: Conference or Workshop Paper

metadata version: 2024-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/hais/SaboTPP24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hais/SaboTPP24
Cosmin Sabo, Bogdan Teglas, Petrica C. Pop, Adrian Petrovan:
Solving the Clustered Minimum Routing Tree Problem Using Prüfer-Coding Based Hybrid Genetic Algorithms. HAIS (1) 2024: 312-323

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.