Journal: Oper. Res. Lett.

Volume 48, Issue 6

687 -- 692ShaoJie Tang, Jing Yuan 0002. Product sequencing and pricing under cascade browse model
693 -- 696Xiangyu Cui, Xun Li 0002, Lanzhi Yang. Better than optimal mean-variance portfolio policy in multi-period asset-liability management problem
697 -- 702Anders Forsgren, Fei Wang 0043. On the existence of a short pivoting sequence for a linear program
703 -- 707Michi Nishihara. Closed-form solution to a real option problem with regime switching
708 -- 714Jonatas B. C. Chagas, Markus Wagner 0007. Ants can orienteer a thief in their robbery
715 -- 719Chandan Pal, Subhamay Saha. Continuous-time zero-sum stochastic game with stopping and control
720 -- 724Xingying Yu, Yang Shen, Xiang Li, Kun Fan. Portfolio selection with parameter uncertainty under α maxmin mean-variance criterion
725 -- 731Alejandro Saavedra-Nieves. Assessing systematic sampling in estimating the Banzhaf-Owen value
732 -- 736Alexander Zaigraev, Serguei Kaniovski. Inequality in population weights, majority threshold and the inversion probability in the case of three states
737 -- 743Abdolghani Ebrahimi, Arka P. Ghosh. Optimal control of a queue under a quality-of-service constraint with bounded and unbounded rates
744 -- 751Timothy C. Y. Chan, Adam Diamant, Rafid Mahmood. Sampling from the complement of a polyhedron: An MCMC algorithm for data augmentation
752 -- 757Tim J. Boonen. τ-value for risk capital allocation problems
758 -- 762Wenrui Feng, Weibin Han, Zheng Pan. A reformulated Shapley-like value for cooperative games with interval payoffs
763 -- 769Mahsa Moghaddass, Daria Terekhov. Inverse integer optimization with an imperfect observation
770 -- 776Yan Chen, Ward Whitt. Extremal models for the GI∕GI∕K waiting-time tail-probability decay rate
777 -- 783Adam Ouorou. Fast proximal algorithms for nonsmooth convex optimization
784 -- 786Dennis Fischer, Gerhard J. Woeginger. A faster algorithm for the continuous bilevel knapsack problem
787 -- 791Samuel N. Kirshner, Zhaolin Li. Oligopoly newsvendor competition with reference effects
792 -- 797Ling Zhao, Zhixue Liu, Peng Hu. Dynamic repositioning for vehicle sharing with setup costs
798 -- 804Vera Traub. Improving on Best-of-Many-Christofides for T-tours
805 -- 810Borga Deniz, Itir Z. Karaesmen, Alan Scheller-Wolf. A comparison of inventory policies for perishable goods
811 -- 815Jetlir Duraj. On expected utility in optimal stopping of diffusions
816 -- 819Oliver Bachtler, Sven O. Krumke, Le Huy Minh. Robust single machine makespan scheduling with release date uncertainty
820 -- 826Yu Han. Connectedness of weak minimal solution set for set optimization problems
827 -- 834Collin Drent, Stella Kapodistria, Onno J. Boxma. Censored lifetime learning: Optimal Bayesian age-replacement policies
835 -- 839Dorit S. Hochbaum, Xu Rao. A fully polynomial time approximation scheme for the Replenishment Storage problem
840 -- 843Shmuel Onn. On degree sequence optimization
844 -- 849Leah Epstein, Asaf Levin. A note on a variant of the online open end bin packing problem

Volume 48, Issue 5

