Journal: Oper. Res. Lett.

Volume 42, Issue 8

489 -- 494Lan Yi, Xianping Wu, Xun Li, Xiangyu Cui. A mean-field formulation for optimal multi-period mean-variance portfolio selection with an uncertain exit time
495 -- 499Stefan Hougardy. On the integrality ratio of the subtour LP for Euclidean TSP
500 -- 504Bertrand Hellion, Fabien Mangione, Bernard Penz. A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows
505 -- 508Behzad Hezarkhani, Marco Slikker, Tom Van Woensel. On characterization of the core of lane covering games via dual solutions
509 -- 513Peng Wu, Xiuli Chao, Jian Chen. On the replenishment policy considering less expensive but non-committed supply
514 -- 521Debdas Ghosh, Debjani Chakraborty. A new Pareto set generating method for multi-criteria optimization problems
522 -- 526A. Mahmodinejad, D. Foroutannia. Piecewise equitable efficiency in multiobjective programming
527 -- 531Chihoon Lee, Amy R. Ward. Optimal pricing and capacity sizing for the GI/GI/1 queue
532 -- 538Daniel Zhuoyu Long, Jin Qi. Distributionally robust discrete optimization with Entropic Value-at-Risk
539 -- 544Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo. Two dimensional load balancing
545 -- 548Xiaoming Yan, Yong Wang. Optimality of two-sided (σ, Σ) policy in capacity expansion problem
549 -- 552Karen Aardal, Pierre Le Bodic. Approximation algorithms for the transportation problem with market choice and related models
553 -- 557Jean Bertrand Gauthier, Jacques Desrosiers, Marco E. Lübbecke. Decomposition theorems for linear programs
558 -- 560Shmuel Onn. Robust integer programming

Volume 42, Issue 6-7

379 -- 382Jin Xu, Jianghua Zhang, Jianliang Wu. Quantity strategies in economic networks
383 -- 387Guo-ji Tang, Nan-Jing Huang. Rate of convergence for proximal point algorithms on Hadamard manifolds
388 -- 393Zhenghua Long, Jiheng Zhang. Convergence to equilibrium states for fluid models of many-server queues with abandonment
394 -- 397Jeremy Chen. Weighing the "heaviest" Polya urn
398 -- 0Didier Aussel, Joydeep Dutta. Addendum to "Generalized Nash equilibrium problem, variational inequality and quasiconvexity" [Oper. Res. Letters 36 (4) (2008) 461-464]
399 -- 403Li Jiang, Zhongyuan Hao. On the value of information sharing and cooperative price setting
404 -- 408Stephen E. Wright, James J. Rohal. Solving the continuous nonlinear resource allocation problem with an interior point method
409 -- 413Jim (Junmin) Shi, Yao Zhao. Component commonality under no-holdback allocation rules
414 -- 417Peiyu Luo, Lihui Bai, Jiang Zhang, Ryan Gill. A computational study on fill rate expressions for single-stage periodic review under normal demand and constant lead time
418 -- 423Avishai Mandelbaum, Petar Momcilovic. Performance-based routing
424 -- 428Timm Oertel, Christian Wagner, Robert Weismantel. Integer convex minimization by mixed integer linear optimization
429 -- 431Eugene A. Feinberg, Jefferson Huang, Bruno Scherrer. Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming
432 -- 437Victor Magron, Didier Henrion, Jean-Bernard Lasserre. Approximating Pareto curves using semidefinite relaxations
438 -- 443Behzad Hezarkhani, Wieslaw Kubiak, Bruce Hartman. Asymptotic behavior of optimal quantities in symmetric transshipment coalitions
444 -- 449Li Jiang, Zhongyuan Hao. Alleviating supplier's capital restriction by two-order arrangement
450 -- 454Rico Zenklusen. Connectivity interdiction
455 -- 457Yigal Gerchak, Dina Smirnov. Evaluating the effect of sub-optimality
458 -- 461Ward Whitt. Heavy-traffic limits for queues with periodic arrival processes
462 -- 465Sonika Arora, Neelima Gupta, Samir Khuller, Yogish Sabharwal, Swati Singhal. Facility location with red-blue demands
466 -- 472Mourad Baïou, Francisco Barahona. On a connection between facility location and perfect graphs
473 -- 477Kyle Y. Lin, Niall J. MacKay. The optimal policy for the one-against-many heterogeneous Lanchester model
478 -- 483Weining Kang. Existence and uniqueness of a fluid model for many-server queues with abandonment
484 -- 488Young-Soo Myung, Ilkyeong Moon. A network flow model for the optimal allocation of both foldable and standard containers

