A LIBRARY FOR DOING POLYHEDRAL OPERATIONS
From MaRDI portal
Publication:4526928
DOI10.1080/01495730008947354zbMath0968.68172OpenAlexW2074367725MaRDI QIDQ4526928
Publication date: 2000
Published in: Parallel Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00074515/file/RR-2157.pdf
Related Items
Necessary and sufficient conditions for reachability on a simplex, Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets, A control problem for affine dynamical systems on a full-dimensional polytope., On highly robust efficient solutions to uncertain multiobjective linear programs, On the Petri net realization of context-free graphs, Hybrid abstractions of affine systems, Which Symmetric Homogeneous Polynomials Can Be Proved Positive Semi-definite by Difference Substitution Method?, Automatic implementation of affine iterative algorithms: Design flow and communication synthesis, Geometrical Analysis of Model Predictive Control: A Parameterized Polyhedra Approach, Predictive control for hybrid systems. Implications of polyhedral pre-computations, Combinatorial optimization and small polytopes, Two variations of graph test in double description method, Ranking Functions for Linear-Constraint Loops, Solving strong controllability of temporal problems with uncertainty using SMT
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Small-dimensional linear programming and convex hulls made easy
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- Technical Note—Vertex Generation and Cardinality Constrained Linear Programs
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities