Pages that link to "Item:Q1024731"
From MaRDI portal
The following pages link to A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes (Q1024731):
Displaying 5 items.
- Finding extreme points in three dimensions and solving the post-office problem in the plane (Q1069424) (← links)
- On the complexity of the extreme points decision problem (Q1183448) (← links)
- Enumerating extreme points of a highly degenerate polytope (Q1318458) (← links)
- Extremal point queries with lines and line segments and related problems (Q2571215) (← links)
- A common formula to compute the efficient sets of a class of multiple objective linear programming problems (Q3454856) (← links)