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

DOI10.1007/S001860100141MaRDI QIDQ1396997zbMATH OpenOpenAlexFDO

Authors Eric Thiémard

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

zbMATH Keywords

computational geometryInteger programmingstar discrepancy

Mathematics Subject Classification ID

Irregularities of distribution, discrepancy (11K38) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Integer programming (90C10)

Recommendations

• Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems
• Some open problems concerning the star-discrepancy
• Star discrepancy subset selection: problem formulation and efficient approaches for low dimensions
• Calculation of the discrepancy of a finite set of points in the unit n -cube
• An algorithm to compute bounds for the star discrepancy

Cited in

(8)

• 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
• New bounds on the minimal dispersion
• Uniform point sets and the collision test
• KGSA: a gravitational search algorithm for multimodal optimization based on K-means niching technique and a novel elitism strategy
• Calculation of discrepancy measures and applications
• Entropy, Randomization, Derandomization, and Discrepancy
• A Metropolis random walk algorithm to estimate a lower bound of the star discrepancy

This page was built for publication: Optimal volume subintervals with \(k\) points and star discrepancy via integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1396997)