"A branch and cut method for the degree-constrained minimum spanning tree ..."

Lou Caccetta, Stephen P. Hill (2001)

> Home

Details and statistics

DOI: 10.1002/1097-0037(200103)37:2<74::AID-NET2>3.0.CO;2-E

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/CaccettaH01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/CaccettaH01
Lou Caccetta, Stephen P. Hill:
A branch and cut method for the degree-constrained minimum spanning tree problem. Networks 37(2): 74-83 (2001)

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.