Journal: Oper. Res. Lett.

Volume 43, Issue 2

123 -- 125Sylvain Béal, Eric Rémila, Philippe Solal. Decomposition of the space of TU-games, Strong transfer invariance and the Banzhaf value
126 -- 131Marco Locatelli. Some results for quadratic problems with one or two quadratic constraints
132 -- 136Javiera Barrera, Héctor Cancela, Eduardo Moreno. Topological optimization of reliable networks under dependent failures
137 -- 142Zijun Hao, Zhongping Wan, Xiaoni Chi. A power penalty method for second-order cone linear complementarity problems
143 -- 147Bogumil Kaminski. Refined knowledge-gradient policy for learning probabilities
148 -- 150Debapriya Sen, Giorgos Stamatopoulos. When an inefficient competitor makes higher profit than its efficient rival
151 -- 160Seungbeom Kim, Woonghee Tim Huh, Sriram Dasu. Pre-announced posted pricing scheme: Existence and uniqueness of equilibrium bidding strategy
161 -- 164Kanstantsin Pashkovich, Stefan Weltge. Hidden vertices in extensions of polytopes
165 -- 171Jerzy Kamburowski. On the distribution-free newsboy problem with some non-skewed demands
172 -- 176Fabien Cornillier, Vincent Charles. Measuring the attractiveness of academic journals: A direct influence aggregation model
177 -- 182Ying-Ju Chen. Optimal dynamic pricing for sponsored search advertising
183 -- 188M. Kayid, S. Izadkhah. A new extended mixture model of residual lifetime distributions
189 -- 194Sumit Kunnumkal. On upper bounds for assortment optimization under the mixture of multinomial logit models
195 -- 198Jiantian Wang, Henry Laniado. On likelihood ratio ordering of parallel system with two exponential components
199 -- 202Iskander Aliev. On the lattice programming gap of the group problems
203 -- 208HoChang Lee, Dong Won Seo. Explicit expressions for moments of waiting times in Poisson driven deterministic two-node tandem queues with blocking
209 -- 214Yoel Drori, Shoham Sabach, Marc Teboulle. A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
215 -- 217Shabbir Ahmed. Corrigendum to "A scenario decomposition algorithm for 0-1 stochastic programs" [Oper. Res. Lett. 41(6) (2013) 565-569]