Journal: Oper. Res. Lett.

Volume 41, Issue 6

565 -- 569Shabbir Ahmed. A scenario decomposition algorithm for 0-1 stochastic programs
570 -- 575Caroline Jagtenberg, Uwe Schwiegelshohn, Marc Uetz. Analysis of Smith's rule in stochastic machine scheduling
576 -- 580Daya Ram Gaur, Apurva Mudgal, Rishi Ranjan Singh. Routing vehicles to minimize fuel consumption
581 -- 585L. D. Servi. Analyzing social media data having discontinuous underlying dynamics
586 -- 591Guo-ji Tang, Nan-Jing Huang. An inexact proximal point algorithm for maximal monotone vector fields on Hadamard manifolds
592 -- 596Denis Cornaz, V. H. Nguyen. Kőnig's edge-colouring theorem for all graphs
597 -- 601Jianqiang Cheng, Abdel Lisser. A completely positive representation of 0-1 linear programs with joint probabilistic constraints
602 -- 606Eduardo Conde. A minmax regret median problem on a tree under uncertain locations of the demand points
607 -- 610Nicolas Lebert, Frédéric Meunier, Quentin Carbonneaux. mm-cake and three-player two-cake divisions
611 -- 614Timo Berthold. Measuring the impact of primal heuristics
615 -- 617Zhihan Gao. ts-t path graph Traveling Salesman Problem
618 -- 621Michael Pinedo, Josh Reed. The "least flexible job first" rule in scheduling and in queueing
622 -- 626Gabriela Tavares, Panos Parpas. On the information-based complexity of stochastic programming
627 -- 632Srikrishna Sridhar, Jeff Linderoth, James Luedtke. Locally ideal formulations for piecewise linear functions with indicator variables
633 -- 635Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger. Uniqueness in quadratic and hyperbolic 0-1 programming problems
636 -- 638A. Y. Golubin. On Pareto optimality conditions in the case of two-dimension non-convex utility space
639 -- 643Adam Kasperski, Pawel Zielinski. Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
644 -- 649Mauro Castelli, Stefano Beretta, Leonardo Vanneschi. A hybrid genetic algorithm for the repetition free longest common subsequence problem
650 -- 653Yunshu Gao, Ding Ma. Disjoint cycles with different length in 4-arc-dominated digraphs
654 -- 658Sercan Yildiz, Juan Pablo Vielma. Incremental and encoding formulations for Mixed Integer Programming
659 -- 663Vahid Sarhangian, Baris Balcioglu. A first passage time problem for spectrally positive Lévy processes and its application to a dynamic priority queue
664 -- 669Lauri Häme, Harri Hakula. Routing by ranking: A link analysis method for the constrained dial-a-ride problem
670 -- 674Chung-Yee Lee, Xi Li. Economic lot sizing: The capacity reservation model
675 -- 678F. Javier Martínez-de-Albéniz, Carles Rafels, Neus Ybern. A procedure to compute the nucleolus of the assignment game
679 -- 684Yan Shu, Sunil Chopra, Ellis L. Johnson, Sangho Shim. Binary group facets with complete support and non-binary coefficients
685 -- 689Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten. Critical edges for the assignment problem: Complexity and exact resolution
690 -- 693Peng Zhao, Ping-Shing Chan, Long Li, Hon Keung Tony Ng. On allocation of redundancies in two-component series systems
694 -- 700Sean W. Jewell, Yang Li, Traian A. Pirvu. Non-linear equity portfolio variance reduction under a mean-variance framework - A delta-gamma approach
701 -- 705Anja Fischer, Frank Fischer. Complete description for the spanning tree problem with one linearised quadratic term
706 -- 709Jun Wang, Feng Chen. Feedback saddle point solution of counterterror measures and economic growth game
710 -- 714Igor Averbakh, Mehmet Baysan. Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem
715 -- 718Anh Ninh, András Prékopa. The discrete moment problem with fractional moments
719 -- 725Jian Li, Xiaowei Xu. Optimality of (s, S)-policies in a dynamic pricing model with replenishment opportunities: A sample path approach
726 -- 729Thomas DuBois, Georges Allaert, Frank Witlox. Determining the fill rate for a periodic review inventory policy with capacitated replenishments, lost sales and zero lead time
730 -- 736Jose Blanchet, Michel Mandjes. Asymptotics of the area under the graph of a Lévy-driven workload process

Volume 41, Issue 5

421 -- 425Xing Gao, Weijun Zhong, Shue Mei. A differential game approach to information security investment under hackers' knowledge dissemination
426 -- 429Tomonari Kitahara, Shinji Mizuno, Jianming Shi. The LP-Newton method for standard form linear programming problems
430 -- 435Ningxiong Xu, Arthur F. Veinott Jr.. Sequential stochastic core of a cooperative stochastic programming game
436 -- 441Rodrigo A. Carrasco, Garud Iyengar, Cliff Stein. Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints
442 -- 444Pierre Bonami, Michele Conforti, Gérard Cornuéjols, Marco Molinaro, Giacomo Zambelli. Cutting planes from two-term disjunctions
445 -- 448George J. Kyparisis, Christos Koulamas. On index priority sequencing rules for scheduling with time-dependent job processing times
449 -- 453M. Gloria Fiestras-Janeiro, Ignacio García-Jurado, Ana Meca, Manuel A. Mosquera. A new cost allocation rule for inventory transportation systems
454 -- 456Bara Kim, Jeongsim Kim, Jerim Kim. Counterexamples to conjectures on discriminatory processor sharing and generalized processor sharing systems
457 -- 461Bo Zeng, Long Zhao. Solving two-stage robust optimization problems using a column-and-constraint generation method
462 -- 467Ali Kakhbod. Pay-to-bid auctions: To bid or not to bid
468 -- 473Oriol Tejada. Complements and substitutes in generalized multisided assignment economies
474 -- 476Omer Tamuz. A lower bound on seller revenue in single buyer monopoly auctions
477 -- 481Olga L. Ortiz, Alan L. Erera, Chelsea C. White III. State observation accuracy and finite-memory policy performance
482 -- 485Talat S. Genc, Georges Zaccour. Capacity investments in a stochastic dynamic game: Equilibrium characterization
486 -- 489Shmuel Wimer. On optimal flip-flop grouping for VLSI power minimization
490 -- 493Pengfei Guo, Mingming Leng, Yulan Wang. A fair staff allocation rule for the capacity pooling of multiple call centers
494 -- 498Alois Geyer, Michael Hanke, Alex Weissensteiner. Scenario tree generation and multi-asset financial optimization problems
503 -- 505Yu-Hsien Liao. The coincidences among the semicore and the dominance core
506 -- 510Lishun Zeng, Shinji Mizuno. Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks
511 -- 515Kyoung-Sook Moon, Hongjoong Kim. An adaptive averaging binomial method for option valuation
516 -- 520Martin Branda. Reformulations of input-output oriented DEA tests with diversification
521 -- 525Lingfei Li, Rafael Mendoza-Arriaga. Ornstein-Uhlenbeck processes time changed with additive subordinators and their applications in commodity derivative models
526 -- 529Susumu Cato. The first-order approach to the principal-agent problems under inequality aversion
530 -- 534Alper Sen. Performance bounds on optimal fixed prices
535 -- 539Yuhang Liu, Zizhuo Wang. A simple policy for multiple queues with size-independent service times
540 -- 544George J. Kyparisis, Christos Koulamas. Two-tier equilibria for supply chains with a single manufacturer and multiple asymmetric retailers
545 -- 551Xiaoming Yan, Yong Wang. A note on supplier diversification under random yield
552 -- 555Pedro J. de Rezende, Flávio Keidi Miyazawa, Anderson T. Sasaki. A PTAS for the disk cover problem of geometric objects
556 -- 558Hande Yaman. The splittable flow arc set with capacity and minimum load constraints
559 -- 561Naoyuki Kamiyama. A note on the serial dictatorship with project closures
562 -- 0Bo van der Rhee, Jack A. A. van der Veen, V. Venugopal, Vijayender Reddy Nalla. Corrigendum to "A new revenue sharing mechanism for coordinating multi-echelon supply chains" [Oper. Res. Lett. 38(4) (2010) 296-301]
563 -- 0Zhou Xu, Qi Wen. Corrigendum to "Approximation hardness of min-max tree covers" [Oper. Res. Lett. 38 (3) (2010) 169-173]

Volume 41, Issue 4

