Optimal volume subintervals with k points and star discrepancy via integer programming

Mathematical Methods of Operations Research

Volumn 54, Issue 1, 2001, Pages 21-45

  Thiémard, Eric ^a  

^a EPFL   (Switzerland)

Author keywords

Computational geometry; Integer programming; Star discrepancy

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; MONTE CARLO METHODS; SET THEORY;

STAR DISCREPANCY;

INTEGER PROGRAMMING;

EID: 0034775573     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001860100141     Document Type: Article

References (28)

1. τ-sequences
2. Algorithm 659: Implementing sobol's quasi-random sequence generator
3. A method for exact calculation of the discrepancy of low-dimensional finite point sets I
4. A method for exact calculation of the star discrepancy of plane sets applied to the sequences of Hammersley
5. Computing the discrepancy
6. Discrépance de suites associées à un système de numération (en dimension s)
7. Méthodes quasi-Monte-Carlo multidimensionnelles
8. On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
9. Funktionen von beschränkter Variation in der Theorie der Gleichverteilung
10. Computer solutions of the traveling salesman problem
11. Discrepancy and convex programming
12. Point sets and sequences with small discrepancy
13. Random number generation and quasi-monte carlo methods
14. Quasi-Monte Carlo methods for numerical integration: Comparison of different low discrepancy sequences
15. On irregularities of distribution
16. On the distribution of points in a cube and he approximate evaluation of integrals
17. Computing bounds for the star discrepancy
18. An algorithm to compute bounds for the star discrepancy
19. On the use of low discrepancy sequences in Monte Carlo methods
20. Application of threshold accepting to the evaluation of the discrepancy of a set of points