Pages that link to "Item:Q1825606"

The following pages link to Approximation of convex curves with application to the bicriterial minimum cost flow problem (Q1825606):

Displaying 19 items.

• The Pareto-optimal solution set of the equilibrium network design problem with multiple commensurate objectives (Q651306) (← links)
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← 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)
• \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows (Q909586) (← links)
• A methodology for assessing eco-efficiency in logistics networks (Q954900) (← links)
• The convergence rate of the sandwich algorithm for approximating convex functions (Q1195962) (← links)
• A method for convex curve approximation (Q1278603) (← links)
• On the efficient point set of tricriteria linear programs (Q1319580) (← links)
• Approximation methods for non-convex curves (Q1847152) (← links)
• Multiobjective transportation network design and routing problems: Taxonomy and annotation (Q2368289) (← 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 of convex sets by polytopes (Q2519248) (← links)
• Approximation methods in multiobjective programming (Q2583199) (← links)
• How Good is the Chord Algorithm? (Q2816293) (← links)
• From closed-loop to sustainable supply chains: the WEEE case (Q3163212) (← links)
• Sandwich approximation of univariate convex functions with an application to separable convex programming (Q3987782) (← links)