A uniform sampling method for permutation space

DOI10.1007/S10479-024-06039-9zbMATH Open1545.65009MaRDI QIDQ6588515FDOQ6588515

Authors: Lin Gui, Xinyu Li, Qingfu Zhang, Liang Gao 

Publication date: 15 August 2024

Published in: Annals of Operations Research (Search for Journal in Brave)

Recommendations

• Efficient sampling of random permutations
• Are random permutations spherically uniform?
• Observations on the generation of permutations from random sequences
• Using integer programming techniques for the solution of an experimental design problem
• Uniform sampling on the standard simplex

zbMATH Keywords

random samplingmeta-heuristicsuniform samplingpermutation space

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Deterministic scheduling theory in operations research (90B35) Irregularities of distribution, discrepancy (11K38)

Cites Work

• Quasi-Random Sequences and Their Discrepancies
• The String-to-String Correction Problem
• Encyclopedia of Distances
• Uniform Design: Theory and Application
• A search space analysis of the job shop scheduling problem
• Quasi-random initial population for genetic algorithms
• Van der Corput sequences, Kakutani transforms and one-dimensional numerical integration
• On the optimal Halton sequence
• Flow shop scheduling problem with conflict graphs
• Star discrepancy subset selection: problem formulation and efficient approaches for low dimensions
• The single line moving target traveling salesman problem with release times
• Quasi random resampling designs for multiple frame surveys

This page was built for publication: A uniform sampling method for permutation space

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