Journal: Oper. Res. Lett.

Volume 40, Issue 6

425 -- 430Alain Bensoussan, Hongwei Long, Sandun Perera, Suresh P. Sethi. Impulse control with random reaction periods: A central bank intervention problem
431 -- 435Linwei Xin, Alexander Shapiro. Bounds for nested law invariant coherent risk measures
436 -- 439Alexander Shapiro. Time consistency of dynamic risk measures
440 -- 444Philippe Baptiste, Jacques Carlier, Alexander Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko. Integer preemptive scheduling on parallel machines
445 -- 449Sergei Chubanov, Erwin Pesch. An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand
450 -- 452Yury Makarychev. Simple linear time approximation algorithm for betweenness
453 -- 458Mohan Gopaladesikan, Nelson A. Uhan, Jikai Zou. A primal-dual algorithm for computing a cost allocation in the core of economic lot-sizing games
459 -- 461Shiran Rachmilevitch. Gradual negotiations and proportional solutions
462 -- 468Weibin Han, Hao Sun, Genjiu Xu. A new approach of cooperative interval games: The interval core and Shapley value revisited
469 -- 474Zsombor Z. Méder, János Flesch, R. Peeters. Optimal choice for finite and infinite horizons
475 -- 477Xianwei Zhou, Zhi-mi Cheng, Yan Ding, Fu-hong Lin. A optimal power control strategy based on network wisdom in wireless networks
478 -- 483Vincent Guigues, Claudia A. Sagastizábal. Exploiting the structure of autoregressive processes in chance-constrained multistage stochastic linear programs
484 -- 486Bernd Gärtner, Markus Sprecher. A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem
487 -- 491M. Park, K. Krishnamoorthy, S. Darbha, Phillip R. Chandler, Meir Pachter. State partitioning based linear program for stochastic dynamic programs: An invariance property
492 -- 497Ruxian Wang. Capacitated assortment and price optimization under the multinomial logit model
498 -- 502Chunyang Tong. Pricing schemes for congestion-prone service facilities
503 -- 505Lee K. Jones. Remarks on queue inference from departure data alone and the importance of the queue inference engine
506 -- 509Steven B. Kramer, Arjang A. Assad. Alternating priority versus FCFS scheduling in a two-class queueing system
510 -- 515Aylin Turhan, Murat Alanyali, David Starobinski. Optimal admission control in two-class preemptive loss systems
516 -- 520Xiao-song Ding, Ji-Hong Zhang, Xi Chen. A joint pricing and inventory control problem under an energy buy-back program
521 -- 528Martin Haugh, Andrew E. B. Lim. Linear-quadratic control and information relaxations
529 -- 536V. Jeyakumar, Guoyin Li. Exact SDP relaxations for classes of nonlinear semidefinite programming problems
537 -- 540Bara Kim, Jeongsim Kim. Exact tail asymptotics for the M/M/m retrial queue with nonpersistent customers
541 -- 545Amir Beck, Shoham Sabach. An improved ellipsoid method for solving convex differentiable optimization problems
546 -- 550Tal Raviv. The battery switching station scheduling problem
551 -- 553Dejian Tian, Xinli Suo. A note on convex risk statistic
554 -- 563Nan Chen, Zhengyu Huang. Brownian meanders, importance sampling and unbiased simulation of diffusion extremes
568 -- 572Sara Mattia. Separating tight metric inequalities by bilevel programming
573 -- 577Bo Zhang, Bert Zwart. Fluid models for many-server Markovian queues in a changing environment
578 -- 580José Neto. A simple finite cutting plane algorithm for integer programs

Volume 40, Issue 5