317 -- 320Anshul Gandhi, Mor Harchol-Balter. kM/G/k with staggered setup
321 -- 324Satoru Iwata, R. Ravi. Approximating max-min weighted T-joins
325 -- 330Esa Hyytiä, Samuli Aalto. To split or not to split: Selecting the right server with batch arrivals
331 -- 335Lilian Markenzon, Christina Fraga Esteves Maciel Waga, Paulo Renato da Costa Pereira, Clícia Valladares Peixoto Friedmann, Abel Rodolfo Garcia Lozano. An efficient representation of chordal graphs
336 -- 342András Frank, Csaba Király. Tree-compositions and orientations
343 -- 346Hans Kellerer, Vladimir Kotov. An efficient algorithm for bin stretching
347 -- 350Sebastian Pokutta, Mathieu Van Vyve. A note on the extension complexity of the knapsack polytope
351 -- 356Daniel F. Silva, Bo Zhang, Hayriye Ayhan. Optimal admission control for tandem loss systems with two stations
357 -- 362Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino. On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness
363 -- 365Long Wan, Jinjiang Yuan. Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
366 -- 369W. J. Hurley, Jack Brimberg. Game theory to a friend's rescue
370 -- 372Marco Locatelli. Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program
373 -- 376Ganesh Janakiraman, Seung Jae Park, Sridhar Seshadri, Qi Wu. New results on the newsvendor model and the multi-period inventory model with backordering
377 -- 380Zhi-mi Cheng, Xianwei Zhou, Yan Ding, Fu-hong Lin. A wisdom rate allocation scheme in wireless networks
381 -- 389John Gunnar Carlsson, Jianming Shi. A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension
390 -- 396Gianpaolo Oriolo, Laura Sanità, Rico Zenklusen. Network design with a discrete set of traffic matrices
397 -- 402Pengfei Guo, Refael Hassin. On the advantage of leadership in service pricing competition
403 -- 409He Huang, Hongyan Xu, Robert J. Kauffman, Ning Sun. Analyzing auction and bargaining mechanisms in e-procurement with supply quality risk
410 -- 414Erbao Cao, Yujie Ma, Can Wan, Mingyong Lai. Contracting with asymmetric cost information in a dual-channel supply chain
415 -- 420John N. Tsitsiklis, Yunjian Xu. Profit loss in Cournot oligopolies

Volume 41, Issue 3

211 -- 215Renaud Masson, Fabien Lehuédé, Olivier Péton. Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers
216 -- 219Ruyan Fu, T. C. E. Cheng, C. T. Ng, Jinjiang Yuan. An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
220 -- 225Joke Blom, Michel Mandjes. A large-deviations analysis of Markov-modulated infinite-server queues
226 -- 231Hamed Ghasemieh, Mohammad Ghodsi, Hamid Mahini, Mohammad Ali Safari. Pricing in population games with semi-rational agents
232 -- 237Ji Hwan Cha, Maxim Finkelstein. On history-dependent shock models
238 -- 240Wayne Goddard, Ewa Kubicka, Grzegorz Kubicki. An efficient algorithm for stopping on a sink in a directed graph
241 -- 245Asok K. Nanda, Nil Kamal Hazra. Some results on active redundancy at component level versus system level
246 -- 248Charles N. Glover, Michael O. Ball. Sparse Monge matrices arising from scheduling problems
249 -- 251Eugene A. Feinberg, Jefferson Huang. Strong polynomiality of policy iterations for average-cost MDPs modeling replacement and maintenance problems
252 -- 258Miles Lubin, Kipp Martin, Cosmin G. Petra, Burhaneddin Sandikçi. On parallelizing dual decomposition in stochastic integer programming
259 -- 264Yong-Jin Liu, Shiyun Wang, Juhe Sun. Finding the projection onto the intersection of a closed half-space and a variable box
265 -- 270Yoni Nazarathy, Leonardo Rojas-Nandayapa, Thomas S. Salisbury. Non-existence of stabilizing policies for the critical push-pull network and generalizations
271 -- 276Jose Blanchet, Yixi Shi. Efficient rare event simulation for heavy-tailed systems via cross entropy
277 -- 284Pengfei Guo, Qingying Li. Strategic behavior and social optimization in partially-observable Markovian vacation queues
285 -- 289Jun Wang, Peng Wang. Counterterror measures and economic growth: A differential game
290 -- 293Joseph Y.-T. Leung, Zhi-Long Chen. Integrated production and distribution with fixed delivery departure dates
294 -- 297Luis Gouveia, Juan José Salazar González. Polynomial-time separation of Enhanced Reverse Multistar inequalities
298 -- 304Katrin Herr, Thomas Rehn, Achill Schürmann. Exploiting symmetry in integer convex optimization using core points
305 -- 310A. C. C. van Wijk, Ivo J. B. F. Adan, G. J. van Houtum. Optimal allocation policy for a multi-location inventory system with a quick response warehouse
311 -- 316Anderson Rodrigo de Queiroz, David P. Morton. Sharing cuts under aggregated forecasts when decomposing multi-stage stochastic programs

