Journal: Oper. Res. Lett.

Volume 43, Issue 6

545 -- 549Michael Zhang, Jiejian Feng. Turnpike properties of group testing for incomplete identification
550 -- 557Qinan Wang, Chang Liu. Exact evaluation and optimization of the (R, nt) policy for a two-stage serial inventory system
558 -- 563Ryo Watanabe, Atsuyoshi Nakamura, Mineichi Kudo. An improved upper bound on the expected regret of UCB-type policies for a matching-selection bandit problem
564 -- 566Po-An Chen. How egalitarian are Nash equilibria in network cost-sharing games?
567 -- 572Guo-ji Tang, Ming Zhu, Huan-Wen Liu. A new extragradient-type method for mixed variational inequalities
573 -- 574Yusuke Kobayashi. ♮-convex set functions
575 -- 578Jourdain B. Lamperski, Andrew J. Schaefer. A polyhedral characterization of the inverse-feasible region of a mixed-integer program
579 -- 580Felix Lieder. Simplified semidefinite and completely positive relaxations
581 -- 585Mark S. Joshi. A new class of dual upper bounds for early exercisable derivatives encompassing both the additive and multiplicative bounds
586 -- 591Sina Dehghani, MohammadAmin Fazli, Jafar Habibi, Sadra Yazdanbod. Using shortcut edges to maximize the number of triangles in graphs
592 -- 594Volker Kaibel, Shmuel Onn, Pauline Sarrabezolles. The unimodular intersection problem
595 -- 598Tamás Kis. Approximability of total weighted completion time with resource consuming jobs
599 -- 600Dominik Kress. Reinvestigating the uniqueness of price equilibria in a product positioning model under price competition in a multisegmented market
601 -- 607José Da Fonseca, Alessandro Gnoatto, Martino Grasselli. Analytic pricing of volatility-equity options within Wishart-based stochastic volatility models
608 -- 611James M. Davis, Huseyin Topaloglu, David P. Williamson. Assortment optimization over time
612 -- 615Nitin Gupta, Lakshmi Kanta Patra, Somesh Kumar. Stochastic comparisons in systems with Frèchet distributed components
616 -- 621Serkan Eryilmaz. On the mean number of remaining components in three-state k-out-of-n system
622 -- 624Haris Aziz. Competitive equilibrium with equal incomes for allocation of indivisible objects
625 -- 628Shinji Mizuno, Noriyoshi Sukegawa, Antoine Deza. A primal-simplex based Tardos' algorithm
629 -- 632Yoshiaki Inoue, Tetsuya Takine. The M/D/1+D queue has the minimum loss probability among M/G/1+G queues

Volume 43, Issue 5

457 -- 460Michele Conforti, Volker Kaibel, Matthias Walter, Stefan Weltge. Subgraph polytopes and independence polytopes of count matroids
461 -- 466M. Hosseinalifam, Patrice Marcotte, Gilles Savard. Network capacity control under a nonparametric demand choice model
467 -- 470Bernardo D'Auria, Spyridoula Kanta. Pure threshold strategies for a two-node tandem network under partial information
471 -- 475Xin Li, Mingwang Zhang. Interior-point algorithm for linear optimization based on a new trigonometric kernel function
476 -- 478J. García-Segarra, M. Ginés-Vilar. The impossibility of Paretian monotonic solutions: A strengthening of Roth's result
479 -- 483Minjiao Zhang. Capacitated lot-sizing problem with outsourcing
484 -- 488Gabriel Haeser, Vinicius Veloso de Melo. Convergence detection for optimization algorithms: Approximate-KKT stopping criterion when Lagrange multipliers are not available
489 -- 494Zhiyi Tan, Rongqi Li. Pseudo lower bounds for online parallel machine scheduling
495 -- 497Fei Shi. Endogenous timing, market research, and demand uncertainty
498 -- 503Timothy D. Lortz, Irina S. Dolinskaya, Archis Ghate, Robert L. Smith. Solvability in infinite horizon optimization
504 -- 506Wouter Rogiest, Koenraad Laevens, Joris Walraevens, Herwig Bruneel. When Random-Order-of-Service outperforms First-Come-First-Served
507 -- 513Elena Parilina, Georges Zaccour. Approximated cooperative equilibria for games played over event trees
514 -- 518Geoffrey A. Chua, Yan Liu. On the effect of demand randomness on inventory, pricing and profit
519 -- 521Serigne Gueye, Mozart B. C. Menezes. General asymptotic and submodular results for the Median Problem with Unreliable Facilities
522 -- 525An Zhang. On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints
526 -- 529Takanori Maehara. Risk averse submodular utility maximization
530 -- 533Refael Hassin, Uri Yovel. Sequential scheduling on identical machines
534 -- 536Noriyoshi Sukegawa, Tomonari Kitahara. A refinement of Todd's bound for the diameter of a polyhedron
537 -- 544Serdar Karademir, Oleg A. Prokopyev. On speed scaling via integer programming

Volume 43, Issue 4

349 -- 353Michael R. Galbreth, Mümin Kurtulus, Mikhael Shor. How collaborative forecasting can reduce forecast accuracy
354 -- 358Yu-Lin Chang, Jein-Shan Chen, Ching-Yu Yang. Symmetrization of generalized natural residual function for NCP
359 -- 364Z. Melis Teksan, Joseph Geunes. A polynomial time algorithm for convex cost lot-sizing problems
365 -- 369Lei Sun, Mark H. Karwan. On the core of traveling salesman games
370 -- 373Luca Lambertini, Raimondello Orsini. Quality improvement and process innovation in monopoly: A dynamic analysis
374 -- 377David F. Muñoz, Adán Ramírez-López. A note on bias and mean squared error in steady-state quantile estimation
378 -- 383Yong Hsia, Shu Wang, Zi Xu. Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints
384 -- 388Christoph Buchheim, Marianna De Santis, Laura Palagi. A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
389 -- 395Alessandra Buratto, Chiara D'Alpaos. Optimal sustainable use of drinking water sources and interactions between multiple providers
396 -- 400Wei Cao, Jian Li, Shimin Li, Haitao Wang. Balanced splitting on weighted intervals
401 -- 404Mei Lin, Ruhai Wu. Production cost heterogeneity in the circular city model
405 -- 410V. Jeyakumar, G. Li. A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
411 -- 417Yaxian Li, Özlem Ergun, George L. Nemhauser. A dual heuristic for mixed integer programming
418 -- 0Fatemeh Saberian, Archis Ghate, Minsun Kim. Corrigendum to "A two-variable linear program solves the standard linear-quadratic formulation of the fractionation problem in cancer radiotherapy" [Oper. Res. Lett. 43(3) (2015) 254-258]
419 -- 422Leunglung Chan, Eckhard Platen. Pricing volatility derivatives under the modified constant elasticity of variance model
423 -- 426Yiju Wang, Wanquan Liu, Louis Caccetta, Guanglu Zhou. 1 matrix/tensor sparse decomposition
427 -- 431Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux. Constructing general dual-feasible functions
432 -- 437Sercan Yildiz, Gérard Cornuéjols. Disjunctive cuts for cross-sections of the second-order cone
438 -- 444Matthias Köppe, Yuan Zhou. An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem
445 -- 449Ruken Düzgün, Aurélie Thiele. Robust binary optimization using a safe tractable approximation
450 -- 455Chenxu Li, Xiaocheng Li. A closed-form expansion approach for pricing discretely monitored variance swaps

Volume 43, Issue 3