307 -- 312Yunan Liu, Ward Whitt. t+G/ queueing model experiencing periods of overloading
313 -- 318Vincent Guigues, Werner Römisch. SDDP for multistage stochastic linear programs based on spectral risk measures
319 -- 324Bram L. Gorissen, Dick den Hertog. Approximating the Pareto set of multiobjective linear programs via robust optimization
325 -- 328Jianqiang Cheng, Abdel Lisser. A second-order cone programming approach for linear programs with joint probabilistic constraints
329 -- 331Ping H. Huang, Kwei Tang. A constructive periodicity bound for the unbounded knapsack problem
332 -- 336Guo-ji Tang, Nan-Jing Huang. Strong convergence of a splitting proximal projection method for the sum of two maximal monotone operators
337 -- 341Joseph Cheriyan, Chenglong Zou. On orienting graphs for connectivity: Projective planes and Halin graphs
342 -- 348Stéphanie Vanhove, Veerle Fack. Route planning with turn restrictions: A computational experiment
349 -- 352T. C. E. Cheng, Hans Kellerer, Vladimir Kotov. Algorithms better than LPT for semi-online scheduling with decreasing processing times
353 -- 355Han Hoogeveen, Vincent T'Tindt. Minimizing the number of late jobs when the start time of the machine is variable
356 -- 359Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger. Another well-solvable case of the QAP: Maximizing the job completion time variance
360 -- 363Walter Kern, Xian Qiu. Integrality gap analysis for bin packing games
364 -- 369Mingming Leng, Mahmut Parlar. Transfer pricing in a multidivisional firm: A cooperative game analysis
370 -- 373Hamideh Esfahani, Luca Lambertini. The profitability of small horizontal mergers with nonlinear demand functions
374 -- 377Tomohiko Kawamori, Ming Hsin Lin. The way of offering vertically differentiated airline services
378 -- 384Jianwen Luo, Qinhong Zhang. Trade credit: A new mechanism to coordinate supply chain
385 -- 389Xin Chen, Peng Hu. Joint pricing and inventory management with deterministic demand and costly price adjustment
390 -- 397Ayse Akbalik, Christophe Rapine. Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
398 -- 403Xiaoming Yan. Capacity competition under random yield
404 -- 408Zhiyuan Chen, Xiaoying Liang, Haifeng Wang, Houmin Yan. Inventory rationing with multiple demand classes: The case of group buying
409 -- 410Steven M. Shechter. Efficient solutions for a class of optimal stopping problems
411 -- 415Steven M. Shechter, Woonghee Tim Huh, Anyu Slofstra. Simultaneous testing of multicharacteristic components
416 -- 421Ji Hwan Cha, Maxim Finkelstein. Stochastic analysis of preventive maintenance in heterogeneous populations
422 -- 423Shyam S. Chandramouli, Martin B. Haugh. Erratum to "A unified approach to multiple stopping and duality" [Oper. Res. Lett. (2012)]

Volume 40, Issue 4

223 -- 229Michael P. Atkinson, Moshe Kress. On popular response to violence during insurgencies
230 -- 234Ward Whitt. Extending the FCLT version of L=λW
235 -- 238Dieter Fiems, Koen De Turck. The mean queue content of discrete-time queues with zero-regenerative arrivals
239 -- 243Yutaka Sakuma, Atsushi Inoie. Stationary distribution of a multi-server vacation queue with constant impatient times
244 -- 249Michael N. Katehakis, Kartikeya S. Puranam. On optimal bidding in sequential procurement auctions
250 -- 257Yanyi Xu, Arnab Bisi. Wholesale-price contracts with postponed and fixed retail prices
258 -- 264Shyam S. Chandramouli, Martin B. Haugh. A unified approach to multiple stopping and duality
265 -- 271Fabien Cornillier, José Eduardo Pécora Jr., Vincent Charles. A variable depth search branching
272 -- 275Stasys Jukna, Georg Schnitger. Cutting planes cannot approximate some integer programs
276 -- 281Jochen Gorski, Kathrin Klamroth, Stefan Ruzika. Generalized multiple objective bottleneck problems
282 -- 286Trivikram Dokka, Anastasia Kouvela, Frits C. R. Spieksma. Approximating the multi-level bottleneck assignment problem
287 -- 291Cyriel Rutten, Diego Recalde, Petra Schuurman, Tjark Vredeveld. Performance guarantees of jump neighborhoods on restricted related parallel machines
292 -- 297Ernst Althaus, Daniel Dumitriu. Certifying feasibility and objective value of linear programs
298 -- 302Amir Beck, Yoel Drori, Marc Teboulle. A new semidefinite programming relaxation scheme for a class of quadratic matrix problems
303 -- 305Haibin Chen, Yiju Wang, Hongge Zhao. Finite convergence of a projected proximal point algorithm for the generalized variational inequalities
306 -- 0Martin I. Reiman, Qiong Wang. Erratum to "A stochastic program based lower bound for assemble-to-order inventory systems" [Oper. Res. Lett. 40(2) (2012) 89-95]

Volume 40, Issue 3

