Hochschulschrift
Relaxations and Approximations for Mixed-Integer Optimal Control
- Weitere Titel
-
Relaxierungen und Approximationen für gemischt-ganzzahlige Optimalsteuerung
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Heidelberg, Universität Heidelberg, Dissertation, 2013
- Schlagwort
-
Integer programming
Dynamic programming
Optimal control
Mixed-integer programming
Approximation methods and heuristics
- Ereignis
-
Veröffentlichung
- (wo)
-
Heidelberg
- (wer)
-
Universitätsbibliothek Heidelberg
- (wann)
-
2014
- Urheber
- Beteiligte Personen und Organisationen
-
Sager, Sebastian
- DOI
-
10.11588/heidok.00016036
- URN
-
urn:nbn:de:bsz:16-heidok-160366
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:55 MESZ
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.
Objekttyp
- Hochschulschrift
Beteiligte
- Jung, Michael
- Sager, Sebastian
- Universitätsbibliothek Heidelberg
Entstanden
- 2014
Ähnliche Objekte (12)
Relaxations and approximations for mixed-integer optimal control
Convex relaxations for mixed-integer nonlinear programs
Tighter relaxations in mixed-integer nonlinear programming
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
Convex approximations for a class of mixed-integer recourse models
Convex approximations of two-stage risk-averse mixed-integer recourse models
Exact mixed-integer programming
A mixed-integer approximation of robust optimization problems with mixed-integer adjustments
Solving Mixed-Integer Linear and Nonlinear Network Optimization Problems by Local Reformulations and Relaxations
Computational mixed-integer semidefinite programming
Vorlesung 05: Mixed-Integer Programme
On Efficient Solution Methods for Mixed-Integer Nonlinear and Mixed-Integer Quadratic Optimization Problems
Relaxations and approximations for mixed-integer optimal control
Convex relaxations for mixed-integer nonlinear programs
Tighter relaxations in mixed-integer nonlinear programming
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
Convex approximations for a class of mixed-integer recourse models
Convex approximations of two-stage risk-averse mixed-integer recourse models
Exact mixed-integer programming
A mixed-integer approximation of robust optimization problems with mixed-integer adjustments
Solving Mixed-Integer Linear and Nonlinear Network Optimization Problems by Local Reformulations and Relaxations
Computational mixed-integer semidefinite programming
Vorlesung 05: Mixed-Integer Programme
On Efficient Solution Methods for Mixed-Integer Nonlinear and Mixed-Integer Quadratic Optimization Problems
Relaxations and approximations for mixed-integer optimal control
Convex relaxations for mixed-integer nonlinear programs
Tighter relaxations in mixed-integer nonlinear programming
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
Convex approximations for a class of mixed-integer recourse models
Convex approximations of two-stage risk-averse mixed-integer recourse models
Exact mixed-integer programming
A mixed-integer approximation of robust optimization problems with mixed-integer adjustments
Solving Mixed-Integer Linear and Nonlinear Network Optimization Problems by Local Reformulations and Relaxations
Computational mixed-integer semidefinite programming
Vorlesung 05: Mixed-Integer Programme