Pages that link to "Item:Q548180"

The following pages link to An approximation algorithm for convex multi-objective programming problems (Q548180):

Displaying 50 items.

• Primal and dual approximation algorithms for convex vector optimization problems (Q475807) (← links)
• A parametric simplex algorithm for linear vector optimization problems (Q526835) (← links)
• Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization (Q557143) (← links)
• Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming (Q642767) (← links)
• A constraint shifting homotopy method for convex multi-objective programming (Q651890) (← links)
• Benson type algorithms for linear vector optimization and applications (Q743969) (← links)
• Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization (Q829338) (← links)
• Method of centers algorithm for multi-objective programming problems (Q981789) (← links)
• Multi-objective optimization over convex disjunctive feasible sets using reference points (Q1278716) (← links)
• Approximating the noninferior set in multiobjective linear programming problems (Q1309915) (← links)
• Discrete representation of the non-dominated set for multi-objective optimization problems using kernels (Q1753501) (← links)
• A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510) (← links)
• Tractability of convex vector optimization problems in the sense of polyhedral approximations (Q1756800) (← links)
• Nonconvex constrained optimization by a filtering branch and bound (Q2038915) (← links)
• Convex projection and convex multi-objective optimization (Q2141728) (← links)
• An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729) (← links)
• A norm minimization-based convex vector optimization algorithm (Q2156397) (← links)
• Finding non dominated points for multiobjective integer convex programs with linear constraints (Q2162515) (← links)
• An algorithmic approach to multiobjective optimization with decision uncertainty (Q2173509) (← links)
• An objective space cut and bound algorithm for convex multiplicative programmes (Q2250114) (← links)
• An extension of the non-inferior set estimation algorithm for many objectives (Q2301933) (← links)
• A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle (Q2397431) (← links)
• A Benson type algorithm for nonconvex multiobjective programming problems (Q2408519) (← links)
• Norm-based approximation in \(E\)-\([0,1]\) convex multi-objective programming (Q2410884) (← links)
• Obtaining an outer approximation of the efficient set of nonlinear biobjective problems (Q2460136) (← links)
• On the approximation of unbounded convex sets by polyhedra (Q2671446) (← links)
• Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes (Q2790887) (← links)
• An approximation to the nondominated set of a multiobjective linear fractional programming problem (Q2817230) (← links)
• Solving generalized convex multiobjective programming problems by a normal direction method (Q2836102) (← links)
• Enhancement of sandwich algorithms for approximating higher-dimensional convex Pareto sets (Q2899142) (← links)
• A complementarity constraint formulation of convex multiobjective optimization problems (Q2901064) (← links)
• A deterministic algorithm for global multi-objective optimization (Q2926067) (← links)
• Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy (Q2935310) (← links)
• Approximating the convex Edgeworth-Pareto hull in integer multi-objective problems with monotone criteria (Q2995719) (← links)
• (Q3032094) (← links)
• (Q3172689) (← links)
• Approximation Schemes for Multi-objective Optimization with Quadratic Constraints of Fixed CP-Rank (Q3449539) (← links)
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization (Q4629343) (← links)
• Weighted Multidimensional Search and Its Application to Convex Optimization (Q4875446) (← links)
• Inner approximation algorithm for solving linear multiobjective optimization problems (Q5009156) (← links)
• A Benson-type algorithm for bounded convex vector optimization problems with vertex selection (Q5043850) (← links)
• An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives (Q5085488) (← links)
• Solving Multiobjective Mixed Integer Convex Optimization Problems (Q5131967) (← links)
• Approximating nondominated sets in continuous multiobjective optimization problems (Q5318290) (← links)
• Approximation of convex bodies by multiple objective optimization and an application in reachable sets (Q5745164) (← links)
• Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems (Q5883318) (← links)
• Algorithms to Solve Unbounded Convex Vector Optimization Problems (Q6076862) (← links)
• Advancements in the computation of enclosures for multi-objective optimization problems (Q6113330) (← links)
• Outer approximation algorithms for convex vector optimization problems (Q6113528) (← links)
• Twenty years of continuous multiobjective optimization in the twenty-first century (Q6114911) (← links)