Pages that link to "Item:Q2360302"

The following pages link to Non-convex multi-objective optimization (Q2360302):

Displaying 30 items.

• Efficient multicriterial optimization based on intensive reuse of search information (Q1754449) (← links)
• On the extension of the \textsc{direct} algorithm to multiple objectives (Q2022240) (← links)
• Nonlinear biobjective optimization: improving the upper envelope using feasible line segments (Q2022248) (← links)
• A new approach to generate pattern-efficient sets of non-dominated vectors for multi-objective optimization (Q2023258) (← links)
• Nonconvex constrained optimization by a filtering branch and bound (Q2038915) (← links)
• A general branch-and-bound framework for continuous global multiobjective optimization (Q2038927) (← links)
• An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems (Q2117623) (← links)
• Integrating \(\varepsilon \)-dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems (Q2124811) (← links)
• An optimization method for chaotic turbulent flow (Q2135828) (← links)
• An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729) (← links)
• Recent trends on nonlinear filtering for inverse problems (Q2147770) (← links)
• Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology (Q2204444) (← links)
• Computationally efficient approach for solving lexicographic multicriteria optimization problems (Q2230779) (← links)
• Multi-objective evolutionary algorithms for a reliability location problem (Q2286920) (← links)
• Targeting solutions in Bayesian multi-objective optimization: sequential and batch versions (Q2294603) (← links)
• On efficiency of a single variable bi-objective optimization algorithm (Q2300650) (← links)
• DMaOEA-\(\varepsilon\)C: decomposition-based many-objective evolutionary algorithm with the \(\varepsilon\)-constraint framework (Q2666817) (← links)
• An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization (Q2678998) (← links)
• Understanding the Impact of Constraints: A Rank Based Fitness Function for Evolutionary Methods (Q2958625) (← links)
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization (Q4629343) (← links)
• A hybrid of Bayesian-based global search with Hooke–Jeeves local refinement for multi-objective optimization problems (Q5080393) (← links)
• A Partition Based Bayesian Multi-objective Optimization Algorithm (Q5122343) (← links)
• Multi-objective optimization and decision visualization of batch stirred tank reactor based on spherical catalyst particles (Q5205563) (← links)
• Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems (Q6048198) (← links)
• The generalized conditional gradient method for composite multiobjective optimization problems on Riemannian manifolds (Q6085820) (← links)
• Twenty years of continuous multiobjective optimization in the twenty-first century (Q6114911) (← links)
• Constrained multiobjective optimization of expensive black-box functions using a heuristic branch-and-bound approach (Q6123558) (← links)
• An adaptive consensus based method for multi-objective optimization with uniform Pareto front approximation (Q6133674) (← links)
• Filtering Methods for Coupled Inverse Problems (Q6171195) (← links)
• Robust second order cone conditions and duality for multiobjective problems under uncertainty data (Q6203549) (← links)