Pages that link to "Item:Q4397408"
From MaRDI portal
The following pages link to On a calculation of an arbitrary separating hyperplane of convex polyhedral sets (Q4397408):
Displaying 19 items.
- On the problem polyhedral separability: a numerical solution (Q268664) (← links)
- Separation theorems for convex polytopes and finitely-generated cones derived from theorems of the alternative (Q417521) (← links)
- A theorem on strict separability of convex polyhedra and its applications in optimization (Q535082) (← links)
- On the separation of parametric convex polyhedral sets with application in MOLP. (Q622854) (← links)
- Exact separation of \(k\)-projection polytope constraints (Q1695086) (← links)
- Separation of integer points by a hyperplane under some weak notions of discrete convexity (Q1759805) (← links)
- Penumbras and separation of convex sets (Q2034871) (← links)
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube (Q2419579) (← links)
- Parameter spaces of separating hyperplanes (Q2808298) (← links)
- (Q3511907) (← links)
- A linear algorithm for determining the separation of convex polyhedra (Q3697818) (← links)
- (Q4017039) (← links)
- On a supporting hyperlane for two convex polyhedral sets (Q4397405) (← links)
- Separating support hyperplanes for a pair of convex polyhedral sets (Q4397409) (← links)
- (Q5026415) (← links)
- Checking the convexity of polytopes and the planarity of subdivisions (extended abstract) (Q5096937) (← links)
- Towards the computation of the convex hull of a configuration from its corresponding separating matrix (Q5442545) (← links)
- (Q5493575) (← links)
- (Q5804491) (← links)