543 -- 548Eugene A. Feinberg, Gaojin He. Complexity bounds for approximately solving discounted MDPs by value iterations
549 -- 551Jin Gi Kim, Bong-Gyu Jang, Seyoung Park. Annuitization and asset allocation with borrowing constraint
552 -- 557Attahiru Sule Alfa. Discrete time Markov chain model for age of information
558 -- 565A. Hedayat, H. Mohebi. Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications
566 -- 572Edward Anderson, Harrison Nguyen. When can we improve on sample average approximation for stochastic optimization?
573 -- 578Haris Aziz 0001, Hervé Moulin, Fedor Sandomirskiy. A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
579 -- 583Le Hai Yen, Le Dung Muu. A subgradient method for equilibrium problems involving quasiconvex bifunctions
584 -- 586Takashi Kamihigashi, John Stachurski. Partial stochastic dominance via optimal transport
587 -- 593Sven de Vries, Rakesh V. Vohra. Matroidal approximations of independence systems
594 -- 598Matthias Claus, Maximilian Simmoteit. A note on Σ2p-completeness of a robust binary linear program with binary uncertainty set
599 -- 606Fatemeh Navidi, Inge Li Gørtz, Viswanath Nagarajan. Approximation algorithms for the a priori traveling repairman
607 -- 611Adam N. Letchford, Georgia Souli. Lifting the knapsack cover inequalities for the knapsack polytope
612 -- 618Christopher Hojny. Polynomial size IP formulations of knapsack may require exponentially large coefficients
619 -- 622Paola Labrecciosa. Cournot competition with hyperbolic learning and myopic firms: A note
623 -- 626Luca Colombo. A note on oligopoly exploitation of common-pool renewable resources
627 -- 629Xianghui Zhong. Slightly improved upper bound on the integrality ratio for the s-t Path TSP
630 -- 634Brian Clark, Zachary Feinstein, Majeed Simaan. A machine learning efficient frontier
635 -- 640Jin Xu, Chi Zhang, Jianghua Zhang. Three-player sequential contests with asymmetric valuations
641 -- 645Le Chang, Yanlin Shi. Does Bitcoin dominate the price discovery of the Cryptocurrencies market? A time-varying information share analysis
646 -- 651Zhongbin Wang, Lei Fang, Sheng Zhu. Strategic behavior in queues with the effect of the number of customers behind
652 -- 657Dehia Ait-Ferhat, Vincent Juliard, Gautier Stauffer, J. Andres Torres. The k-path coloring problem in graphs of bounded treewidth: An application in integrated circuit manufacturing
658 -- 665Yuhong He, Shuya Yin. Cost analysis in global supply chains
666 -- 673Seksan Kiatsupaibul, Robert L. Smith 0002, Zelda B. Zabinsky. Single observation adaptive search for discrete and continuous stochastic optimization
674 -- 681Qingying Li, Pengfei Guo, Yulan Wang. Equilibrium analysis of unobservable M∕M∕n priority queues with balking and homogeneous customers
682 -- 686Ruxian Wang. On the assortment optimization with endogenized market size

Volume 48, Issue 4

393 -- 396Sha Liao. Coping with the Renewable Portfolio Standards: A utility's perspective
397 -- 400Moris S. Strub, Duan Li 0002. A note on monotone mean-variance preferences for continuous processes
401 -- 404Stefan Hougardy, Fabian Zaiser, Xianghui Zhong. The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem
405 -- 409Alessandro Agnetis, Thomas Lidbetter. The Largest-Z-ratio-First algorithm is 0.8531-approximate for scheduling unreliable jobs on m parallel machines
410 -- 414Marcin Wnuk, Michael Gnewuch. Note on pairwise negative dependence of randomly shifted and jittered rank-1 lattices
415 -- 420Chenbo Zhu. An efficient approach for dual sourcing inventory systems with Tailored Base-Surge policies
421 -- 427Jaemin Kim, Babak Lotfaliei. Debt recapitalization and value in waiting to finance a project
428 -- 434Guangjing Yang, Hao Sun 0011, Marc Uetz. Cooperative sequencing games with position-dependent learning effect
435 -- 440Zhentao Zou. Optimal dividend-distribution strategy under ambiguity aversion
441 -- 445Jinyu Dai. On globally solving the extended trust-region subproblems
446 -- 451Benjamin Heymann, Criteo. How to bid in unified second-price auctions when requests are duplicated
452 -- 459David Van Bulck, Dries R. Goossens. On the complexity of pattern feasibility problems in time-relaxed sports timetabling
460 -- 466Wenbo Ma, Miguel A. Lejeune. A distributionally robust area under curve maximization model
467 -- 471Charles Audet, Gilles Caporossi, Stéphane Jacquet. Binary, unrelaxable and hidden constraints in blackbox optimization
472 -- 479Hans Raj Tiwary, Victor Verdugo, Andreas Wiese. On the extension complexity of scheduling polytopes
480 -- 486Hossein Salmei, Mohammad Ali Yaghoobi. Improving the min-max method for multiobjective programming
487 -- 492Michel Grabisch, Agnieszka Rusinowska. k-additive upper approximation of TU-games
493 -- 499Belleh A. Fontem. Constrained maximum variance stopping for a finite horizon increasing random walk
500 -- 504Wei Geng. Designing a referral reward program in freemium: The role of network externalities
505 -- 512Oscar Dowson, David P. Morton, Bernardo K. Pagnoncelli. Partially observable multistage stochastic programming
513 -- 523Weijun Xie 0001. Tractable reformulations of two-stage distributionally robust linear programs over the type-∞ Wasserstein ball
524 -- 529Zhixin Liu. Scheduling with partial rejection
530 -- 533Jonathan Chamberlain, David Starobinski. Social welfare and price of anarchy in preemptive priority queues
534 -- 541Inés Jiménez, Andrés Mora-Valencia, Javier Perote. Risk quantification and validation for Bitcoin

