Journal: Oper. Res. Lett.

Volume 39, Issue 6

401 -- 405Onno J. Boxma, Offer Kella, K. M. Kosinski. Queue lengths and workloads in polling systems
406 -- 410Ashraf Al Daoud, Murat Alanyali, David Starobinski. On equilibrium analysis of acyclic multiclass loss networks under admission control
411 -- 413Shaul K. Bar-Lev, Ernst Schulte-Geers, Wolfgang Stadje. On the demand pooling anomaly in inventory theory
414 -- 418Amr Farahat, Georgia Perakis. On the efficiency of price competition
419 -- 422Luca Grosset, Paolo Roberti, Bruno Viscolani. A goodwill model with predatory advertising
423 -- 427Anke van Zuylen. An improved monotone algorithm for scheduling related machines with precedence constraints
428 -- 432Dries R. Goossens, Frits C. R. Spieksma. Breaks, cuts, and patterns
433 -- 436Martin Skutella, David P. Williamson. A note on the generalized min-sum set cover problem
437 -- 440Danny Z. Chen, Haitao Wang. Improved algorithms for path partition and related problems
441 -- 446L. Jones Tarcius Doss, P. Arathi. A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs
447 -- 451Salman Fadaei, MohammadAmin Fazli, MohammadAli Safari. Maximizing non-monotone submodular set functions subject to different constraints: Combined algorithms
452 -- 456Monique Laurent, Antonios Varvitsiotis. Computing the Grothendieck constant of some graph classes
457 -- 460Sebastian Pokutta, Andreas S. Schulz. Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvátal rank
461 -- 465Michael Souza, Adilson Elias Xavier, Carlile Lavor, Nelson Maculan. Hyperbolic smoothing and penalty techniques applied to molecular structure determination
466 -- 470Elvira Hernández, Luis Rodríguez-Marín. Locating minimal sets using polyhedral cones
471 -- 474George J. Kyparisis, Christos Koulamas. A note on equilibria for two-tier supply chains with a single manufacturer and multiple retailers

Volume 39, Issue 5

297 -- 300Laura Galli, Konstantinos Kaparis, Adam N. Letchford. Gap inequalities for non-convex mixed-integer quadratic programs
301 -- 304Adam N. Letchford, Sebastian Pokutta, Andreas S. Schulz. On the membership problem for the {0, 1/2}-closure
305 -- 309Sanjeeb Dash, Santanu S. Dey, Oktay Günlük. On mixed-integer sets with two integer variables
310 -- 317Daniel Baena, Jordi Castro. Using the analytic center in the feasibility pump
318 -- 322Lipu Zhang, Yinghong Xu. A full-Newton step interior-point algorithm based on modified Newton direction
323 -- 328Myoung-Ju Park, Sung-Pil Hong. Rank of Handelman hierarchy for Max-Cut
329 -- 337Ricardo Saraiva de Camargo, Gilberto de Miranda Jr., Ricardo Poley Martins Ferreira. A hybrid Outer-Approximation/Benders Decomposition algorithm for the single allocation hub location problem under congestion
338 -- 341Anand Subramanian, Eduardo Uchoa, Artur Alves Pessoa, Luiz Satoru Ochi. Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
342 -- 345Muhong Zhang. Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty
346 -- 351André Nichterlein, Michael Dom, Rolf Niedermeier. Aspects of a multivariate complexity analysis for Rectangle Tiling
352 -- 354Yongxi Cheng. An efficient randomized group testing procedure to determine the number of defectives
355 -- 358Moritz A. Drexl. An approximation algorithm for the k-Level Concentrator Location Problem
359 -- 362Hans Kellerer, Vladimir Kotov. A 3/2-approximation algorithm for 3/2-partitioning
363 -- 368Gaurav Singh, Andreas T. Ernst. Resource constraint scheduling with a fractional shared resource
369 -- 374Qingda Wei, Xianping Guo. Markov decision processes with state-dependent discount factors and unbounded rewards/costs
375 -- 379Zhan Pang. Optimal dynamic pricing and inventory control with stock deterioration and partial backordering
380 -- 384Antonio Di Crescenzo, Franco Pellerey. Stochastic comparisons of series and parallel systems with randomized independent components
385 -- 389Ulas Özen, Martin I. Reiman, Qiong Wang. On the core of cooperative queueing games
390 -- 396Dominic DiPalantino, Ramesh Johari, Gabriel Y. Weintraub. Competition and contracting in service industries
397 -- 399Shaojian Qu, Mark Goh, Felix T. S. Chan. Quasi-Newton methods for solving multiobjective optimization

