An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\). (Q1165469): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Two Algorithms for Determining Volumes of Convex Polyhedra / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Value of Information Given Decision Flexibility / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational results on an algorithm for finding all vertices of a polytope / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3844775 / rank | |||
Normal rank | |||
Revision as of 15:02, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\). |
scientific article |
Statements
An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\). (English)
0 references
1983
0 references
system of linear inequalities
0 references
redundant constraints
0 references
0 references
