"Solving the Rectilinear Steiner Minimal Tree Problem with a Branch and Cut ..."

Nahit Emanet, Can C. Özturan (2004)

> Home

Details and statistics

DOI: 10.47839/IJC.3.2.290

access: open

type: Journal Article

metadata version: 2024-07-15

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/ijcomputing/EmanetO04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcomputing/EmanetO04
Nahit Emanet, Can C. Özturan:
Solving the Rectilinear Steiner Minimal Tree Problem with a Branch and Cut Algorithm. Int. J. Comput. 3(2): 81-87 (2004)

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.