Optimal volume subintervals with \(k\) points and star discrepancy via integer programming
From MaRDI portal
Publication:1396997
DOI10.1007/s001860100141zbMath1031.90016OpenAlexW2094589132MaRDI QIDQ1396997
Publication date: 16 July 2003
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001860100141
Integer programming (90C10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Irregularities of distribution, discrepancy (11K38)
Related Items (8)
New bounds on the minimal dispersion ⋮ Entropy, Randomization, Derandomization, and Discrepancy ⋮ KGSA: a gravitational search algorithm for multimodal optimization based on K-means niching technique and a novel elitism strategy ⋮ A Metropolis random walk algorithm to estimate a lower bound of the star discrepancy ⋮ Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems ⋮ A random walk algorithm to estimate a lower bound of the star discrepancy ⋮ Calculation of Discrepancy Measures and Applications ⋮ Uniform point sets and the collision test
This page was built for publication: Optimal volume subintervals with \(k\) points and star discrepancy via integer programming
