The following pages link to Banu Lokman (Q342782):
Displaying 12 items.
- An interactive algorithm to find the most preferred solution of multi-objective integer programs (Q342783) (← links)
- Finding all nondominated points of multi-objective integer programs (Q377734) (← links)
- An interactive approximation algorithm for multi-objective integer programs (Q1652656) (← links)
- Finding a representative nondominated set for multi-objective mixed integer programs (Q1991106) (← links)
- Robustness of efficiency scores in data envelopment analysis with interval scale data (Q2060434) (← links)
- Extensions for Benders cuts and new valid inequalities for solving the European day-ahead electricity market clearing problem efficiently (Q2116884) (← links)
- Distribution based representative sets for multi-objective integer programs (Q2178085) (← links)
- Representing the nondominated set in multi-objective mixed-integer programs (Q2242330) (← links)
- Finding nadir points in multi-objective integer programs (Q2350074) (← links)
- Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems (Q3621927) (← links)
- Optimizing a linear function over the nondominated set of multiobjective integer programs (Q6091884) (← links)
- Cluster ensemble selection and consensus clustering: a multi-objective optimization approach (Q6556105) (← links)
