Paul H. Randolph

Learn More
One major problem in combinatorial theory is to find a combination that will optimize a given objective function. However, for many real problems even with moderate requirements, no algorithm exists which can find an optimum in a livable span of time. This paper proposes that if the N! combinations are viewed as points in a sample space, then a Monte Carlo(More)
  • 1