Pages that link to "Item:Q5266532"
From MaRDI portal
The following pages link to A New Scalarization Technique and New Algorithms to Generate Pareto Fronts (Q5266532):
Displaying 23 items.
- A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems (Q1670109) (← links)
- A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems (Q1988631) (← links)
- On the use of polynomial models in multiobjective directional direct search (Q2023694) (← links)
- Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization (Q2025290) (← links)
- Combined gradient methods for multiobjective optimization (Q2089219) (← links)
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization (Q2114598) (← links)
- Bi-objective design-for-control of water distribution networks with global bounds (Q2138314) (← links)
- An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729) (← links)
- A norm minimization-based convex vector optimization algorithm (Q2156397) (← links)
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation (Q2184147) (← links)
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization (Q3383208) (← links)
- A modified direction approach for proper efficiency of multiobjective optimization (Q4999343) (← links)
- A nonmonotone gradient method for constrained multiobjective optimization problems (Q5052584) (← links)
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
- Strong and weak conditions of regularity and optimality (Q5095720) (← links)
- Solving Multiobjective Mixed Integer Convex Optimization Problems (Q5131967) (← links)
- Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis (Q5234284) (← links)
- The modified objective-constraint scalarization approach for multiobjective optimization problems (Q5870938) (← links)
- Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems (Q6048198) (← links)
- A new scheme for approximating the weakly efficient solution set of vector rational optimization problems (Q6109053) (← links)
- Twenty years of continuous multiobjective optimization in the twenty-first century (Q6114911) (← links)
- Optimization over the Pareto front of nonconvex multi-objective optimal control problems (Q6188054) (← links)
- A flexible objective-constraint approach and a new algorithm for constructing the Pareto front of multiobjective optimization problems (Q6192422) (← links)
