Click on a term to reduce result list
The result list below will be reduced to the selected search terms. The terms are generated from the titles, abstracts and STW thesaurus of publications by the respective author.
7 records from EconBiz based on author Name
1. A test instance generator for multiobjective mixed-integer optimization
abstractApplication problems can often not be solved adequately by numerical algorithms as several difficulties might arise at the same time. When developing and improving algorithms which hopefully allow to handle those difficulties in the future, good test instances are required. These can then be used to detect the strengths and weaknesses of different algorithmic approaches. In this paper we present a generator for test instances to evaluate solvers for multiobjective mixed-integer linear and nonlinear optimization problems. Based on test instances for purely continuous and purely integer problems with known efficient solutions and known nondominated points, suitable multiobjective mixed-integer test instances can be generated. The special structure allows to construct instances scalable in the number of variables and objective functions. Moreover, it allows to control the resulting efficient and nondominated sets as well as the number of efficient integer assignments.
Eichfelder, Gabriele; Gerlach, Tobias; Warnow, Leo;2024
Type: Aufsatz in Zeitschrift; Article in journal;
Availability:
Link 2. A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
abstractIn multi-objective mixed-integer convex optimization, multiple convex objective functions need to be optimized simultaneously while some of the variables are restricted to take integer values. In this paper, we present a new algorithm to compute an enclosure of the nondominated set of such optimization problems. More precisely, we decompose the multi-objective mixed-integer convex optimization problem into several multi-objective continuous convex optimization problems, which we refer to as patches. We then dynamically compute and improve coverages of the nondominated sets of those patches to finally combine them to obtain an enclosure of the nondominated set of the multi-objective mixed-integer convex optimization problem. Additionally, we introduce a mechanism to reduce the number of patches that need to be considered in total. Our new algorithm is the first of its kind and guaranteed to return an enclosure of prescribed quality within a finite number of iterations. For selected numerical test instances we compare our new criterion space based approach to other algorithms from the literature and show that much larger instances can be solved with our new algorithm.
Eichfelder, Gabriele; Warnow, Leo;2024
Type: Aufsatz in Zeitschrift; Article in journal;
Availability:
Link Link 3. A test instance generator for multiobjective mixed-integer optimization
Eichfelder, Gabriele; Gerlach, Tobias; Warnow, Leo;2023
Type: Article;
Availability:
Link 4. A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
Eichfelder, Gabriele; Warnow, Leo;2023
Type: Article;
Availability:
Link 5. Advancements in the computation of enclosures for multi-objective optimization problems
Eichfelder, Gabriele; Warnow, Leo;2023
Type: Aufsatz in Zeitschrift; Article in journal;
Availability: Link
Citations: 2 (based on OpenCitations)
6. An approximation algorithm for multi-objective optimization problems using a box-coverage
Eichfelder, Gabriele; Warnow, Leo;2021
Type: Article;
Availability:
Link 7. Proximity measures based on KKT points for constrained multi-objective optimization
Eichfelder, Gabriele; Warnow, Leo;2020
Type: Article;
Availability:
Link 