Exact volume computation for polytopes: A practical study
From MaRDI portal
Recommendations
Cited in
(67)- The volume algorithm revisited: relation with bundle methods
- Convex set symmetry measurement using Blaschke addition
- A control problem for affine dynamical systems on a full-dimensional polytope.
- Inner and outer approximations of polytopes using boxes.
- Computing and estimating the volume of the solution space of SMT(LA) constraints
- An approximation method for computing the expected value of max-affine expressions
- Asymptotic vulnerability of positional voting rules to coalitional manipulation
- Threshold functions and Poisson convergence for systems of equations in random sets
- Simple formula for integration of polynomials on a simplex
- An algorithm for computing phase space structures in chemical reaction dynamics using Voronoi tessellation
- Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises
- Efficient sampling in spectrahedra and volume approximation
- Monte Carlo sampling can be used to determine the size and shape of the steady-state flux space
- Local formulas for Ehrhart coefficients from lattice tiles
- Estimating the volume of solution space for satisfiability modulo linear real arithmetic
- Multidimensional welfare rankings under weight imprecision: a social choice perspective
- Exact calculation of the overlap volume of spheres and mesh elements
- Unmixing the mixed volume computation
- Exploiting polyhedral symmetries in social choice
- Linear programming system identification: the general nonnegative parameters case
- Probability calculations under the IAC hypothesis
- Evaluation of nondominated solution sets for \(k\)-objective optimization problems: an exact method and approximations
- Statistics of energy partitions for many-particle systems in arbitrary dimension
- Stokes, Gibbs, and volume computation of semi-algebraic sets
- Exploiting sparsity for semi-algebraic set volume computation
- Computing volume of solids bounded by Bézier surfaces
- Pruning algorithms for pretropisms of Newton polytopes
- Faster geometric algorithms via dynamic determinant computation
- A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding
- Complexity and algorithms for computing Voronoi cells of lattices
- Exploring stochasticity and imprecise knowledge based on linear inequality constraints
- A Laplace transform algorithm for the volume of a convex polytope
- A Fast and Practical Method to Estimate Volumes of Convex Polytopes
- An Efficient Algorithm for Obtaining the Volume of a Special Kind of Pyramid and Application to Convex Polyhedra
- Probabilistic approach for predicting periodic orbits in piecewise affine differential models
- (Deterministic) algorithms that compute the volume of polytopes
- Computing the Expected Value and Variance of Geometric Measures
- Different Volume Computation Methods of Graph Polytopes
- Using histograms to better answer queries to probabilistic logic programs
- scientific article; zbMATH DE number 2156369 (Why is no real title available?)
- Exact and approximate approaches to the identification of stochastic MAX-plus-linear systems
- A complete description of cones and polytopes including hypervolumes of all facets of a polytope
- Susceptibility to Manipulation by Sincere Truncation: The Case of Scoring Rules and Scoring Runoff Systems
- Illumination Depth
- Parallel degree computation for binomial systems
- scientific article; zbMATH DE number 7236423 (Why is no real title available?)
- Computing the Hausdorff boundary measure of semialgebraic sets
- A primal-dual lifting scheme for two-stage robust optimization
- Volume Computation for Boolean Combination of Linear Arithmetic Constraints
- Directed acyclic decomposition of Kuramoto equations
- Polar degrees and closest points in codimension two
- Computing the invariants of intersection algebras of principal monomial ideals
- A convergent discretization method for transition path theory for diffusion processes
- Generalized Permutahedra and Optimal Auctions
- Volume‐based ranking method for a ranked voting system
- On the convex hull of \(k\)-additive 0-1 capacities and its application to model identification in decision making
- Computation of robust control invariant sets with predefined complexity for uncertain systems
- An interactive algorithm for multiobjective ranking for underlying linear and quasiconcave value functions
- Polytope volume in Normaliz
- A HYBRID MEMBERSHIP LATENT DISTANCE MODEL FOR UNSIGNED AND SIGNED INTEGER WEIGHTED NETWORKS
- Multivariate splines and polytopes
- Quadrature-free polytopic discontinuous Galerkin methods for transport problems
- Linear programming with infinite, finite, and infinitesimal values in the right-hand side
- A non-probabilistic convex polyhedron model for reliability analysis of structures with multiple failure modes and correlated uncertainties based on limited data
- Polynomial optimization for nonlinear dynamics: theory, algorithms and applications. Abstracts from the workshop held July 28 -- August 2, 2024
- Linear programming system identification
- Polytope volume by descent in the face lattice and applications in social choice
This page was built for publication: Exact volume computation for polytopes: A practical study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4518985)