149 -- 152Laura Galli, Konstantinos Kaparis, Adam N. Letchford. Complexity results for the gap inequalities for the max-cut problem
153 -- 158Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser. Mixed integer linear programming formulations for probabilistic constraints
159 -- 164Matteo Fischetti, Michele Monaci. Branching on nonchimerical fractionalities
165 -- 171Utz-Uwe Haus, Frank Pfeuffer. Split cuts for robust mixed-integer optimization
172 -- 174Tomonari Kitahara, Shinji Mizuno. On the number of solutions generated by the dual simplex method
175 -- 179Sebastián Marbán, Ruben van der Zwaan, Alexander Grigoriev, Benjamin Hiller, Tjark Vredeveld. Dynamic pricing problems with elastic demand
180 -- 184Daniel Cole, Sungjin Im, Benjamin Moseley, Kirk Pruhs. Speed scaling for stretch plus energy
185 -- 189Tatsuaki Kimura, Hiroyuki Masuyama, Yutaka Takahashi. Heavy-traffic asymptotics for stationary GI/G/1-type Markov chains
190 -- 194O. Fogelklou, Takis Konstantopoulos, W. Tucker. On the global stability of a peer-to-peer network model
195 -- 202Wanmo Kang, Kyoung-Kuk Kim, Hayong Shin. Denoising Monte Carlo sensitivity estimates
203 -- 206Samuel Burer, Hongbo Dong. Representing quadratically constrained quadratic programs as generalized copositive programs
207 -- 211Martin Branda. Sample approximation technique for mixed-integer stochastic programming problems with several chance constraints
212 -- 217Tiago Pascoal Filomena, Miguel A. Lejeune. Stochastic portfolio optimization with proportional transaction costs: Convex reformulations and computational experiments
218 -- 222Laijun Zhao, Ying Qian, Rongbing Huang, Changmin Li, Jian Xue, Yue Hu. Model of transfer tax on transboundary water pollution in China's river basin

Volume 40, Issue 2

69 -- 73Qie He, Shabbir Ahmed, George L. Nemhauser. Sell or Hold: A simple two-stage stochastic combinatorial optimization problem
74 -- 77Alexandre S. Freire, Eduardo Moreno, Juan Pablo Vielma. An integer linear programming approach for bilinear integer programming
78 -- 83Georgia Perakis, Wei Sun. Price of anarchy for supply chains with partial positive externalities
84 -- 88Francesc Llerena. The pairwise egalitarian solution for the assignment game
89 -- 95Martin I. Reiman, Qiong Wang. A stochastic program based lower bound for assemble-to-order inventory systems
96 -- 98Meng Li, Jun Zhang. Does inventory pooling improve customer service levels?
99 -- 107Xiuli Chao, Baimei Yang, Yifan Xu. Dynamic inventory and pricing policy in a capacitated stochastic inventory system with fixed ordering cost
108 -- 113Edwin K. P. Chong, Scott A. Miller, Jason Adaska. On Bellman's principle with inequality constraints
114 -- 122F. Zeynep Sargut, Lian Qi. Analysis of a two-party supply chain with random disruptions
123 -- 127Hangjun Yang. Impact of discounting and competition on benefit of decentralization with strategic customers
128 -- 133Jonathan Y. Li, Roy H. Kwon. Market price-based convex risk measures: A distribution-free optimization approach
134 -- 139M. El Maghri, B. Radi. Asymptotical good behavior on inequalities with completely approximate K-T concept
140 -- 143Xiaodong Fan, Caozong Cheng, Haijun Wang. Density of stable convex semi-infinite vector optimization problems
144 -- 147Majid Soleimani-Damaneh. On a basic definition of returns to scale

Volume 40, Issue 1

1 -- 0Jan Karel Lenstra. Editorial
2 -- 5Martina Gancarova, Michael J. Todd. A robust robust optimization result
6 -- 11Huseyin Onur Mete, Zelda B. Zabinsky. Pattern Hit-and-Run for sampling efficiently on polytopes
12 -- 14Alejandro Toriello, George L. Nemhauser. The value function of an infinite-horizon single-item lot-sizing problem
15 -- 19Binyuan Chen, Simge Küçükyavuz, Suvrajeet Sen. A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
20 -- 24Sam D. Allen, Edmund K. Burke, Jakub Marecek. A space-indexed formulation of packing boxes into a larger box
25 -- 30Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho. On the extremality of maximal dual feasible functions
31 -- 35Samuel Fiorini, Gwenaël Joret. Approximating the balanced minimum evolution problem
36 -- 38Bodo Manthey. Multi-criteria TSP: Min and max combined
39 -- 45Tal Raviv, Mor Kaspi. The locomotive fleet fueling problem
46 -- 51Weifen Zhuang, Michael Z. F. Li. Dynamic pricing with two revenue streams
52 -- 55Gustavo Bergantiños, María Gómez-Rúa, Natividad Llorca, Manuel A. Pulido, Joaquín Sánchez-Soriano. A cost allocation rule for k-hop minimum cost spanning tree problems
56 -- 60Konstantin Avrachenkov, Laura Cottatellucci, Lorenzo Maggi. Algorithms for uniform optimal strategies in two-player zero-sum stochastic games with perfect information
61 -- 68Ling-Chieh Kung, Ying-Ju Chen. The resource allocation problem for demand forecasting and performance measurement