"A robust and scalable algorithm for the Steiner problem in graphs."

Thomas Pajor, Eduardo Uchoa, Renato F. Werneck (2018)

> Home

Details and statistics

DOI: 10.1007/S12532-017-0123-4

access: closed

type: Journal Article

metadata version: 2019-09-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mpc/PajorUW18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mpc/PajorUW18
Thomas Pajor, Eduardo Uchoa, Renato F. Werneck:
A robust and scalable algorithm for the Steiner problem in graphs. Math. Program. Comput. 10(1): 69-118 (2018)

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.