This implements an abstract version of the default greedy algorithm for reduced basis and empirical interpolation basis generation. The actual implementation of the ...
We examine the problem of variable selection for high-dimensional sparse Cox models. We propose using a computationally efficient procedure, the Chebyshev greedy algorithm (CGA), to sequentially ...
In this paper, we study a warehouse-retailer network design (WRND) model that simultaneously makes the location, distribution, and warehouse-retailer echelon inventory replenishment decisions.
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback