Pages that link to "Item:Q1756800"
From MaRDI portal
The following pages link to Tractability of convex vector optimization problems in the sense of polyhedral approximations (Q1756800):
Displaying 7 items.
- Convex projection and convex multi-objective optimization (Q2141728) (← links)
- On the approximation of unbounded convex sets by polyhedra (Q2671446) (← links)
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection (Q5043850) (← links)
- Algorithms to Solve Unbounded Convex Vector Optimization Problems (Q6076862) (← links)
- Polyhedral approximation of spectrahedral shadows via homogenization (Q6150652) (← links)
- Computing the recession cone of a convex upper image via convex projection (Q6593832) (← links)
- An approximation algorithm for multiobjective mixed-integer convex optimization (Q6616281) (← links)
