Polyrun: A Java library for sampling from the bounded convex polytopes
Polyrun is a Java library that provides methods for exploiting the bounded convex polytopes. Such polytopes define a space of feasible problem parameters with a set of linear constraints. The software makes available an implementation of the Hit-and-Run algorithm, which is the Markov Chain Monte Car...
Main Authors: | Krzysztof Ciomek, Miłosz Kadziński |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2021-01-01
|
Series: | SoftwareX |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2352711021000042 |
Similar Items
-
On Sharp Bounds on Partition Dimension of Convex Polytopes
by: Yu-Ming Chu, et al.
Published: (2020-01-01) -
Cutting Convex Polytopes by Hyperplanes
by: Takayuki Hibi, et al.
Published: (2019-04-01) -
M-Polynomials and degree-based Topological Indices of Some Families of Convex Polytopes
by: Muhammad Riaz, et al.
Published: (2018-02-01) -
Le polytope des sous-espaces d'un espace affin fini / The polytope of subspaces of a finite affine space
by: Christophe, Julie
Published: (2006) -
On the moments of random variables uniformly distributed over a polytope
by: S. Paramasamy
Published: (1997-01-01)