"Computing and minimizing the relative regret in combinatorial optimization ..."

Igor Averbakh (2005)

> Home

Details and statistics

DOI: 10.1016/J.DISOPT.2005.07.001

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/disopt/Averbakh05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/disopt/Averbakh05
Igor Averbakh:
Computing and minimizing the relative regret in combinatorial optimization with interval data. Discret. Optim. 2(4): 273-287 (2005)

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.