On the complexity of robust geometric programming with polyhedral uncertainty

André B. Chassein, Marc Goerigk. On the complexity of robust geometric programming with polyhedral uncertainty. Oper. Res. Lett., 47(1):21-24, 2019. [doi]

Authors

André B. Chassein

This author has not been identified. Look up 'André B. Chassein' in Google

Marc Goerigk

This author has not been identified. Look up 'Marc Goerigk' in Google