An improved asymptotic analysis of the expected number of pivot steps required by the simplex algorithm Karl -Heinz Küfer OriginalPaper Pages: 147 - 170
On the inverse problem of minimum spanning tree with partition constraints Jianzhong ZhangZhenhong LiuZhongfan Ma OriginalPaper Pages: 171 - 187
Increasing and Lipschitz continuous minimizers in one-dimensional linear-convex systems without constraints: The continuous and the discrete case Karl HindererMichael Stieglitz OriginalPaper Pages: 189 - 204
Notes on equivalent stationary policies in Markov decision processes with total rewards Eugene A. FeinbergIsaac M. Sonin OriginalPaper Pages: 205 - 221
A note on asymptotics of discounted value function and strong 0-discount optimality A. A. Yushkevich OriginalPaper Pages: 223 - 231
Discounted Bayesian search problems with unknown detection probabilities Thilo Liebig OriginalPaper Pages: 233 - 254
Accelerating Benders' decomposition for the capacitated facility location problem Paul Wentges OriginalPaper Pages: 267 - 290
