This paper studies the use of decomposition techniques to quickly find high-quality solutions to large-scale vehicle routing problems with time windows. It considers an adaptive d...
In this paper we study polynomial identity testing of sums of k read-once algebraic branching programs (Σk-RO-ABPs), generalizing the work of Shpilka and Volkovich [1, 2], who co...
We study a repeated newsvendor game with transshipments. In every period n retailers face a stochastic demand for an identical product and independently place their inventory orde...
Abstract Firms compete in supply functions when they offer a schedule of prices and quantities into a market; for example, this occurs in many wholesale electricity markets. We stu...
Iterative search margin based algorithm(Simba) has been proven effective for feature selection. However, it still has the following disadvantages: (1) the previously proposed model...