219 -- 225Lifei Sheng, Huan Zheng, Ying Rong, Woonghee Tim Huh. Flexible system design: A perspective from service levels
226 -- 230Zhe Chen. Asymptotic analysis for proximal-type methods in vector variational inequality problems
231 -- 235Archis Ghate. Inverse optimization in countably infinite linear programs
236 -- 240Bara Kim, Jeongsim Kim. Proof of the conjecture on the stability of a multiserver retrial queue
241 -- 246Ahsan-Abbas Ali, Shuangqing Wei, Lijun Qian. Optimal admission and preemption control in finite-source loss systems
247 -- 253Song-Hee Kim, Ponni Vel, Ward Whitt, Won Chul Cha. Poisson and non-Poisson properties in appointment-generated arrival processes: The case of an endocrinology clinic
254 -- 258Fatemeh Saberian, Archis Ghate, Minsun Kim. A two-variable linear program solves the standard linear-quadratic formulation of the fractionation problem in cancer radiotherapy
259 -- 261Judith Brecklinghaus, Stefan Hougardy. The approximation ratio of the greedy algorithm for the metric traveling salesman problem
262 -- 267Lei Guo, Gui-Hua Lin, Dali Zhang, Daoli Zhu. An MPEC reformulation of an EPEC model for electricity markets
268 -- 272Lotte Berghman, Frits C. R. Spieksma. Valid inequalities for a time-indexed formulation
273 -- 278Pierre Le Bodic, George L. Nemhauser. How important are branching decisions: Fooling MIP solvers
279 -- 282Robert Hildebrand, Timm Oertel, Robert Weismantel. Note on the complexity of the mixed-integer hull of a polyhedron
283 -- 287Jay Sethuraman, Chun Ye. A note on the assignment problem with uniform preferences
288 -- 292António Osório. Some notes and comments on the efficient use of information in repeated games with Poisson signals
293 -- 298Feng Wang, Sanyang Liu, Yanfei Chai. Robust counterparts and robust efficient solutions in vector optimization under uncertainty
299 -- 303Michael Schönlein. A Lyapunov view on positive Harris recurrence of multiclass queueing networks
304 -- 310Haohua Wan, Qiong Wang. Asymptotically-optimal component allocation for Assemble-to-Order production-inventory systems
311 -- 316Ge Guo, Gabriel Hackebeil, Sarah M. Ryan, Jean-Paul Watson, David L. Woodruff. Integration of progressive hedging and dual decomposition in stochastic integer programs
317 -- 322David Adjiashvili, Sandro Bosio, Kevin Zemmer. Minimizing the number of switch instances on a flexible machine in polynomial time
323 -- 328Santanu S. Dey, Andres Iroume, Marco Molinaro. Some lower bounds on sparse outer approximations of polytopes
329 -- 333Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen. Congestion games viewed from M-convexity
334 -- 338Chee-Khian Sim. On finding a generalized lowest rank solution to a linear semi-definite feasibility problem
339 -- 342Yuri Faenza, Laura Sanità. On the existence of compact ε-approximated formulations for knapsack in the original space
343 -- 348Pengfei Guo, Refael Hassin. Equilibrium strategies for placing duplicate orders in a single server queue

Volume 43, Issue 2

123 -- 125Sylvain Béal, Eric Rémila, Philippe Solal. Decomposition of the space of TU-games, Strong transfer invariance and the Banzhaf value
126 -- 131Marco Locatelli. Some results for quadratic problems with one or two quadratic constraints
132 -- 136Javiera Barrera, Héctor Cancela, Eduardo Moreno. Topological optimization of reliable networks under dependent failures
137 -- 142Zijun Hao, Zhongping Wan, Xiaoni Chi. A power penalty method for second-order cone linear complementarity problems
143 -- 147Bogumil Kaminski. Refined knowledge-gradient policy for learning probabilities
148 -- 150Debapriya Sen, Giorgos Stamatopoulos. When an inefficient competitor makes higher profit than its efficient rival
151 -- 160Seungbeom Kim, Woonghee Tim Huh, Sriram Dasu. Pre-announced posted pricing scheme: Existence and uniqueness of equilibrium bidding strategy
161 -- 164Kanstantsin Pashkovich, Stefan Weltge. Hidden vertices in extensions of polytopes
165 -- 171Jerzy Kamburowski. On the distribution-free newsboy problem with some non-skewed demands
172 -- 176Fabien Cornillier, Vincent Charles. Measuring the attractiveness of academic journals: A direct influence aggregation model
177 -- 182Ying-Ju Chen. Optimal dynamic pricing for sponsored search advertising
183 -- 188M. Kayid, S. Izadkhah. A new extended mixture model of residual lifetime distributions
189 -- 194Sumit Kunnumkal. On upper bounds for assortment optimization under the mixture of multinomial logit models
195 -- 198Jiantian Wang, Henry Laniado. On likelihood ratio ordering of parallel system with two exponential components
199 -- 202Iskander Aliev. On the lattice programming gap of the group problems
203 -- 208HoChang Lee, Dong Won Seo. Explicit expressions for moments of waiting times in Poisson driven deterministic two-node tandem queues with blocking
209 -- 214Yoel Drori, Shoham Sabach, Marc Teboulle. A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
215 -- 217Shabbir Ahmed. Corrigendum to "A scenario decomposition algorithm for 0-1 stochastic programs" [Oper. Res. Lett. 41(6) (2013) 565-569]

