"Approximation and resolution of min-max and min-max regret versions of ..."

Hassene Aissi (2006)

> Home

Details and statistics

DOI: 10.1007/S10288-006-0004-6

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/4or/Aissi06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/4or/Aissi06
Hassene Aissi:
Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. 4OR 4(4): 347-350 (2006)

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.