"Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max ..."

Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena (2011)

> Home

Details and statistics

DOI: 10.1007/978-3-642-21527-8_6

access: closed

type: Conference or Workshop Paper

metadata version: 2019-10-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/inoc/CunhaSL11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/inoc/CunhaSL11
Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena:
Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem. INOC 2011: 43-50

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.