Volume 41, Issue 2

121 -- 125James M. Davis, Rajiv Gandhi, Vijay H. Kothari. Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine
126 -- 133Paolo Serafini. Combinatorial optimization problems with normal random costs
134 -- 137Retsef Levi, Liron Yedidsion. NP-hardness proof for the assembly problem with stationary setup and additive holding costs
138 -- 141Hongyu Liang. p-hub center problem
142 -- 146Gérard Cornuéjols, Tamás Kis, Marco Molinaro. Lifting Gomory cuts with bounded variables
147 -- 149Yanfang Zhang, Shue Mei, Weijun Zhong. Should R&D risk always be preferable?
150 -- 152Vyacheslav M. Abramov. n queues
153 -- 158Igor Vasilyev, Xenia Klimentova, Maurizio Boccia. Polyhedral study of simple plant location problem with order
159 -- 163Anand Paul, Arda Yenipazarli. A note on lateral transshipment under point-process driven demand
164 -- 171Helin Wu. g-expectation with constraints
172 -- 179Xi Chen, Saif Benjaafar, Adel Elomri. The carbon-constrained EOQ
180 -- 187Yang Shen, Tak Kuen Siu. Pricing variance swaps under a stochastic interest rate and volatility model with regime-switching
188 -- 190Natalia Chernova, Sergey Foss, Bara Kim. A polling system whose stability region depends on the whole distribution of service times
191 -- 196Vineet Goyal, R. Ravi. An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
197 -- 200Milan Stanojevic, Mirko Vujosevic, Bogdana Stanojevic. On the cardinality of the nondominated set of multi-objective combinatorial optimization problems
201 -- 206Tal Ben-Zvi, Abraham Grosfeld-Nir. Partially observed Markov decision processes with binomial observations
207 -- 209Shouwei Guo, Liying Kang. Online scheduling of parallel jobs with preemption on two identical machines

Volume 41, Issue 1

1 -- 6Lauri Ahlroth, André Schumacher, Pekka Orponen. Online bin packing with delay and holding costs
7 -- 11J. C. Gerdessen, G. D. H. Claassen, A. Banasik. General 0-1 fractional programming with conditional fractional terms for design of food frequency questionnaires
12 -- 18Wei Zhang 0033, Zhongsheng Hua. Optimal inventory policy for capacitated systems with two supply sources
19 -- 26Alexandar Angelus, Wanshan Zhu. On the structure of capacitated assembly systems
27 -- 31R. S. Randhawa. Accuracy of fluid approximations for queueing systems with congestion-sensitive demand and implications for capacity sizing
32 -- 39Frank M. Muldoon, Warren P. Adams, Hanif D. Sherali. Ideal representations of lexicographic orderings and base-2 expansions of integer variables
40 -- 46Fatma Gzara. A cutting plane approach for bilevel hazardous material transport network design
47 -- 53Jeremy Staum. Excess invariance and shortfall risk measures
54 -- 60Utku Koc, Aysegül Toptal, Ihsan Sabuncuoglu. A class of joint production and transportation planning problems under different delivery policies
61 -- 66Lu Hsiao, Ying-Ju Chen. Benefiting from the economic recession? A supply chain perspective
67 -- 73Chun-Hung Chiu, Ngai-Hang Z. Leung, Karthik Natarajan. S) inventory system
74 -- 77Valentina Cacchiani, Alberto Caprara, Gábor Maróti, Paolo Toth. On integer polytopes with few nonzero vertices
78 -- 80Gerd Wachsmuth. On LICQ and the uniqueness of Lagrange multipliers
81 -- 85A. Salch, Jean-Philippe Gayon, P. Lemaire. Optimal static priority rules for stochastic scheduling with impatience
86 -- 91Yue Dai, Xiuli Chao. Salesforce contract design and inventory planning with asymmetric risk-averse sales agents
92 -- 97Lanshan Han, Andrew L. Liu. On Nash-Cournot games with price caps
98 -- 106Mei Choi Chiu, Hoi Ying Wong. Mean-variance principle of managing cointegrated risky assets and random liabilities
107 -- 111Achal Bassamboo, Leon Yang Chu, Ramandeep S. Randhawa. Designing flexible systems using a new notion of submodularity
112 -- 115Michael Z. Spivey. Optimal discounts for the online assignment problem
116 -- 120Alexander Zaigraev, Serguei Kaniovski. n correlated binary trials