Journal: Oper. Res. Lett.

Volume 37, Issue 6

375 -- 378Manoel B. Campêlo, Gérard Cornuéjols. Stable sets, corner polyhedra and the Chvátal closure
379 -- 383Michele Conforti, Giacomo Zambelli. The mixing set with divisible capacities: A simple approach
384 -- 386Ravi Kannan, Luis Rademacher. Optimization of a convex program with a polynomial perturbation
387 -- 391Jonathan P. Caulkins, Gustav Feichtinger, Dieter Grass, Gernot Tragler. Optimal control of terrorism and global reputation: A case study with novel threshold behavior
392 -- 398Christian H. Christiansen, Jens Lysgaard, Sanne Wøhlk. A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands
399 -- 404Chung-Yee Lee, Xiangtong Qi. Vehicle scheduling with combinable delivery and pickup operations
405 -- 410Nodari Vakhania. Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs
411 -- 414Guangwu Liu, L. Jeff Hong. Revisit of stochastic mesh method for pricing American options
415 -- 419Arnab Basu, Mrinal K. Ghosh. Asymptotic analysis of option pricing in a Markov modulated market
420 -- 424Pengfei Guo, John J. Liu, Yulan Wang. Intertemporal service pricing with strategic customers
425 -- 429Alain Bensoussan, Anshuman Chutani, Suresh P. Sethi. Optimal cash management under uncertainty
430 -- 432Ying-Ju Chen. Monotonicity in the stock competition game with consumer search
433 -- 437Kevin H. Shang, Sean X. Zhou. A simple heuristic for echelon (r, nQ, T) policies in serial supply chains
438 -- 442Josep Freixas, María Albina Puente. Consecutive expansions of k-out-of-n systems
443 -- 446Ju-liang Zhang, Chung-Yee Lee, Jian Chen. Inventory control problem with freight cost and stochastic demand
447 -- 450Qiang Zhen, Charles Knessl. On sojourn times in the finite capacity M/M/1 queue with processor sharing

Volume 37, Issue 5

299 -- 302David J. Aldous, Colin McDiarmid, Alex D. Scott. Uniform multicommodity flow through the complete graph with random edge-capacities
303 -- 306Arie Tamir. New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems
307 -- 311Predrag R. Jelenkovic, Ana Radovanovic. Asymptotic optimality of the static frequency caching in the presence of correlated requests
312 -- 316Tolga Tezcan. Instability of FIFO in a simple queueing system with arbitrarily low loads
317 -- 321Xianping Guo, XinYuan Song, Junyu Zhang. Bias optimality for multichain continuous-time Markov decision processes
322 -- 326Xiaoming Yan, Ke Liu. An inventory system with two suppliers and default risk
327 -- 332Michael Z. F. Li, Weifen Zhuang. Risk-sensitive dynamic pricing for a single perishable product
333 -- 338Yuichi Nagata, Olli Bräysy. A powerful route minimization heuristic for the vehicle routing problem with time windows
339 -- 344MohammadHossein Bateni, Mohammad Taghi Hajiaghayi. A note on the subadditive network design problem
345 -- 350Attila Bernáth, Tamás Király. Covering skew-supermodular functions by hypergraphs of minimum total size
351 -- 355Nicola Apollonio, Massimiliano Caramia. A superclass of Edge-Path-Tree graphs with few cliques
356 -- 358Peter Szabó. A short note on the weighted sub-partition mean of integers
359 -- 364Bernard Fortz, Michael Poss. An improved Benders decomposition applied to a multi-layer network design problem
365 -- 367Gerardo Berbeglia. The counting complexity of a simple scheduling problem
368 -- 374Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng. Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness

Volume 37, Issue 4

225 -- 229Zhixin Liu. Complexity of core allocation for the bin packing game
230 -- 238Paat Rusmevichientong, Zuo-Jun Max Shen, David B. Shmoys. A PTAS for capacitated sum-of-ratios optimization
239 -- 244Nir Halman, Chung-Lun Li, David Simchi-Levi. Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
245 -- 249Carol A. Meyers, Andreas S. Schulz. Integer equal flows
250 -- 254Fatma Kilinç-Karzan, Alejandro Toriello, Shabbir Ahmed, George L. Nemhauser, Martin W. P. Savelsbergh. Approximating the stability region for binary mixed-integer programs
255 -- 260Emilie Danna, David L. Woodruff. How to select a small set of diverse solutions to mixed integer programming problems
261 -- 264Paolo Detti, Cor A. J. Hurkens, Alessandro Agnetis, Gianfranco Ciaschetti. Optimal packet-to-slot assignment in mobile telecommunications
265 -- 268Kurtulus B. Öner, Gudrun P. Kiesmüller, G. J. van Houtum. Monotonicity and supermodularity results for the Erlang loss system
269 -- 272Derek R. Atkins, Xuan Zhao. On the modeling of demand spill for a stochastic demand system under competition
273 -- 279Seray Aydin, Yalçin Akçay, Fikri Karaesmen. On the structural properties of a discrete-time single product revenue management problem
280 -- 284Murat Kurt, Lisa M. Maillart. Structured replacement policies for a Markov-modulated shock model
285 -- 289Demet Batur, David Goldsman, Seong-Hee Kim. An improved standardized time series Durbin-Watson variance estimator for steady-state simulation
290 -- 294Bernardetta Addis, Werner Schachinger. Improved bounds for interatomic distance in Morse clusters
295 -- 298E. Miglierina, E. Molho. Sectionwise connected sets in vector optimization

Volume 37, Issue 3

143 -- 147Alexander Shapiro. On a time consistency concept in risk averse multistage stochastic programming
148 -- 154Ulas Özen, Marco Slikker, Henk Norde. A general framework for cooperation under uncertainty
155 -- 158Deeparnab Chakrabarty, Nikhil R. Devanur. On competitiveness in uniform utility allocation markets
159 -- 162Karthik S. Gurumoorthy, Arunava Banerjee, Anand Paul. Dynamics of 2-worker bucket brigade assembly line with blocking and instantaneous walk-back
163 -- 167Ning Cai, Nan Chen, Xiangwei Wan. Pricing double-barrier options under a flexible jump diffusion model
168 -- 170Olga Gluchshenko, Horst W. Hamacher, Arie Tamir. An optimal O(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width
171 -- 175P. M. Dearing, Christiane R. Zeck. A dual algorithm for the minimum covering ball problem in R:::n:::
176 -- 180Markus Bläser, L. Shankar Ram, Maxim Sviridenko. Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
181 -- 186Qiaoming Han, Abraham P. Punnen, Yinyu Ye. An edge-reduction algorithm for the vertex cover problem
187 -- 191M. Selim Akturk, Alper Atamtürk, Sinan Gurel. A strong conic quadratic reformulation for machine-job assignment with controllable processing times
192 -- 196A. Agra, Luis Gouveia, Cristina Requejo. Extended formulations for the cardinality constrained subtree of a tree problem
197 -- 200Maria Grazia Scutellà. On improving optimal oblivious routing
201 -- 205Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott. Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks
206 -- 210Antonio Frangioni, Claudio Gentile. A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
211 -- 214Patrice Marcotte, D. L. Zhu. Existence and computation of optimal tolls in multiclass network equilibrium problems
215 -- 218Luce Brotcorne, Saïd Hanafi, Raïd Mansi. A dynamic programming algorithm for the bilevel knapsack problem
219 -- 223Mehdi Dehghan, Masoud Hajarian. Convergence of SSOR methods for linear complementarity problems

Volume 37, Issue 2

71 -- 74Fernanda Salazar, Martin Skutella. Single-source k-splittable min-cost flows
75 -- 79Joanna Bauer, Dag Haugland, Di Yuan. A fast local search method for minimum energy broadcast in wireless ad hoc networks
80 -- 82Christian Eggermont, Cor A. J. Hurkens, Maciej Modelski, Gerhard J. Woeginger. The hardness of train rearrangements
83 -- 84Christian Engels, Bodo Manthey. Average-case approximation ratio of the 2-opt algorithm for the TSP
85 -- 88Wei Yu, Zhaohui Liu. Vehicle routing problems on a line-shaped network with release time constraints
89 -- 92Ling Gai, Guochuan Zhang. Hardness of lazy packing and covering
93 -- 96József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt. Improved analysis of an algorithm for the coupled task problem with UET jobs
97 -- 101Guosong Yu, Guochuan Zhang. Scheduling with a minimum number of machines
102 -- 106Wilco van den Heuvel, Albert P. M. Wagelmans. A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters
107 -- 110Dachuan Xu, Ruichun Yang. A cost-sharing method for an economic lot-sizing game
111 -- 113Kyungsik Lee, Kyungchul Park, Sungsoo Park. A compact formulation of the ring loading problem with integer demand splitting
114 -- 116Lizhi Wang. Cutting plane algorithms for the inverse mixed integer linear programming problem
117 -- 122Changsheng Zhang, Jiaxu Ning, Shuai Lu, Dantong Ouyang, Tienan Ding. A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization
123 -- 126Mathieu Tracol. Fast convergence to state-action frequency polytopes for MDPs
127 -- 134Ning Cai. On first passage times of a hyper-exponential jump diffusion process
135 -- 141Roberto Tadei, Nicoletta Ricciardi, Guido Perboli. The stochastic p-median problem with unknown cost probability distribution

Volume 37, Issue 1

1 -- 6Amir Beck, Aharon Ben-Tal. Duality in robust optimization: Primal worst equals dual best
7 -- 10Archis Ghate, Robert L. Smith. Characterizing extreme points as basic feasible solutions in infinite linear programs
11 -- 15David Applegate, Robert E. Bixby, Vasek Chvátal, William Cook, Daniel Espinoza, Marcos Goycoolea, Keld Helsgaun. Certification of an optimal TSP tour through 85, 900 cities
16 -- 20Pasquale Avella, Maurizio Boccia, Igor Vasil ev. Computational experience with general cutting planes for the Set Covering problem
21 -- 22Giacomo Zambelli. On degenerate multi-row Gomory cuts
23 -- 26Jochen Gorski, Stefan Ruzika. On k
27 -- 31Nebojsa Gvozdenovic, Monique Laurent, Frank Vallentin. Block-diagonal semidefinite programming hierarchies for 0/1 programming
32 -- 36Céline Gicquel, Michel Minoux, Yves Dallery. On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
37 -- 42David Soler, José Albiach, Eulalia Martínez. A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows
43 -- 46Amr Farahat, Georgia Perakis. Profit loss in differentiated oligopolies
47 -- 50Chia-Li Wang, Ronald W. Wolff. Loss probability properties in retrial queues
51 -- 55Yair Carmon, Adam Shwartz. Markov decision processes with exponentially representable discounting
56 -- 60Xiaohu Li, Rongfang Yan, Ming J. Zuo. Evaluating a warm standby system with components having proportional hazard rates
61 -- 64Elvira Hernández, Luis Rodríguez-Marín, Miguel Sama. Some equivalent problems in set optimization
65 -- 66Jaya Singhal, Kalyan Singhal. On the noniterative multiproduct multiperiod production planning method
67 -- 68Ruud H. Teunter. Note on the fill rate of single-stage general periodic review inventory systems
69 -- 0Yasemin Serin. Comments on: A policy improvement method for constrained average Markov decision processes [ORL 35 (2007) 434-438]