hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource, 30 Seiten
- Sprache
-
Englisch
- Erschienen in
-
In: Mathematical methods of operations research(100), H. 1, S.291-320 - ISSN 1432-5217
In: Springer, Berlin
- Ereignis
-
Veröffentlichung
- (wo)
-
Ilmenau
- (wer)
-
TU Ilmenau
- (wann)
-
2023
- Urheber
- DOI
-
10.1007/s00186-023-00828-x
- URN
-
urn:nbn:de:101:1-2409090306092.082527859327
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:47 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
- Eichfelder, Gabriele
- Warnow, Leo
- TU Ilmenau
Entstanden
- 2023
Ähnliche Objekte (12)
A branch-and-bound algorithm for multiobjective mixed-integer convex optimization
Convex relaxations for mixed-integer nonlinear programs
Solving multi-objective mixed-integer nonlinear optimization problems
test instance generator for multiobjective mixed-integer optimization
Algorithms for Mixed-Integer Bilevel Problems with Convex Followers
Solving multiobjective mixed integer convex optimization problems
Convex approximations for a class of mixed-integer recourse models
Non-convex and multi-objective optimization in data mining : non-convex and multi-objective optimization for statistical learning and numerical feature engineering
The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
Hierarchical Convex Multiobjective Optimization by the Euclidean Reference Point Method
Solution Approaches for Multiobjective Convex Quadratic and Nonlinear Optimization Problems
An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
A branch-and-bound algorithm for multiobjective mixed-integer convex optimization
Convex relaxations for mixed-integer nonlinear programs
Solving multi-objective mixed-integer nonlinear optimization problems
test instance generator for multiobjective mixed-integer optimization
Algorithms for Mixed-Integer Bilevel Problems with Convex Followers
Solving multiobjective mixed integer convex optimization problems
Convex approximations for a class of mixed-integer recourse models
Non-convex and multi-objective optimization in data mining : non-convex and multi-objective optimization for statistical learning and numerical feature engineering
The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
Hierarchical Convex Multiobjective Optimization by the Euclidean Reference Point Method
Solution Approaches for Multiobjective Convex Quadratic and Nonlinear Optimization Problems
An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
A branch-and-bound algorithm for multiobjective mixed-integer convex optimization
Convex relaxations for mixed-integer nonlinear programs
Solving multi-objective mixed-integer nonlinear optimization problems
test instance generator for multiobjective mixed-integer optimization
Algorithms for Mixed-Integer Bilevel Problems with Convex Followers
Solving multiobjective mixed integer convex optimization problems
Convex approximations for a class of mixed-integer recourse models
Non-convex and multi-objective optimization in data mining : non-convex and multi-objective optimization for statistical learning and numerical feature engineering
The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
Hierarchical Convex Multiobjective Optimization by the Euclidean Reference Point Method
Solution Approaches for Multiobjective Convex Quadratic and Nonlinear Optimization Problems