Speeding up Polyhedral Analysis by Identifying Common Constraints
From MaRDI portal
Publication:2814112
DOI10.1016/j.entcs.2010.09.011zbMath1342.68102MaRDI QIDQ2814112
Publication date: 17 June 2016
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2010.09.011
52B55: Computational aspects related to convexity
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Uses Software
Cites Work
- Unnamed Item
- Some ways to reduce the space dimension in polyhedra computations
- A canonical form for generalized linear constraints
- Not necessarily closed convex polyhedra and the double description method
- Analyzing String Buffers in C
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- A combination framework for tracking partition sizes
- Static Analysis