Computational geometry: an introduction
Computational geometry: an introduction
Minkowski addition of polytopes: computational complexity and applications to Gro¨bner bases
SIAM Journal on Discrete Mathematics
Integer Polyhedra for Program Analysis
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
| Hi-index | 0.00 |
Given a polytope P, the classical linear programming (LP) problem asks us to find a point in P which attains maximal inner product with a given real objective vector c. When the objective is a vector of unknown parameters, the LP problem amounts to computing certain information about the polytope P, such as its vertices and normal fan.