"On the complexity of minmax regret linear programming."

Igor Averbakh, Vasilij Lebedev (2005)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2003.07.007

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/AverbakhL05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/AverbakhL05
Igor Averbakh, Vasilij Lebedev:
On the complexity of minmax regret linear programming. Eur. J. Oper. Res. 160(1): 227-231 (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.