"Solving the 2-rooted mini-max spanning forest problem by branch-and-bound."

M. Mekking, A. Volgenant (2010)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2009.07.038

access: closed

type: Journal Article

metadata version: 2020-02-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/MekkingV10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/MekkingV10
M. Mekking, A. Volgenant:
Solving the 2-rooted mini-max spanning forest problem by branch-and-bound. Eur. J. Oper. Res. 203(1): 50-58 (2010)

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.