Volume 48, Issue 3

203 -- 208Dimitris Bertsimas, Michael Lingzhi Li. Scalable holistic linear regression
209 -- 216Burak Cavdaroglu, Tankut Atan. Determining matchdays in sports league schedules to minimize rest differences
217 -- 224David A. Cohen, Martin C. Cooper, Artem Kaznatcheev, Mark Wallace 0001. Steepest ascent can be exponential in bounded treewidth problems
225 -- 232Lars Schewe, Martin Schmidt 0003, Dieter Weninger. A decomposition heuristic for mixed-integer supply chain problems
233 -- 239Stéphane R. A. Barde, Young Myoung Ko, Hayong Shin. Fitting discrete phase-type distribution from censored and truncated observations with pre-specified hazard sequence
240 -- 244Adam N. Letchford, Georgia Souli. Valid inequalities for mixed-integer programmes with fixed charges on sets of variables
245 -- 248Samuel C. Gutekunst, David P. Williamson. Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP
249 -- 256Aditya Vedantam, Ananth V. Iyer. An analysis of voluntary recycled content claims under demand benefit and uncertain recycled input supply
257 -- 261Daojian Yang, Xiujie Zhang. Omnichannel operations with ship-from-store
262 -- 265Eilon Solan, Omri N. Solan. Logit equilibrium as an approximation of Nash equilibrium
266 -- 270Francisco Javier Zaragoza Martínez. Postman problems on series-parallel mixed graphs
271 -- 277Arturo Berrones-Santos, Jonás Velasco, Juan Banda. Dual mean field annealing scheme for binary optimization under linear constraints
278 -- 285Archis Ghate. Inverse optimization in semi-infinite linear programs
286 -- 290Bikramaditya Datta. Investment timing, agency and overconfidence
291 -- 296Bing Lin, Jianjun Xu, Shaoxiang Chen, Youyi Feng, Michael Z. F. Li. A hybrid model for airline seat inventory control of the multi-leg problems
297 -- 303Stephen E. Wright, Sooyeong Lim. Solving nested-constraint resource allocation problems with an interior point method
304 -- 308Moshe Haviv, Eyal Winter. An optimal mechanism charging for priority in a queue
309 -- 316Dorothée Honhon, Xiajun Amy Pan, Sreelata Jonnalagedda. In-Out Algorithm for assortment planning under a ranking-based consumer choice model
317 -- 322Yan Su, Junping Li. Bias optimality of admission control in a non-stationary repairable queue
323 -- 328Steffen Borgwardt, Charles Viss. An implementation of steepest-descent augmentation for linear programs
329 -- 335Temitayo Ajayi, Varun Suriyanarayana, Andrew J. Schaefer. Theorems of the alternative for conic integer programming
336 -- 341Mathieu Martin, Zéphirin Nganmeni. A note on the finesse point
342 -- 349David T. Mildebrath, Victor Gonzalez, Mehdi Hemmati, Andrew J. Schaefer. Relating single-scenario facets to the convex hull of the extensive form of a stochastic single-node flow polytope
350 -- 355Ali Eshragh, Rasul Esmaeilbeigi, Richard H. Middleton. An analytical bound on the fleet size in vehicle routing problems: A dynamic programming approach
356 -- 361Hao-Hsiang Wu, Simge Küçükyavuz. An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions
362 -- 367Daniele Catanzaro, Martin Frohn, Raffaele Pesenti. An information theory perspective on the balanced minimum evolution problem
368 -- 375Mark van der Boor, Martin Zubeldia, Sem C. Borst. Zero-wait load balancing with sparse messaging
376 -- 384Ryan Cory-Wright, Golbon Zakeri. On stochastic auctions in risk-averse electricity markets with uncertain supply
385 -- 391Sylvain Béal, Florian Navarro. Necessary versus equal players in axiomatic studies

Volume 48, Issue 2

