A uniform sampling method for permutation space

DOI10.1007/S10479-024-06039-9MaRDI QIDQ6588515zbMATH OpenFDO

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)

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)

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

Cites work

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

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)