"A branch and cut algorithm for minimum spanning trees under conflict ..."

Phillippe Samer, Sebastián Urrutia (2015)

> Home

Details and statistics

DOI: 10.1007/S11590-014-0750-X

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ol/SamerU15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ol/SamerU15
Phillippe Samer, Sebastián Urrutia:
A branch and cut algorithm for minimum spanning trees under conflict constraints. Optim. Lett. 9(1): 41-55 (2015)

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.