Pages that link to "Item:Q475807"

The following pages link to Primal and dual approximation algorithms for convex vector optimization problems (Q475807):

Displaying 37 items.

• A parametric simplex algorithm for linear vector optimization problems (Q526835) (← links)
• Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization (Q829338) (← links)
• Outer approximation method incorporating a quadratic approximation for a DC programming problem (Q848730) (← links)
• Tractability of convex vector optimization problems in the sense of polyhedral approximations (Q1756800) (← links)
• The primal-dual method for approximation algorithms (Q1849526) (← 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)
• An algorithmic approach to multiobjective optimization with decision uncertainty (Q2173509) (← 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)
• An exact algorithm for biobjective integer programming problems (Q2668742) (← links)
• On the approximation of unbounded convex sets by polyhedra (Q2671446) (← links)
• A Comparison of Techniques for Dynamic Multivariate Risk Measures (Q2805752) (← links)
• Set Optimization—A Rather Short Introduction (Q2805754) (← links)
• Solving generalized convex multiobjective programming problems by a normal direction method (Q2836102) (← links)
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization (Q4629343) (← links)
• Primal and dual algorithms for optimization over the efficient set (Q4646523) (← links)
• Inner approximation algorithm for solving linear multiobjective optimization problems (Q5009156) (← links)
• Time Consistency of the Mean-Risk Problem (Q5031608) (← links)
• A Benson-type algorithm for bounded convex vector optimization problems with vertex selection (Q5043850) (← links)
• Solving Multiobjective Mixed Integer Convex Optimization Problems (Q5131967) (← 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)
• Outer approximation algorithms for convex vector optimization problems (Q6113528) (← links)
• Twenty years of continuous multiobjective optimization in the twenty-first century (Q6114911) (← links)
• Polyhedral approximation of spectrahedral shadows via homogenization (Q6150652) (← links)
• A polyhedral approximation algorithm for recession cones of spectrahedral shadows (Q6561494) (← links)
• Convergence analysis of a norm minimization-based convex vector optimization algorithm (Q6587338) (← links)
• Computing the recession cone of a convex upper image via convex projection (Q6593832) (← links)
• PaMILO: a solver for multi-objective mixed integer linear optimization and beyond (Q6606539) (← links)
• An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems (Q6616278) (← links)
• An approximation algorithm for multiobjective mixed-integer convex optimization (Q6616281) (← links)
• Deep learning the efficient frontier of convex vector optimization problems (Q6618150) (← links)
• A solver for multiobjective mixed-integer convex and nonconvex optimization (Q6644257) (← links)