Pages that link to "Item:Q1278603"

The following pages link to A method for convex curve approximation (Q1278603):

Displaying 11 items.

• A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets (Q467443) (← links)
• A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem (Q833641) (← links)
• Multiple objective minimum cost flow problems: a review (Q853016) (← links)
• Approximation methods for non-convex curves (Q1847152) (← links)
• Finding representative systems for discrete bicriterion optimization problems (Q2467474) (← links)
• The effect of transformations on the approximation of univariate (convex) functions with applications to Pareto curves (Q2480973) (← links)
• An optimal adaptive algorithm for the approximation of concave functions (Q2492698) (← links)
• Approximation methods in multiobjective programming (Q2583199) (← links)
• Piecewise quadratic approximation of the non-dominated set for bi-criteria programs (Q2720018) (← links)
• How Good is the Chord Algorithm? (Q2816293) (← links)
• Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems (Q6048198) (← links)