Solving multiobjective mixed integer convex optimization problems
Multiobjective mixed integer convex optimization refers to mathematical programming
problems where more than one convex objective function needs to be optimized …
problems where more than one convex objective function needs to be optimized …
Mixed-integer convex nonlinear optimization with gradient-boosted trees embedded
M Mistry, D Letsios, G Krennrich… - INFORMS Journal …, 2021 - pubsonline.informs.org
Decision trees usefully represent sparse, high-dimensional, and noisy data. Having learned
a function from these data, we may want to thereafter integrate the function into a larger …
a function from these data, we may want to thereafter integrate the function into a larger …
[LIBRO][B] Branching strategies for mixed-integer programs containing logical constraints and decomposable structure
MN Mistry - 2021 - core.ac.uk
Decision-making optimisation problems can include discrete selections, eg selecting a
route, arranging non-overlap** items or designing a network of items. Branch-and-bound …
route, arranging non-overlap** items or designing a network of items. Branch-and-bound …
[PDF][PDF] Nonconvex and mixed integer multiobjective optimization with an application to decision uncertainty
J Niebling - 2019 - db-thueringen.de
Multiobjective optimization problems commonly arise in different fields like economics or
engineering. In general, when dealing with several conflicting objective functions, there is an …
engineering. In general, when dealing with several conflicting objective functions, there is an …