On the approximability of adjustable robust convex optimization under uncertainty

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical methods of operations research
1. Verfasser: Bertsimas, Dimitris (VerfasserIn)
Weitere Verfasser: Goyal, Vineet (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2013
Schlagworte:
Aufsatz in Zeitschrift
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Generalized gap acceptance models for unsignalized intersections 2019 Abhishek
Optimal exchange rates management using stochastic impulse control for geometric Lévy processes 2019 Wu, Jinbiao
Complexity results on planar multifacility location problems with forbidden regions 2019 Maier, Andrea
Simple modeling techniques for base-stock inventorysystems with state dependent demand rates 2019 Olsson, Fredrik
Dynamic systemic risk measures for bounded discrete timeprocesses 2019 Kromer, Eduard
Equilibrium formulations of relative optimization problems 2019 Konnov, Igor V.
Full-information best choice game with hint 2019 Skarupski, Marek
Nonconcave robust optimization with discrete strategies under Knightian uncertainty 2019 Neufeld, Ariel
Optimal control of electricity input given an uncertain demand 2019 Göttlich, Simone
Martingale optimal transport in the discrete case via simple linear programming techniques 2019 Bäuerle, Nicole
Optimal investment for insurance company with exponential utility and wealth-dependent risk aversion coefficient 2019 Delong, Łukasz
Finding an optimal core on a tree network with M/G/c/c state-dependent queues 2019 Moshtagh, Mehrdad
Optimal booking control in revenue management with two substitutable resources 2019 Sayah, David
Algorithms for non-linear and stochastic resource constrained shortest path 2019 Parmentier, Axel
Optimal price management in retail energy markets : an impulse control problem with asymptotic estimates 2019 Basei, Matteo
Locating a semi-obnoxious facility in the special case of Manhattan distances 2019 Wagner, Andrea
Virtual allocation policies for many-server queues with abandonment 2019 Long, Zhenghua
The sparsest solution of the union of finite polytopes via its nonconvex relaxation 2019 You, Guowei
Accelerated first-order methods for large-scale convex optimization : nearly optimal complexity under strong convexity 2019 Ahookhosh, Masoud
Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width 2019 Gurski, Frank
Alle Artikel auflisten