Two-stage stochastic semidefinite programming and decomposition based interior point methods
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: Stochastic Programming E-Print Series, 6
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Humboldt-Universität zu Berlin
- (wann)
-
2005
- Urheber
-
Mehrotra, Sanjay
Özevin, M. Gökhan
- DOI
-
10.18452/8336
- URN
-
urn:nbn:de:kobv:11-10057201
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.0027, 13:45 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Mehrotra, Sanjay
- Özevin, M. Gökhan
- Humboldt-Universität zu Berlin
Entstanden
- 2005
Ähnliche Objekte (12)
Stochastic two-stage programming
Risk-Averse Two-Stage Stochastic LinearProgramming: Modeling and Decomposition
Decomposition-based interior point methods for two-stage stochastic convex quadratic programs with recourse
Two-stage programming : compilation and case studies
Decision making with dominance constraints in two-stage stochastic integer programming
Quasi-Monte Carlo methods for linear two-stage stochastic programming problems
Mitigating Uncertainty via Compromise Decisions in Two-stage Stochastic Linear Programming
Disjunctive decomposition for two-stage stochastic mixed-binary programs with random recourse
Two-stage bargaining solutions
Two-stage threshold representations
Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms
Adapting an approximate level method to the two-stage stochastic programming problem
Stochastic two-stage programming
Risk-Averse Two-Stage Stochastic LinearProgramming: Modeling and Decomposition
Decomposition-based interior point methods for two-stage stochastic convex quadratic programs with recourse
Two-stage programming : compilation and case studies
Decision making with dominance constraints in two-stage stochastic integer programming
Quasi-Monte Carlo methods for linear two-stage stochastic programming problems
Mitigating Uncertainty via Compromise Decisions in Two-stage Stochastic Linear Programming
Disjunctive decomposition for two-stage stochastic mixed-binary programs with random recourse
Two-stage bargaining solutions
Two-stage threshold representations
Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms
Adapting an approximate level method to the two-stage stochastic programming problem
Stochastic two-stage programming
Risk-Averse Two-Stage Stochastic LinearProgramming: Modeling and Decomposition
Decomposition-based interior point methods for two-stage stochastic convex quadratic programs with recourse
Two-stage programming : compilation and case studies
Decision making with dominance constraints in two-stage stochastic integer programming
Quasi-Monte Carlo methods for linear two-stage stochastic programming problems
Mitigating Uncertainty via Compromise Decisions in Two-stage Stochastic Linear Programming
Disjunctive decomposition for two-stage stochastic mixed-binary programs with random recourse
Two-stage bargaining solutions
Two-stage threshold representations
Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms