The following pages link to Faces of a polyhedron (Q3720315):
Displaying 10 items.
- A new method for determining all maximal efficient faces in multiple objective linear programming (Q514052) (← links)
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem (Q555995) (← links)
- Bounds on the number of vertices of perturbed polyhedra (Q1312764) (← links)
- Finding all maximal efficient faces in multiobjective linear programming (Q1315425) (← links)
- Maximal descriptor set characterizations of efficient faces in multiple objective linear programming. (Q1413903) (← links)
- Face-guarding polyhedra (Q2248737) (← links)
- The maximal descriptor index set for a face of a convex polyhedral set and some applications (Q2345491) (← links)
- Minimal representations of a face of a convex polyhedron and some applications (Q2667218) (← links)
- (Q4309955) (← links)
- Face-transitive polyhedra with rectangular faces and icosahedral symmetry (Q5932805) (← links)
