default search action

combined dblp search
author search
venue search
publication search

ask others

"On the complexity of robust geometric programming with polyhedral uncertainty."

André B. Chassein, Marc Goerigk (2019)

> Home

Details and statistics

DOI: 10.1016/J.ORL.2018.11.007

access: closed

type: Journal Article

metadata version: 2019-01-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/orl/ChasseinG19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/ChasseinG19
André B. Chassein, Marc Goerigk:
On the complexity of robust geometric programming with polyhedral uncertainty. Oper. Res. Lett. 47(1): 21-24 (2019)

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.