Abstract: The Nelder-Mead simplex method is a well-known algorithm enabling the minimization of functions that are not available in closed-form and that need not be differentiable or convex.
Abstract: With the challenge of making online decisions in the face of escalating losses, the vehicle routing problem in forest fire-fighting places great emphasis on the computing efficiency of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results