Title
Cartesian factoring of polyhedra in linear relation analysis
Abstract
Linear Relation Analysis [CH78] suffers from the cost of operations on convex polyhedra, which can be exponential with the number of involved variables. In order to reduce this cost, we propose to detect when a polyhedron is a Cartesian product of polyhedra of lower dimensions, i.e., when groups of variables are unrelated with each other. Classical operations are adapted to work on such factored polyhedra. Our implementation shows encouraging experimental results.
Year
DOI
Venue
2003
10.1007/3-540-44898-5_20
SAS
Keywords
Field
DocType
linear relation analysis,cartesian product,factored polyhedron,involved variable,classical operation,convex polyhedron,cartesian factoring,lower dimension
Semiregular polyhedron,Discrete mathematics,Combinatorics,Dual polyhedron,Cartesian product,Polyhedron,Integer points in convex polyhedra,Regular polygon,Convex polytope,Spherical polyhedron,Mathematics
Conference
Volume
ISSN
ISBN
2694
0302-9743
3-540-40325-6
Citations 
PageRank 
References 
11
0.95
14
Authors
3
Name
Order
Citations
PageRank
Nicolas Halbwachs13957426.43
D. Merchat2251.59
Catherine Parent-vigouroux3232.20