Pages that link to "Item:Q3211123"
From MaRDI portal
The following pages link to An approximation method for the efficiency set of multiobjective programming problems (Q3211123):
Displaying 13 items.
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations (Q406645) (← links)
- Stochastic convergence of random search methods to fixed size Pareto front approximations (Q545118) (← links)
- Convergence of stochastic search algorithms to finite size Pareto set approximations (Q934805) (← links)
- On several concepts for \(\varepsilon\)-efficiency (Q1342424) (← links)
- Advancing local search approximations for multiobjective combinatorial optimization problems (Q2125231) (← links)
- An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729) (← links)
- Joint efficient ordering method for group multiobjective programming (Q2369256) (← links)
- Approximation methods in multiobjective programming (Q2583199) (← links)
- An approximation to the nondominated set of a multiobjective linear fractional programming problem (Q2817230) (← links)
- (Q2994314) (← links)
- (Q4463130) (← links)
- An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems (Q5055294) (← links)
- Solving set-valued optimization problems using a multiobjective approach (Q5882836) (← links)