"Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact ..."

Daniel Rehfeldt, Thorsten Koch (2019)

> Home

Details and statistics

DOI: 10.1137/17M1145963

access: closed

type: Journal Article

metadata version: 2020-06-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamjo/RehfeldtK19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamjo/RehfeldtK19
Daniel Rehfeldt, Thorsten Koch:
Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem. SIAM J. Optim. 29(1): 369-398 (2019)

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.