Hochschulschrift
A branch-and-bound algorithm for multiobjective mixed-integer convex optimization
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783658291488
3658291486
- Maße
-
21 cm, 158 g
- Umfang
-
VIII, 70 Seiten
- Ausgabe
-
[1st edition]
- Sprache
-
Englisch
- Anmerkungen
-
Illustrationen
- Klassifikation
-
Mathematik
- Ereignis
-
Veröffentlichung
- (wo)
-
Wiesbaden, Germany
- (wer)
-
Springer Spektrum
- (wann)
-
[2020]
- Urheber
- Beteiligte Personen und Organisationen
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 13:43 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
- Rocktäschel, Stefan
- Springer Fachmedien Wiesbaden
- Springer Spektrum
Entstanden
- [2020]
Ähnliche Objekte (12)
Convex relaxations for mixed-integer nonlinear programs
Solving multi-objective mixed-integer nonlinear optimization problems
test instance generator for multiobjective mixed-integer optimization
Solving multiobjective mixed integer convex optimization problems
hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
Algorithms for Mixed-Integer Bilevel Problems with Convex Followers
Convex approximations for a class of mixed-integer recourse models
The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
Exact mixed-integer programming
A Branch-and-Bound Approach to Mixed-Integer Optimal Control Using POD
Computational mixed-integer semidefinite programming
Vorlesung 05: Mixed-Integer Programme
Convex relaxations for mixed-integer nonlinear programs
Solving multi-objective mixed-integer nonlinear optimization problems
test instance generator for multiobjective mixed-integer optimization
Solving multiobjective mixed integer convex optimization problems
hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
Algorithms for Mixed-Integer Bilevel Problems with Convex Followers
Convex approximations for a class of mixed-integer recourse models
The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
Exact mixed-integer programming
A Branch-and-Bound Approach to Mixed-Integer Optimal Control Using POD
Computational mixed-integer semidefinite programming
Vorlesung 05: Mixed-Integer Programme
Convex relaxations for mixed-integer nonlinear programs
Solving multi-objective mixed-integer nonlinear optimization problems
test instance generator for multiobjective mixed-integer optimization
Solving multiobjective mixed integer convex optimization problems
hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
Algorithms for Mixed-Integer Bilevel Problems with Convex Followers
Convex approximations for a class of mixed-integer recourse models
The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
Exact mixed-integer programming
A Branch-and-Bound Approach to Mixed-Integer Optimal Control Using POD
Computational mixed-integer semidefinite programming