Volume 39, Issue 4

231 -- 233James W. Boudreau. A note on the efficiency and fairness of decentralized matching
234 -- 240Alberto Del Pia, Christian Wagner, Robert Weismantel. A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
241 -- 245Manuel Abellanas, António Leslie Bajuelos, Ferran Hurtado, Inês Matos. Coverage restricted to an angle
246 -- 251C. Bautista-Santiago, José Miguel Díaz-Báñez, D. Lara, P. Pérez-Lantero, Jorge Urrutia, Inmaculada Ventura. Computing optimal islands
252 -- 254Alexander Grigoriev, Joris van de Klundert. A note on the integrality gap of an ILP formulation for the periodic maintenance problem
255 -- 259Uwe Schwiegelshohn. An alternative proof of the Kawaguchi-Kyan bound for the Largest-Ratio-First rule
260 -- 264Juho Kanniainen. Option pricing under joint dynamics of interest rates, dividends, and stock prices
265 -- 271Joan C. Micó, David Soler. The capacitated general windy routing problem with turn penalties
272 -- 277Yun Han Bae, Bara Kim, Bong Dae Choi, Jeongsim Kim. Tail asymptotic behaviour of resequencing buffer content for selective repeat ARQ
278 -- 282Divya Tiwari, Rahul Patil, Janat Shah. Unreliable newsboy problem with a forecast update
283 -- 288Gyoocheol Shim. Consumption/investment problem when the investment opportunity set can be enlarged by information gathering
289 -- 295Mei Choi Chiu, Yu Wai Lo, Hoi Ying Wong. Asymptotic expansion for pricing options for a mean-reverting asset with multiscale stochastic volatility

Volume 39, Issue 3

163 -- 171Andrew E. B. Lim, J. George Shanthikumar, Gah-Yi Vahn. Conditional value-at-risk in portfolio optimization: Coherent but fragile
172 -- 179Martin B. Haugh. A note on constant proportion trading strategies
180 -- 187Ji Hee Yoon, Bong-Gyu Jang, Kum-Hwan Roh. An analytic valuation method for multivariate contingent claims with regime-switching volatilities
188 -- 192András Prékopa, Kunikazu Yoda, Munevver Mine Subasi. Uniform quasi-concavity in probabilistic constrained stochastic programming
193 -- 197Edilson F. Arruda, Marcelo D. Fragoso. Time aggregated Markov decision processes via standard dynamic programming
198 -- 199Sanjeeb Dash, Oktay Günlük, Christian Raack. A note on the MIR closure and basic relaxations of polyhedra
200 -- 203Sebastian Pokutta, Gautier Stauffer. Lower bounds for the Chvátal-Gomory rank in the 0/1 cube
204 -- 207Gábor Braun, Sebastian Pokutta. Random half-integral polytopes
208 -- 212Gautier Stauffer. On the facets of the stable set polytope of quasi-line graphs
213 -- 217Yuri Faenza, Gianpaolo Oriolo, Claudia Snels. A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)
218 -- 223Zhou Xu, Liang Xu, Brian Rodrigues. An analysis of the extended Christofides heuristic for the k-depot TSP
224 -- 228Bara Kim, Jeongsim Kim. Higher moments of the waiting time distribution in M/G/1 retrial queues
229 -- 230Matthias Mnich. Book review

Volume 39, Issue 2

83 -- 87Alexander Shapiro. A dynamic programming approach to adjustable robust optimization
88 -- 91Tomonari Kitahara, Shinji Mizuno. Klee-Minty s LP and upper bounds for Dantzig s simplex method
92 -- 98Olivier Klopfenstein. Single-path routing of stochastic flows in networks
99 -- 102W. van Ackooij, René Henrion, A. Möller, R. Zorgati. On joint probabilistic constraints with Gaussian coefficient matrix
103 -- 108Qingna Li, Donghui Li. A projected semismooth Newton method for problems of calibrating least squares covariance matrix
109 -- 114V. Jeyakumar, G. Y. Li, G. M. Lee. A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
115 -- 117Toshihiro Matsumura, Takeshi Murooka, Akira Ogawa. Randomized strategy equilibrium in the action commitment game with costs of leading
118 -- 120Vladimir G. Deineko, Gerhard J. Woeginger. A well-solvable special case of the bounded knapsack problem
121 -- 126Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma. The split closure of a strictly convex body
127 -- 131James Ostrowski, Jeff Linderoth, Fabrizio Rossi, Stefano Smriglio. Solving large Steiner Triple Covering Problems
132 -- 137Edna Ayako Hoshino, Yuri Frota, Cid C. de Souza. A branch-and-price approach for the partition coloring problem
138 -- 143Halit Üster, Homarjun Agrahari. A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
144 -- 149Michael R. Wagner. Online lot-sizing problems with ordering, holding and shortage costs
150 -- 154Luis Martí, Jesús García, Antonio Berlanga, Carlos A. Coello Coello, José M. Molina. MB-GNG: Addressing drawbacks in multi-objective optimization estimation of distribution algorithms
155 -- 159Serkan Eryilmaz. Dynamic behavior of k-out-of-n: G systems
160 -- 161Zhen Wang, Donglei Du, Adriana Felicia Gabor, Dachuan Xu. Erratum to: An approximation algorithm for the k-level stochastic facility location problem [Oper. Res. Lett. 38(2010) 386-389]

Volume 39, Issue 1

1 -- 3Juan D. Moreno-Ternero. A coalitional procedure leading to a family of bankruptcy rules
4 -- 10Kwan Eng Wee, Ananth Iyer. Consolidating or non-consolidating queues: A game theoretic queueing model with holding costs
11 -- 16Xiuli He, Anand Krishnamoorthy, Ashutosh Prasad, Suresh P. Sethi. Retail competition and cooperative advertising
17 -- 21T. James Marshall, R. Mark Reesor. Forest of stochastic meshes: A new method for valuing high-dimensional swing options
22 -- 27Ye Lu, Asuman E. Ozdaglar, David Simchi-Levi. Stock repurchase with an adaptive reservation price: A study of the greedy policy
28 -- 31Harish Krishnan, Ralph A. Winter. On the role of revenue-sharing contracts in supply chains
32 -- 35Murat Firat, Gerhard J. Woeginger. Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
36 -- 39Antonio Frangioni, F. Pascali, Maria Grazia Scutellà. Static and dynamic routing under disjoint dominant extreme demands
40 -- 43Pablo Pavón-Mariño, Michal Pióro. On total traffic domination in non-complete graphs
44 -- 48Pedro Machado Manhães de Castro, Olivier Devillers. On the asymptotic growth rate of some spanning trees embedded in R:::d:::
49 -- 52Oleg V. Shylo, Oleg A. Prokopyev, Jayant Rajgopal. On algorithm portfolios and restart strategies
53 -- 56J. C. M. Keijsper, Rudi Pendavingh. Convex minization over Z:::2:::
57 -- 61Ronny Luss, Marc Teboulle. Convex approximations to sparse PCA via Lagrangian duality
62 -- 66Igor Averbakh, Yun-Bin Zhao. Robust univariate spline models for interpolating interval data
67 -- 73Chi-Jen Lin. Determining Type II sensitivity ranges of the fractional assignment problem
74 -- 77Ruiwei Jiang, Yongpei Guan. An O(N:::2:::)-time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times
78 -- 82Chao Zhang. Existence of optimal solutions for general stochastic linear complementarity problems