Pages that link to "Item:Q445451"

The following pages link to Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation (Q445451):

Displaying 19 items.

• Preference-inspired co-evolutionary algorithms using weight vectors (Q319113) (← links)
• Multi-objective models and techniques for analysing the absolute capacity of railway networks (Q319616) (← links)
• On the quality of discrete representations in multiple objective programming (Q374696) (← links)
• Fast Pareto set generation for nonlinear optimal control problems with multiple objectives (Q381524) (← links)
• Bilevel programming for generating discrete representations in multiobjective optimization (Q1646577) (← links)
• An efficient hybrid algorithm for multiobjective optimization problems with upper and lower bounds in engineering (Q1666979) (← links)
• Multi-objective optimization using statistical models (Q1728516) (← links)
• A new Pareto set generating method for multi-criteria optimization problems (Q1785297) (← links)
• A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems (Q1988631) (← links)
• Multi-method based algorithm for multi-objective problems under uncertainty (Q2005506) (← links)
• An extension of the non-inferior set estimation algorithm for many objectives (Q2301933) (← links)
• A time-space Kriging-based sequential metamodeling approach for multi-objective crashworthiness optimization (Q2310547) (← links)
• Reduction of prediction error sensitivity to parameters in Kalman filter (Q2667436) (← links)
• Evolutionary Game-Based Dynamical Tuning for Multi-objective Model Predictive Control (Q2798554) (← links)
• Sensitivity importance-based robust optimization of structures with incomplete probabilistic information (Q2895040) (← links)
• A deterministic algorithm for global multi-objective optimization (Q2926067) (← links)
• An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems (Q5055294) (← links)
• An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems (Q6164611) (← links)
• Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs (Q6166099) (← links)