"A Branch and Bound algorithm for the minimax regret spanning arborescence."

Eduardo Conde (2007)

> Home

Details and statistics

DOI: 10.1007/S10898-006-9074-4

access: closed

type: Journal Article

metadata version: 2020-09-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgo/Conde07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/Conde07
Eduardo Conde:
A Branch and Bound algorithm for the minimax regret spanning arborescence. J. Glob. Optim. 37(3): 467-480 (2007)

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.