Pages that link to "Item:Q1008773"

The following pages link to Decomposition branch and bound algorithm for optimization problems over efficient sets (Q1008773):

Displaying 9 items.

• Criteria and dimension reduction of linear multiple criteria optimization problems (Q427372) (← links)
• Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets (Q613601) (← links)
• Effective branching splitting method under cost constraint (Q952828) (← links)
• Bisection search algorithm for optimizing over the efficient set (Q1592677) (← links)
• Combination between global and local methods for solving an optimization problem over the efficient set (Q1848362) (← links)
• An algorithm for optimizing over the efficient set of a multiple objective affine fractional problem. (Q1862698) (← links)
• Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection (Q2097485) (← links)
• (Q3071609) (← links)
• (Q4724430) (← links)