Volume 43, Issue 1

1 -- 6Cristina Bazgan, Florian Jamain, Daniel Vanderpooten. Approximate Pareto sets of minimal size for multi-objective optimization problems
7 -- 9Julián Mestre. On the intersection of independence systems
10 -- 15Sina Modaresi, Mustafa R. Kilinç, Juan Pablo Vielma. Split cuts and extended formulations for Mixed Integer Conic Quadratic Programming
16 -- 19Adam Kasperski, Adam Kurpisz, Pawel Zielinski. Approximability of the robust representatives selection problem
20 -- 25Kyoung-Kuk Kim, Michael K. Lim. R&D outsourcing in an innovation-driven supply chain
26 -- 28Babak Haji, Sheldon M. Ross. M/G/∞ with exponentially distributed setup times
29 -- 33Ruichen (Richard) Sun, Oleg V. Shylo, Andrew J. Schaefer. Totally unimodular multistage stochastic programs
34 -- 39Tri-Dung Nguyen. The fairest core in cooperative games with transferable utilities
40 -- 45Jamol Pender. The truncated normal distribution: Applications to queues with impatient customers
46 -- 51Santanu Dey, Sandeep Juneja, Karthyek R. A. Murthy. Incorporating views on marginal distributions in the calibration of risk models
52 -- 58Qihang Lin, Xi Chen, Javier Peña. A trade execution model under a composite dynamic coherent risk measure
59 -- 64Jinho Lee, John J. Hasenbein, David P. Morton. Optimization of stochastic virus detection in contact networks
65 -- 68Xin Chen, Xiangyu Gao, ZhenYu Hu. ♮-convexity
69 -- 73Marco Di Summa. A short convex-hull proof for the all-different system with the inclusion property
74 -- 79Utz-Uwe Haus. Bounding stochastic dependence, joint mixability of matrices, and multidimensional bottleneck assignment problems
80 -- 82Yuan Gao, Jinjiang Yuan. A note on Pareto minimizing total completion time and maximum cost
83 -- 88Qingda Wei, Xian Chen. Constrained stochastic games with the average payoff criteria
89 -- 92Naoyuki Kamiyama. The nucleolus of arborescence games in directed acyclic graphs
93 -- 95Martin Groß, Martin Skutella. A tight bound on the speed-up through storage for quickest multi-commodity flows
96 -- 98Nguyen L. Truong. A note on the optimal stopping parking problem
99 -- 102Sebastian Bervoets, Vincent Merlin, Gerhard J. Woeginger. Vote trading and subset sums
103 -- 109Monique Laurent, Matteo Seminaroti. The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
110 -- 116José María Lorenzo, Ismael Hernández-Noriega, Tomás Prieto-Rumeau. Approximation of two-person zero-sum continuous-time Markov games with average payoff criterion
117 -- 122Chungen Shen, Wenjuan Xue, Yu'e An. A new result on second-order necessary conditions for nonlinear programming