Pages that link to "Item:Q1863906"

The following pages link to Generating well-distributed sets of Pareto points for engineering design using physical programming (Q1863906):

Displaying 22 items.

• Global and well-distributed Pareto frontier by modified normalized normal constraint methods for bicriterion problems (Q373899) (← links)
• On the quality of discrete representations in multiple objective programming (Q374696) (← links)
• The weighted sum method for multi-objective optimization: new insights (Q381490) (← links)
• A design optimization strategy for creating devices that traverse the Pareto frontier over time (Q381562) (← links)
• Divergent exploration in design with a dynamic multiobjective optimization formulation (Q381985) (← links)
• Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation (Q445451) (← links)
• Guided moth-flame optimiser for multi-objective optimization problems (Q828882) (← links)
• On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods (Q877666) (← links)
• On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach (Q905750) (← links)
• A new graphical visualization of \(n\)-dimensional Pareto front for decision-making in multiobjective optimization (Q955734) (← links)
• Genetic algorithms optimization for normalized normal constraint method under Pareto construction (Q1005565) (← links)
• Equality constraints in multiobjective robust design optimization: Decision making problem (Q1016391) (← links)
• Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach (Q1655397) (← links)
• Optimal Nash tuning rules for robust PID controllers (Q2012109) (← links)
• Recent advances and future trends in exploring Pareto-optimal topologies and additive manufacturing oriented topology optimization (Q2047736) (← links)
• An effective multi-objective artificial hummingbird algorithm with dynamic elimination-based crowding distance for solving engineering design problems (Q2160426) (← links)
• Considering dynamic Pareto frontiers in decision making (Q2357830) (← links)
• A method for generating a well-distributed Pareto set in nonlinear multiobjective optimization (Q2378257) (← links)
• Box-constrained multi-objective optimization: A gradient-like method without ``a priori'' scalarization (Q2475812) (← links)
• Approximation methods in multiobjective programming (Q2583199) (← links)
• A two-phase Pareto front method for solving the bi-objective personnel task rescheduling problem (Q2669725) (← links)
• A multi-objective optimization using distribution characteristics of reference data for reverse engineering (Q3018041) (← links)