A More Portable Fortran Random Number Generator
From MaRDI portal
Cited in
(41)- Numerical evaluation of a multi-stream pseudo-random number generator
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- Qualitative and asymptotic performance of SNP density estimators
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Some comments on computer implementation of random number generators
- The development and testing of a new composite random number generator
- A note on the information content of a consistent pairwise comparison judgment matrix of an AHP decision maker
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- A GRASP for the biquadratic assignment problem
- On the expected optimal value of random assignment problems: Experimental results and open questions
- Lower bounds for the quadratic assignment problem
- Decomposition with simulated division for efficiently generating random numbers
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- A comparative study of some pseudorandom number generators
- Numerical aspects of a likelihood ratio test statistic for cointegrating rank
- Portable random number generators.
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Construction of polynomials that are orthogonal with respect to a discrete bilinear form
- Pseudotable methods for the analysis of 2 2 tables
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
- High-dimensional maximum marginal likelihood item factor analysis by adaptive quadrature
- GENGUB: A generator for linear programs with generalized upper bound constraints
- Constrained derivative-free optimization on thin domains
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
- A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure
- Finding the best portable congruential random number generators
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
- Statistical inference in nonstationary markov models with embedded explanatory variables
- Algorithm 616: fast computation of the Hodges-Lehmann location estimator
- Random number generators for microcomputers
- Improving ultimate convergence of an augmented Lagrangian method
- An exhaustive analysis of prime modulus multiplicative congruential random number generators with modulus smaller than 215
- Randomized heuristics for the Max-Cut problem
- Adaptive memory in multistart heuristics for multicommodity network design
- CA3D: A Monte Carlo code to simulate 3D buffered diffusion of ions in sub-membrane domains
- Estimation and goodness-of-fit in latent trait models: a comparison among theoretical approaches
- A generator of pseudo-random numbers sequences with a very long period
- Thoughts on pseudorandom number generators
- An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
- A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints
This page was built for publication: A More Portable Fortran Random Number Generator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4188744)