105 -- 108Ruhul Ali Khan, Dhrubasish Bhattacharyya, Murari Mitra. A change point estimation problem related to age replacement policies
109 -- 114Alice Paul, David P. Williamson. Easy capacitated facility location problems, with connections to lot-sizing
115 -- 121Jan Harold Alcantara, Chen-Han Lee, Chieu Thanh Nguyen, Yu-Lin Chang, Jein-Shan Chen. On construction of new NCP functions
122 -- 129Radoslav Harman, Samuel Rosa. On greedy heuristics for computing D-efficient saturated subsets
130 -- 135Hongcan Lin, David Saunders, Chengguo Weng. BSDE approach to utility maximization with square-root factor processes
136 -- 141Petra Vis, René Bekker, Robert D. van der Mei, R. Núñez Queija. Heavy-traffic limits for Discriminatory Processor Sharing models with joint batch arrivals
142 -- 146Daniel Li Li, Erfang Shan. The Myerson value for directed graph games
147 -- 151Jun Pei, Amir Motaei, Petar Momcilovic. A note on a limit interchange for many-server queues
152 -- 156Ole Bueker, Bara Kim, Jeongsim Kim. Customer equilibrium and optimal pricing in an M/G/1 queue with heterogeneous rewards and waiting cost rates
157 -- 162Jian Yu, Dingtao Peng. Generic stability of Nash equilibria for noncooperative differential games
163 -- 166Raad Salman, Fredrik Ekstedt, Peter Damaschke. Branch-and-bound for the Precedence Constrained Generalized Traveling Salesman Problem
167 -- 169Yuan Yuan, Diego Cattaruzza, Maxime Ogier, Frédéric Semet. A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows
170 -- 175Yongwu Li, Zhongfei Li, Shouyang Wang, Zuo Quan Xu. Dividend optimization for jump-diffusion model with solvency constraints
176 -- 179Will Ma, Balasubramanian Sivan. Separation between second price auctions with personalized reserves and the revenue optimal auction
180 -- 187Morteza Davari, Dries R. Goossens, Jeroen Beliën, Roel Lambers, Frits C. R. Spieksma. The multi-league sports scheduling problem, or how to schedule thousands of matches
188 -- 194Liguo Jiao, Jae-Hyoung Lee, Yuying Zhou. A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
195 -- 201Fengjun Liu, Yingjie Niu, Zhentao Zou. Incomplete markets, Knightian uncertainty and high-water marks

Volume 48, Issue 1

1 -- 3Shiran Rachmilevitch. Discounting-sensitivity in symmetric repeated games: An example
4 -- 8Anna Castañer, Jesús Marín-Solano, Carmen Ribas. An agreeable collusive equilibrium in differential games with asymmetric players
9 -- 17Xiangyin Kong, Huihui Wang, Xi Chen, Gengzhong Feng. Optimal policy for inventory systems with capacity commitment and fixed ordering costs
18 -- 23Yann Disser, Jannik Matuschke. The complexity of computing a robust flow
24 -- 28ShaoJie Tang, Jing Yuan 0002. Influence maximization with partial feedback
29 -- 32Sven O. Krumke, Le Huy Minh. Robust absolute single machine makespan scheduling-location problem on trees
33 -- 39Anthony Downward, Oscar Dowson, Regan Baucke. Stochastic dual dynamic programming with stagewise-dependent objective uncertainty
40 -- 47Amarjit Kundu, Shovan Chowdhury. On stochastic comparisons of series systems with heterogeneous dependent and independent location-scale family distributed components
48 -- 54Yogesh Kumar Agarwal, Prahalad Venkateshan. A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries
55 -- 60René van den Brink, René Levínský, Miroslav Zelený. The Shapley value, the Proper Shapley value, and sharing rules for cooperative ventures
61 -- 66Lei Wang, Cui Liu, Hongwei Gao, Chong Lin. Strongly strategic support of cooperative solutions for games over event trees
67 -- 70Julia Gaudio, Patrick Jaillet. An improved lower bound for the Traveling Salesman constant
71 -- 77Ioannis Papachristos, Dimitrios G. Pandelis. Optimal server assignment in a two-stage tandem queueing system
78 -- 85Dimitris Bertsimas, Ryan Cory-Wright. On polyhedral and second-order cone decompositions of semidefinite optimization problems
86 -- 92Alejandro Saavedra-Nieves. A multi-agent inventory problem with general transportation costs
93 -- 95Galit Ashkenazi-Golan, Eilon Solan, Anna Zseleva. Characterizing the value functions of polynomial games
96 -- 103Yonghui Huang, Zhaotong Lian, Xianping Guo. Risk-sensitive finite-horizon piecewise deterministic Markov decision processes