Volume 42, Issue 5

299 -- 306Andrew E. B. Lim, Poomyos Wimonkittiwat. Dynamic portfolio selection with market impact costs
307 -- 310Gábor Braun, Sebastian Pokutta. A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set
311 -- 318Ward Whitt. t/m/∞ queue with a sinusoidal arrival rate function
319 -- 324Guang Li, Paat Rusmevichientong. A greedy algorithm for the two-level nested logit model
325 -- 331Ji Hwan Cha, Maxim Finkelstein. On some conditional characteristics of hazard rate processes induced by external shocks
332 -- 336Shmuel Wimer, Doron Gluzer, Uri Wimer. Using well-solvable minimum cost exact covering for VLSI clock energy minimization
337 -- 342Yang Shen, Xin Zhang 0012, Tak Kuen Siu. Mean-variance portfolio selection under a constant elasticity of variance model
343 -- 347Oscar C. Vásquez. On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
348 -- 350Lin Chen, Deshi Ye, Guochuan Zhang. An improved lower bound for rank four scheduling
351 -- 354Ngo Dac Tan. Vertex disjoint cycles of different lengths in d-arc-dominated digraphs
355 -- 360Mauro Castelli, Leonardo Vanneschi. Genetic algorithm with variable neighborhood search for the optimal allocation of goods in shop shelves
361 -- 366Kazuo Murota, Akiyoshi Shioura. Exact bounds for steepest descent algorithms of L-convex function minimization
367 -- 373Retsef Levi, Georgia Perakis, Gonzalo Romero. A continuous knapsack problem with separable convex utilities: Approximation algorithms and applications
374 -- 377Uladzimir Rubasheuski, Johan Oppen, David L. Woodruff. Multi-stage scenario generation by the combined moment matching and scenario reduction method

Volume 42, Issue 4

251 -- 256Giovanni Andreatta, Luigi De Giovanni, Paolo Serafini. Optimal shift coloring of trees
257 -- 262Bara Kim, Jeongsim Kim. Optimal admission control for two station tandem queues with loss
263 -- 267Majid Taghavi, Kai Huang. Stochastic capacity expansion with multiple sources of capacity
268 -- 272Guillermo Cabrera G., Matthias Ehrgott, Andrew Mason, Andy Philpott. Multi-objective optimisation of positively homogeneous functions and an application in radiation therapy
273 -- 277Xiaobing Zhao, Xian Zhou. Copula-based dependence between frequency and class in car insurance with excess zeros
278 -- 283Chaoyue Zhao, Yongpei Guan. Extended formulations for stochastic lot-sizing problems
284 -- 289Nitin Gupta, Somesh Kumar. Stochastic comparisons of component and system redundancies with dependent components
290 -- 292René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge. Constant-factor approximations for Capacitated Arc Routing without triangle inequality
293 -- 298Jamol Pender. A Poisson-Charlier approximation for nonstationary queues

Volume 42, Issue 3

197 -- 202Jian Li, Tianlin Shi. A fully polynomial-time approximation scheme for approximating a sum of random variables
203 -- 207Eline De Cuypere, Koen De Turck, Dieter Fiems. A Maclaurin-series expansion approach to multiple paired queues
208 -- 212Seyoung Park, Bong-Gyu Jang. Optimal retirement strategy with a negative wealth constraint
213 -- 216Marco Sagliano. Performance analysis of linear and nonlinear techniques for automatic scaling of discretized control problems
217 -- 221Gail Gilboa-Freedman, Refael Hassin. Regulation under partial cooperation: The case of a queueing system
222 -- 225Edouard Bonnet, Vangelis Th. Paschos. Parameterized (in)approximability of subset problems
226 -- 230Wuhua Hu, Wee-Peng Tay. An integer linear programming approach for a class of bilinear integer programs
231 -- 233Anna Jaskiewicz, Janusz Matkowski, Andrzej S. Nowak. Generalised discounting in dynamic programming with unbounded returns
234 -- 237Matan Shnaiderman, Fouad El Ouardighi. The impact of partial information sharing in a two-echelon supply chain
238 -- 245Ilbin Lee, Marina A. Epelman, H. Edwin Romeijn, Robert L. Smith. Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space
246 -- 249Shiran Rachmilevitch. Efficiency-free characterizations of the Kalai-Smorodinsky bargaining solution

Volume 42, Issue 2

