Pages that link to "Item:Q1785308"
From MaRDI portal
The following pages link to Approximate Pareto sets of minimal size for multi-objective optimization problems (Q1785308):
Displaying 14 items.
- Covers and approximations in multiobjective optimization (Q513168) (← links)
- A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures (Q1727958) (← links)
- Coradiant-valued maps and approximate solutions in variable ordering structures (Q1734112) (← links)
- Tour recommendation for groups (Q1741326) (← links)
- Finding representations for an unconstrained bi-objective combinatorial optimization problem (Q1744630) (← links)
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels (Q1753501) (← links)
- One-exact approximate Pareto sets (Q2038919) (← links)
- The power of the weighted sum scalarization for approximating multiobjective optimization problems (Q2075396) (← links)
- Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines (Q2289001) (← links)
- A general approximation method for bicriteria minimization problems (Q2402670) (← links)
- An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems (Q5055294) (← links)
- Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597) (← links)
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
- Approximating biobjective minimization problems using general ordering cones (Q6162511) (← links)
