We propose a generic algorithm for numerically accurate likelihood evaluation of a broad class of spatial models characterized by a high-dimensional latent Gaussian process and non-Gaussian response variables. The class of models under consideration includes specifications for discrete choices,...

This book was motivated by the notion that some of the underlying difficulty in challenging instances of graph-based problems (e.g., the Traveling Salesman Problem) may be “inherited” from simpler graphs which – in an appropriate sense – could be seen as “ancestors” of the given...

We investigate the robustness of existing methods to calibrate the Cheyette interest rate model to at-the-money swaption, caps and floors. Existing algorithms may fail, because they suffer from numerical instability of derivatives. Therefore, we apply derivative-free techniques and find that...

The procurement of transportation services via large-scale combinatorial auctions involves a couple of complex decisions whose outcome highly influences the performance of the tender process. This paper examines the shipper's task of selecting a subset of the submitted bids which efficiently...

Designing optimal products is one of the most critical activities for a firm to stay competitive. Except for genetic algorithms, previous approaches that solve the optimal product line design problem provide the decision maker with a single best solution. Furthermore, they assume a static...