109 -- 112Oren Gal, Eilon Solan. Robust optimal strategies in Markov decision problems
113 -- 118Joseph Armel Momo Kenfack, Bertrand Tchantcho. On the non-emptiness of the one-core and the bargaining set of committee games
119 -- 122Arieh Gavious, Yizhaq Minchuk. Revenue in contests with many participants
123 -- 129Yonghui Huang, Zhongfei Li, Xianping Guo. Constrained optimality for finite horizon semi-Markov decision processes in Polish spaces
130 -- 131Eugene A. Feinberg, Jefferson Huang. The value iteration algorithm is not strongly polynomial for discounted dynamic programming
132 -- 136Nil Kamal Hazra, Asok K. Nanda. Some results on series and parallel systems of randomized components
137 -- 139Robert D. Carr, Giuseppe Lancia. Ramsey theory and integrality gap for the independent set problem
140 -- 144Attahiru Sule Alfa. Some decomposition results for a class of vacation queues
145 -- 149Gyoocheol Shim, Yong Hyun Shin. An optimal job, consumption/leisure, and investment policy
150 -- 155Pan Zhang, Yu Xiong, Zhongkai Xiong, Wei Yan. Designing contracts for a closed-loop supply chain under information asymmetry
156 -- 160João Gouveia, James Pfeiffer. i-cover problem
161 -- 165Huseyin Tunc, Onur A. Kilic, S. Armagan Tarim, Burak Eksioglu. A reformulation for the stochastic lot sizing problem with service-level constraints
166 -- 172André Berger, Alexander Grigoriev, Pinar Heggernes, Ruben van der Zwaan. Scheduling unit-length jobs with precedence constraints of small height
173 -- 179José R. Correa, Roger Lederman, Nicolás E. Stier Moses. Sensitivity analysis of markup equilibria in complementary markets
180 -- 185Bara Kim, Jeongsim Kim. x/M/c queue with impatient customers
186 -- 189R. Carvajal, Shabbir Ahmed, George L. Nemhauser, Kevin C. Furman, Vikas Goel, Y. Shao. Using diversification, communication and parallelism to solve mixed-integer linear programs
190 -- 195Annalisa Fabretti, Stefano Herzel, Mustafa Ç. Pinar. Delegated portfolio management under ambiguity aversion

Volume 42, Issue 1

1 -- 6Amir Beck, Marc Teboulle. A fast dual proximal gradient algorithm for convex minimization and applications
7 -- 11Erim Kardes. On discounted stochastic games with incomplete information on payoffs and a security application
12 -- 15Daniel Granot, Yigal Gerchak. An auction with positive externality and possible application to overtime rules in football, soccer, and chess
16 -- 20Amitabh Basu, Kipp Martin, Christopher Thomas Ryan. On the sufficiency of finite support duals in semi-infinite linear programming
21 -- 26Alix Munier Kordon, Djamal Rebaine. The coupled unit-time operations problem on identical parallel machines with respect to the makespan
27 -- 33Daniel Wei-Chung Miao, Xenos Chang-Shuo Lin, Wan-Ling Chao. Option pricing under jump-diffusion models with mean-reverting bivariate jumps
34 -- 40V. Jeyakumar, T. S. Pham, Guoyin Li. Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
41 -- 47Sila Çetinkaya, Fatih Mutlu, Bo Wei. On the service performance of alternative shipment consolidation policies
48 -- 52Vikas Vikram Singh, N. Hemachandra. A characterization of stationary Nash equilibria of constrained stochastic games with independent state processes
53 -- 57N. S. Walton. Two queues with non-stochastic arrivals
58 -- 63Jung Woo Baek, Ho Woo Lee, Se-Won Lee, Soohan Ahn. A workload factorization for BMAP/G/1 vacation queues under variable service speed
64 -- 69David Hirschmann. Optimal quality provision when reputation is subject to random inspections
70 -- 75Xin Geng, Woonghee Tim Huh, Mahesh Nagarajan. Sequential resource allocation with constraints: Two-customer case
76 -- 81Nelson A. Uhan. The complexity of egalitarian mechanisms for linear programming games
82 -- 84Alejandro Toriello, Nelson A. Uhan. Dynamic cost allocation for economic lot sizing games
85 -- 90S. S. Askar. Complex dynamic properties of Cournot duopoly games with convex and log-concave demand function
91 -- 96László A. Végh, Giacomo Zambelli. A polynomial projection-type algorithm for linear programming
97 -- 101Golbon Zakeri, D. Craigie, Andy Philpott, M. Todd. Optimization of demand response through peak shaving
102 -- 108Moshe Kress, Niall J. MacKay. Bits or shots in combat? The generalized Deitchman model of guerrilla warfare