Pages that link to "Item:Q958243"

The following pages link to On the hardness of computing intersection, union and Minkowski sum of polytopes (Q958243):

Displaying 15 items.

• Constrained zonotopes: a new tool for set-based estimation and fault detection (Q286264) (← links)
• Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems (Q748756) (← links)
• Complexity of approximating the vertex centroid of a polyhedron (Q764376) (← links)
• Exact recursive updating of state uncertainty sets for linear SISO systems (Q1626852) (← links)
• On highly robust efficient solutions to uncertain multiobjective linear programs (Q1991250) (← links)
• Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism (Q2014726) (← links)
• Set operations and order reductions for constrained zonotopes (Q2116675) (← links)
• a-tint: a polymake extension for algorithmic tropical intersection theory (Q2441658) (← links)
• Economic model predictive control for robust optimal operation of sparse storage networks (Q2663870) (← links)
• Verification of Hybrid Systems (Q3176388) (← links)
• (Q5009560) (← links)
• Robust MPC for linear systems with bounded disturbances based on admissible equilibria sets (Q6068429) (← links)
• Differentially fixed ideals in affine semigroup rings (Q6072392) (← links)
• Constrained polynomial zonotopes (Q6171823) (← links)
• Nonlinear set‐membership state estimation based on the Koopman operator (Q6190317) (← links)