Publication:

A construction heuristic for the capacitated Steiner tree problem

 
dc.contributor.authorVan den Eynde, Simon
dc.contributor.authorAudenaert, Pieter
dc.contributor.authorColle, Didier
dc.contributor.authorPickavet, Mario
dc.contributor.imecauthorVan den Eynde, Simon
dc.contributor.imecauthorAudenaert, Pieter
dc.contributor.imecauthorColle, Didier
dc.contributor.imecauthorPickavet, Mario
dc.contributor.orcidimecVan den Eynde, Simon::0000-0002-2318-6923
dc.contributor.orcidimecAudenaert, Pieter::0000-0003-3319-4705
dc.contributor.orcidimecColle, Didier::0000-0002-1428-0301
dc.contributor.orcidimecPickavet, Mario::0000-0001-5817-7886
dc.date.accessioned2022-09-29T15:14:43Z
dc.date.available2022-09-04T02:39:16Z
dc.date.available2022-09-05T12:47:50Z
dc.date.available2022-09-29T15:14:43Z
dc.date.issued2022
dc.description.wosFundingTextThis research was partly funded by the Ghent University IOP project "Modelling Uncertainty in Hub Location Planning through Interdisciplinary Research", by the VLAIO project "Comsof Autonomous Planning Agent" and by the UGent-project BOF/STA/202009/039. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
dc.identifier.doi10.1371/journal.pone.0270147
dc.identifier.issn1932-6203
dc.identifier.pmidMEDLINE:35709229
dc.identifier.urihttps://imec-publications.be/handle/20.500.12860/40333
dc.publisherPUBLIC LIBRARY SCIENCE
dc.source.beginpageArt. e027147
dc.source.endpagena
dc.source.issue6
dc.source.journalPLOS ONE
dc.source.numberofpages17
dc.source.volume17
dc.subject.keywordsALGORITHM
dc.title

A construction heuristic for the capacitated Steiner tree problem

dc.typeJournal article
dspace.entity.typePublication
Files

Original bundle

Name:
8109.pdf
Size:
648.16 KB
Format:
Unknown data format
Description:
Publication available in collections: