Pages that link to "Item:Q1991106"

The following pages link to Finding a representative nondominated set for multi-objective mixed integer programs (Q1991106):

Displaying 10 items.

• New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach (Q2106743) (← links)
• Solution approaches for equitable multiobjective integer programming problems (Q2150765) (← links)
• Distribution based representative sets for multi-objective integer programs (Q2178085) (← links)
• Representing the nondominated set in multi-objective mixed-integer programs (Q2242330) (← links)
• An extension of the non-inferior set estimation algorithm for many objectives (Q2301933) (← links)
• An exact algorithm for biobjective integer programming problems (Q2668742) (← links)
• Split algorithms for multiobjective integer programming problems (Q2669784) (← links)
• Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems (Q6048198) (← links)
• A criterion space decomposition approach to generalized tri-objective tactical resource allocation (Q6067194) (← links)
• Effective anytime algorithm for multiobjective combinatorial optimization problems (Q6086280) (← links)