Hochschulschrift
A branch-and-bound algorithm for multiobjective mixed-integer convex optimization
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783658291488
3658291486
- Dimensions
-
21 cm, 158 g
- Extent
-
VIII, 70 Seiten
- Edition
-
[1st edition]
- Language
-
Englisch
- Notes
-
Illustrationen
- Classification
-
Mathematik
- Event
-
Veröffentlichung
- (where)
-
Wiesbaden, Germany
- (who)
-
Springer Spektrum
- (when)
-
[2020]
- Creator
- Contributor
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 1:43 PM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Rocktäschel, Stefan
- Springer Fachmedien Wiesbaden
- Springer Spektrum
Time of origin
- [2020]
Other Objects (12)
An approximation algorithm for multiobjective mixed-integer convex optimization
A Solver for Multiobjective Mixed-Integer Convex and Nonconvex Optimization
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
Convex relaxations for mixed-integer nonlinear programs
Solving multi-objective mixed-integer nonlinear optimization problems
test instance generator for multiobjective mixed-integer optimization
A test instance generator for multiobjective mixed-integer optimization
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
Solving multiobjective mixed integer convex optimization problems
A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
Convex approximations for a class of mixed-integer recourse models
An approximation algorithm for multiobjective mixed-integer convex optimization
A Solver for Multiobjective Mixed-Integer Convex and Nonconvex Optimization
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
Convex relaxations for mixed-integer nonlinear programs
Solving multi-objective mixed-integer nonlinear optimization problems
test instance generator for multiobjective mixed-integer optimization
A test instance generator for multiobjective mixed-integer optimization
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
Solving multiobjective mixed integer convex optimization problems
A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
Convex approximations for a class of mixed-integer recourse models
An approximation algorithm for multiobjective mixed-integer convex optimization
A Solver for Multiobjective Mixed-Integer Convex and Nonconvex Optimization
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
Convex relaxations for mixed-integer nonlinear programs
Solving multi-objective mixed-integer nonlinear optimization problems
test instance generator for multiobjective mixed-integer optimization
A test instance generator for multiobjective mixed-integer optimization
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
Solving multiobjective mixed integer convex optimization problems
A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems