- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783954044740
- Maße
-
21 cm
- Umfang
-
XV, 232 S.
- Ausgabe
-
1. Aufl.
- Sprache
-
Englisch
- Anmerkungen
-
Ill., graph. Darst.
Zugl.: Zürich, Techn. Hochsch., Diss., 2013
- Schlagwort
-
Gemischt-ganzzahlige Optimierung
Nichtlineare Optimierung
Konvexe Optimierung
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 14:03 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
- Ballerstein, Martin
- Cuvillier
Entstanden
- 2013
Ähnliche Objekte (12)
Tighter relaxations in mixed-integer nonlinear programming
Relaxations and Approximations for Mixed-Integer Optimal Control
Relaxations and approximations for mixed-integer optimal control
Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs
Reducing mixed-integer to zero-one programs
Reducing mixed-integer to zero-one programs
Algorithms for Mixed-Integer Bilevel Problems with Convex Followers
Lagrangian Decomposition of Mixed-Integer All-Quadratic Programs
Solving mixed-integer programs arising in production planning
Convex approximations for a class of mixed-integer recourse models
Convex Relaxations of Componentwise Convex Functions
Tighter relaxations in mixed-integer nonlinear programming
Relaxations and Approximations for Mixed-Integer Optimal Control
Relaxations and approximations for mixed-integer optimal control
Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs
Reducing mixed-integer to zero-one programs
Reducing mixed-integer to zero-one programs
Algorithms for Mixed-Integer Bilevel Problems with Convex Followers
Lagrangian Decomposition of Mixed-Integer All-Quadratic Programs
Solving mixed-integer programs arising in production planning
Convex approximations for a class of mixed-integer recourse models
Convex Relaxations of Componentwise Convex Functions
Tighter relaxations in mixed-integer nonlinear programming
Relaxations and Approximations for Mixed-Integer Optimal Control
Relaxations and approximations for mixed-integer optimal control
Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs
Reducing mixed-integer to zero-one programs
Reducing mixed-integer to zero-one programs
Algorithms for Mixed-Integer Bilevel Problems with Convex Followers
Lagrangian Decomposition of Mixed-Integer All-Quadratic Programs
Solving mixed-integer programs arising in production planning
Convex approximations for a class of mixed-integer recourse models