Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Daniel Rehfeldt, Thorsten Koch
Document Type:Article
Parent Title (English):SIAM Journal on Optimization
Volume:29
Issue:1
First Page:369
Last Page:398
Publisher:Society for Industrial and Applied Mathematics
Year of first publication:2019
Pagenumber:30
Preprint:urn:nbn:de:0297-zib-64699
DOI:https://doi.org/10.1137/17M1145963