"Computing upper and lower bounds in interval decision trees."

Mats Danielson, Love Ekenberg (2007)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2006.06.030

access: closed

type: Journal Article

metadata version: 2020-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/DanielsonE07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/DanielsonE07
Mats Danielson, Love Ekenberg:
Computing upper and lower bounds in interval decision trees. Eur. J. Oper. Res. 181(2): 808-816 (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.