Pages that link to "Item:Q319989"

The following pages link to A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application (Q319989):

Displaying 4 items.

• Non-monotonous sequential subgradient projection algorithm for convex feasibility problem (Q519264) (← links)
• A relaxed projection method for solving multiobjective optimization problems (Q1752157) (← links)
• A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems (Q2301136) (← links)
• An accelerated augmented Lagrangian method for multi-criteria optimization problem (Q2338456) (← links)