"A branch-and-cut algorithm for the minimum branch vertices spanning tree ..."

Selene Silvestri, Gilbert Laporte, Raffaele Cerulli (2017)

> Home

Details and statistics

DOI: 10.1016/J.COR.2016.11.010

access: closed

type: Journal Article

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cor/SilvestriLC17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/SilvestriLC17
Selene Silvestri, Gilbert Laporte, Raffaele Cerulli:
A branch-and-cut algorithm for the minimum branch vertices spanning tree problem. Comput. Oper. Res. 81: 322-332 (2017)

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.