Journal: Oper. Res. Lett.

Volume 44, Issue 6

697 -- 701Sirong Luo, Suresh P. Sethi, Ruixia Shi. On the optimality conditions of a price-setting newsvendor problem
702 -- 705Mei-Jia Yang, Yong Xia, Hui-Min Zou. On linearization techniques for budget-constrained binary quadratic programming problems
706 -- 711Alexander Karpov. A new knockout tournament seeding method and its axiomatic justification
712 -- 717Tobias Harks, Tim Oosterwijk, Tjark Vredeveld. A logarithmic approximation for polymatroid congestion games
718 -- 722Henrik A. Friberg. A relaxed-certificate facial reduction algorithm based on subspace intersection
723 -- 728Virgile Galle, S. Borjian Boroujeni, Vahideh H. Manshadi, Cynthia Barnhart, Patrick Jaillet. An average-case asymptotic analysis of the Container Relocation Problem
729 -- 736Xun Li, Zuo Quan Xu. Continuous-time Markowitz's model with constraints on wealth and portfolio
737 -- 741Xin Geng. Opaque selling in congested systems
742 -- 746Xiaolong Zou, Yonghui Huang. Verifiable conditions for average optimality of continuous-time Markov decision processes
747 -- 749Nicholas G. Hall, Zhixin Liu. Capacity allocation games without an initial sequence
750 -- 753Weiwei Wang, Hongmei Bi, Hongwei Liu. A full-Newton step interior-point algorithm for linear optimization based on a finite barrier
754 -- 756Jochen Könemann, Kanstantsin Pashkovich, Justin Toth. An elementary integrality proof of Rothblum's stable matching formulation
757 -- 760Erel Segal-haLevi, Avinatan Hassidim, Yonatan Aumann. Demand-flow of agents with gross-substitute valuations
761 -- 765Minghui Lai, Weili Xue, Lindu Zhao. Cost allocation for cooperative inventory consolidation problems
766 -- 771Stephen R. Chestnut, Margot Naegele, Rico Zenklusen. Refuting a conjecture of Goemans on bounded degree spanning trees
772 -- 774Leah Epstein, Asaf Levin. The benefit of preemption for single machine scheduling so as to minimize total weighted completion time
775 -- 778R. R. Routledge. Information, egalitarianism and the value
779 -- 783Xuemin Ren, Lishang Jiang. Mathematical modeling and analysis of insolvency contagion in an interbank network
784 -- 789Sungjin Im, Hoon Oh, Maryam Shadloo. Minimizing the maximum flow time in batch scheduling
790 -- 795Edouard Pauwels. The value function approach to convergence analysis in composite optimization
796 -- 800Ward Whitt. Heavy-traffic limits for a single-server queue leading up to a critical point
801 -- 807Byung Geun Choi, Napat Rujeerapaiboon, Ruiwei Jiang. Multi-period portfolio optimization: Translation of autocorrelation risk to excess variance
808 -- 811Po-An Chen, Yi-Le Chen, Chi-Jen Lu. Bounds on the price of anarchy for a more general class of directed graphs in opinion formation games
812 -- 817Xing Gao, Weijun Zhong, Chao Huang. Should sophisticated expectations facilitate reaching equilibrium behavior?
818 -- 822Behzad Hezarkhani. Pairwise mergers in bipartite matching games with an application in collaborative logistics
823 -- 825John J. Hasenbein. Order relations for concave interpolation methods
826 -- 830Yan-An Hwang, Bo-Siang Wang. A matrix approach to the associated consistency with respect to the equal allocation of non-separable costs
831 -- 834George J. Kyparisis, Christos Koulamas. New structural properties of supply chains with price-only contracts
835 -- 838Annika Kristina Kiefner. Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology
839 -- 845Benjamin Legros. Unintended consequences of optimizing a queue discipline for a service level defined by a percentile of the waiting time

Volume 44, Issue 5

569 -- 574Elias J. Willemse, Johan W. Joubert. Splitting procedures for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities
575 -- 577Xiaoxi Li, Sylvain Sorin. Uniform value for recursive games with compact action sets
578 -- 586Chi Seng Pun, Chi Chung Siu, Hoi Ying Wong. Non-zero-sum reinsurance games subject to ambiguous correlations
587 -- 591Ehud Lehrer, Eilon Solan, Omri N. Solan. The value functions of Markov decision processes
592 -- 597Xiaoya Xu, Zhaotong Lian, Xin Li, Pengfei Guo. A Hotelling queue model with probabilistic service
598 -- 601Begoña Subiza, José-Manuel Giménez-Gómez, Josep E. Peris. Folk solution for simple minimum cost spanning tree problems
602 -- 606Ward Whitt. A Poisson limit for the departure process from a queue with many busy servers
607 -- 611Emilio Barucci, Daniele Marazzina. Asset management, High Water Mark and flow of funds
612 -- 617Vashist Avadhanula, Jalaj Bhandari, Vineet Goyal, Assaf Zeevi. On the tightness of an LP relaxation for rational optimization and its applications
618 -- 621Jony Rojas Rojas, Francisco Sánchez-Sánchez. On the inverse problem for a subclass of linear, symmetric and efficient values of cooperative TU games
622 -- 624Andreas Dellnitz. RTS-mavericks in data envelopment analysis
625 -- 629Mark Zuckerberg. Geometric proofs for convex hull defining formulations
630 -- 634Sushant Sachdeva, Nisheeth K. Vishnoi. The mixing time of the Dikin walk in a polytope - A simple proof
635 -- 639Stephan Artmann, Friedrich Eisenbrand, Christoph Glanzer, Timm Oertel, Santosh Vempala, Robert Weismantel. A note on non-degenerate integer programs with small sub-determinants
640 -- 644Vikas Vikram Singh, Oualid Jouini, Abdel Lisser. Existence of Nash equilibrium for chance-constrained games
645 -- 648Akaki Mamageishvili, Paolo Penna. Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games
649 -- 654Rishiraj Bhattacharyya. Complexity of the Unconstrained Traveling Tournament Problem
655 -- 657Mohan L. Chaudhry, James J. Kim. Analytically simple and computationally efficient solution to GI/Geom/1 queues involving heavy-tailed distributions
658 -- 662Miao Zhang, Ping Chen. Mean-variance portfolio selection with regime switching under shorting prohibition
663 -- 665Alexander Shapiro, Kerem Ugurlu. Decomposability and time consistency of risk averse multistage programs
666 -- 671Opher Baron, Yoav Kerner. A queueing approach to a multi class M/G/1 make-to-stock with backlog
672 -- 675Matteo Brunelli. On the conjoint estimation of inconsistency and intransitivity of pairwise comparisons
676 -- 679Martin Skutella. A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
680 -- 686Justina Gianatti, Laura S. Aragone, Pablo A. Lotito, Lisandro A. Parente. Solving minimax control problems via nonsmooth optimization
687 -- 691Jia Liu, Abdel Lisser, Zhiping Chen. Stochastic geometric optimization with joint probabilistic constraints
692 -- 695Jung Woo Baek, Ho Woo Lee, Soohan Ahn, Yun Han Bae. Exact time-dependent solutions for the M/D/1 queue

Volume 44, Issue 4

425 -- 429Arnab Sur. Study of M-stationarity and strong stationarity for a class of SMPCC problems via SAA Method
430 -- 435M. M. C. R. Reaiche. A note on sample complexity of multistage stochastic programs
436 -- 442Martin I. Reiman, Haohua Wan, Qiong Wang. On the use of independent base-stock policies in assemble-to-order inventory systems with nonidentical lead times
443 -- 445Flavio Delbono, Luca Lambertini, Luigi Marattin. Strategic delegation under cost asymmetry
446 -- 450Gleb A. Koshevoy, Takamasa Suzuki, Dolf Talman. Supermodular NTU-games
451 -- 456Urtzi Ayesta, Martin Erausquin, Eva Ferreira, Peter Jacko. Optimal dynamic resource allocation to prevent defaults
457 -- 462Qingda Wei, Xian Chen. Continuous-time Markov decision processes under the risk-sensitive average cost criterion
463 -- 468Xin Li. ∗(k)-NCP based on a class of parametric kernel functions
469 -- 473José R. Correa, Victor Verdugo, José Verschae. Splitting versus setup trade-offs for scheduling to minimize weighted completion time
474 -- 478Yule Zhang, Liwei Zhang. On the upper Lipschitz property of the KKT mapping for nonlinear semidefinite optimization
479 -- 486Juan Sebastian Borrero, Colin Gillen, Oleg A. Prokopyev. A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
487 -- 490Philip Ernst. Exercising control when confronted by a (Brownian) spider
491 -- 494Silvia Lorenzo-Freire. On new characterizations of the Owen value
495 -- 497Richard Taylor. Approximation of the Quadratic Knapsack Problem
498 -- 502Krzysztof Szajowski, Mitsushi Tamaki. Shelf life of candidates in the generalized secretary problem
503 -- 506Hassan Hijazi, Leo Liberti. Constraint qualification failure in action
507 -- 513Esa Hyytiä, Rhonda Righter. Routing jobs with deadlines to heterogeneous parallel servers
514 -- 519Gaurav Singh, Christine M. O'Keefe. Decentralised scheduling with confidentiality protection
520 -- 524Tamás Solymosi, Balázs Sziklai. Characterization sets for the nucleolus in balanced games
525 -- 531Yangyang Xie, Xiaoying Liang, Lijun Ma, Houmin Yan. Inventory rationing and markdown strategy in the presence of lead-time sensitive customers
532 -- 534Bara Kim, Jeongsim Kim. Equilibrium strategies for a tandem network under partial information
535 -- 539Asaf Levin, Shmuel Onn. Shifted matroid optimization
540 -- 543Min-Jeong Kim, Yongjae Lee, Jang Ho Kim, Woo Chang Kim. Sparse tangent portfolio selection via semi-definite relaxation
544 -- 549Ali Ajdari, Archis Ghate. Robust spatiotemporally integrated fractionation in radiotherapy
550 -- 556Petr Lachout. Uniformly monotone functions - Definition, properties, characterizations
557 -- 562Zhongjun Tian, Yefeng Wang. Advance selling with preorder-dependent customer valuation
563 -- 567Sang-Yong Kim, Joohyun Kim. Channel-independent throughput-based fair queueing in wireless packet networks

Volume 44, Issue 3

291 -- 296Hoda Bidkhori, David Simchi-Levi, Yehua Wei. Analyzing process flexibility: A distribution-free approach with partial expectations
297 -- 301Konstantin Avrachenkov, Jerzy A. Filar, Vladimir Gaitsgory, Andrew Stillman. Singularly perturbed linear programs and Markov decision processes
302 -- 306Shakoor Muhammad, Vitor N. Coelho, Frederico Gadelha Guimarães, Ricardo H. C. Takahashi. An infeasibility certificate for nonlinear programming based on Pareto criticality condition
307 -- 312Huai-nian Zhu, Cheng-ke Zhang. Finite horizon linear quadratic dynamic games for discrete-time stochastic systems with N-players
313 -- 318Parsiad Azimzadeh, Tommy Carpenter. Fast Engset computation
319 -- 323M. Reza Peyghami, S. Fathi Hafshejani, S. Chen. A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
324 -- 328Fanyong Meng 0001, Qiang Zhang, Xiaohong Chen. A value for games on augmenting systems with a coalition structure
329 -- 335R. B. O. Kerkkamp, Karen Aardal. A constructive proof of Swap Local Search worst-case instances for the Maximum Coverage Problem
336 -- 341Shujun Bi, Shaohua Pan. Error bounds for rank constrained optimization problems and applications
342 -- 347Chen Zhao, Ziyan Luo, Naihua Xiu. Low-order penalty equations for semidefinite linear complementarity problems
348 -- 353Shoude Li. Dynamic optimal control of pollution abatement investment under emission permits
354 -- 358Maciej Drwal, Roman Rischke. Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
359 -- 365Jaron Sanders, Sem C. Borst, A. J. E. M. Janssen, J. S. H. van Leeuwaarden. Optimality gaps in asymptotic dimensioning of many-server systems
366 -- 369Francis J. Vasko, Yun Lu, Kenneth Zyma. What is the best greedy-like heuristic for the weighted set covering problem?
370 -- 373Haitao Wang, Jingru Zhang. A note on computing the center of uncertain data on the real line
374 -- 378Austin Buchanan. Extended formulations for vertex cover
379 -- 382Heinz H. Bauschke, Minh N. Dao, Walaa M. Moursi. The Douglas-Rachford algorithm in the affine-convex case
383 -- 389Josemar Rodrigues, Silvia Maria Prado, N. Balakrishnan, Francisco Louzada. Flexible M/G/1 queueing system with state dependent service rate
390 -- 393Sven Müller, Knut Haase. On the product portfolio planning problem with customer-engineering interaction
394 -- 399Saumya Sinha, Jakob Kotas, Archis Ghate. Robust response-guided dosing
400 -- 402Jan Brinkhuis, Vladimir Protasov. A new proof of the Lagrange multiplier rule
403 -- 408Mehmet Önal. The two-level economic lot sizing problem with perishable items
409 -- 414Ruxian Wang. On the sum-product ratio problem and its applications
415 -- 418Shivam Gupta. On a modification of the VCG mechanism and its optimality
419 -- 424Li Jiang, Zhongyuan Hao. Rationalizing vertical information flow in a bilateral monopoly

Volume 44, Issue 2

153 -- 157Joey Fung, Yakov Zinder. Permutation schedules for a two-machine flow shop with storage
158 -- 164Jean B. Lasserre. A MAX-CUT formulation of 0/1 programs
165 -- 169Stephen Pallone, Peter I. Frazier, Shane G. Henderson. Coupled bisection for root ordering
170 -- 173Matthias Walter, Pelin Damci-Kurt, Santanu S. Dey, Simge Küçükyavuz. On a cardinality-constrained transportation problem with market choice
174 -- 176Chao Xu. Reconstructing edge-disjoint paths faster
177 -- 179Pham Huu Sach. Connectedness in vector equilibrium problems involving cones with possibly empty interior
180 -- 185Jiajin Yu, Shabbir Ahmed. Maximizing expected utility over a knapsack constraint
186 -- 190Nha-Nghi de la Cruz, Hans Daduna. Monotonicity of base stock policies
191 -- 195Neil Olver. A note on hierarchical hubbing for a generalization of the VPN problem
196 -- 198Moshe Haviv, Binyamin Oz. Regulating an observable M/M/1 queue
199 -- 201Thomas Knecht, Dieter Jungnickel. A note on the k-minimum spanning tree problem on circles
202 -- 207Eduard Kromer, Ludger Overbeck. p spaces
208 -- 211Gustavo Bergantiños, Juan D. Moreno-Ternero. A new rule for the problem of sharing the revenue from museum passes
212 -- 218A. Chunxiang, Zhongfei Li, Fan Wang. Optimal investment strategy under time-inconsistent preferences and high-water mark contract
219 -- 224Rajeev R. Tripathi, R. K. Amit. Equivalence nucleolus for coalitional games with externalities
225 -- 230Luis Rademacher, Alejandro Toriello, Juan Pablo Vielma. On packing and covering polyhedra in infinite dimensions
231 -- 233Winston W. Chang, Tai-Liang Chen. Tridiagonal matrices with dominant diagonals and applications
234 -- 237Gerardo Berbeglia. Discrete choice models based on random walks
238 -- 242Moutaz Khouja. Forward-buying and the naive newsvendor
243 -- 249Roberto Cañavate, Mercedes Landete. A polyhedral study on 0-1 knapsack problems with set packing constraints
250 -- 254Dmitriy Kvasov. On sabotage games
255 -- 259Franklin H. J. Kenter. Approximating the minimum rank of a graph via alternating projection
260 -- 266Thai Doan Chuong. Nondifferentiable fractional semi-infinite multiobjective optimization problems
267 -- 272Romain Hollanders, Balázs Gerencsér, Jean-Charles Delvenne, Raphaël M. Jungers. Improved bound on the worst case complexity of Policy Iteration
273 -- 277Leah Epstein. More on batched bin packing
278 -- 284Marcello Braglia, Davide Castellano, Mosè Gallo. An extension of the stochastic Joint-Replenishment Problem under the class of cyclic policies
285 -- 289Martin Branda, Milos Kopa. DEA models equivalent to general Nth order stochastic dominance efficiency tests

Volume 44, Issue 1

1 -- 5Hamed Amini, Damir Filipovic, Andreea Minca. Uniqueness of equilibrium in a payment system with liquidation costs
6 -- 11Grani Adiwena Hanasusanto, Daniel Kuhn, Wolfram Wiesemann. K-adaptability in two-stage distributionally robust binary programming
12 -- 18Xiaoping Lu, Endah R. M. Putri. Finite maturity margin call stock loans
19 -- 24Guillaume Vigeral, Yannick Viossat. Semi-algebraic sets and equilibria of binary games
25 -- 32Kyle Y. Lin, Dashi I. Singham. Finding a hider by an unknown deadline
33 -- 38A. A. Elsadany, A. M. Awad. Dynamical analysis of a delayed monopoly game with a log-concave demand function
39 -- 43Kunikazu Yoda, András Prékopa. Improved bounds on the probability of the union of events some of whose intersections are empty
44 -- 49Guangxin Jiang, Chenglong Xu, Michael C. Fu. On sample average approximation algorithms for determining the optimal importance sampling parameters in pricing financial derivatives on Lévy processes
50 -- 53Yan-An Hwang, Rui-Xian Liao. A dynamic process to the core for multi-choice games
54 -- 58Ana Meca, Greys Sosic. On supremum-norm cost games
59 -- 60Hamza Fawzi, João Gouveia, Richard Z. Robinson. Rational and real positive semidefinite rank can be different
61 -- 66Amir Beck, Luba Tetruashvili, Yakov Vaisbourd, Ariel Shemtov. Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems
67 -- 73Miguel A. Goberna, Vaithilingam Jeyakumar, G. Li, N. Linh. Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
74 -- 79Jianghua Wu, Ananth Iyer, Paul V. Preckel. Information visibility and its impact in a supply chain
80 -- 85D. Antony Tarvin, R. Kevin Wood, Alexandra M. Newman. Benders decomposition: Solving binary master problems by enumeration
86 -- 91Genjiu Xu, Han Dai, Dongshuang Hou, Hao Sun. A-potential function and a non-cooperative foundation for the Solidarity value
92 -- 95Yuan Gao, Jinjiang Yuan. Unary NP-hardness of minimizing total weighted tardiness with generalized due dates
96 -- 100Warut Suksompong. Scheduling asynchronous round-robin tournaments
101 -- 106Misikir Eyob Gebrehiwot, Samuli Aalto, Pasi E. Lassila. Energy-performance trade-off for processor sharing queues with setup delay
107 -- 108Jay Sethuraman. An alternative proof of a characterization of the TTC mechanism
109 -- 113Eran Simhon, Yezekael Hayel, David Starobinski, Quanyan Zhu. Optimal information disclosure policies in strategic queueing games
114 -- 120Dimitris Bertsimas, Ebrahim Nasrabadi, James B. Orlin. On the power of randomization in network interdiction
121 -- 128Lingfei Li, Rafael Mendoza-Arriaga, Daniel Mitchell. Analytical representations for the basic affine jump diffusion
129 -- 135Daniel Wei-Chung Miao, Xenos Chang-Shuo Lin, Steve Hsin-Ting Yu. A note on the never-early-exercise region of American power exchange options
136 -- 142Paul H. Zipkin. Some specially structured assemble-to-order systems
143 -- 147Anna B. Khmelnitskaya, Özer Selçuk, Dolf Talman. The Shapley value for directed graph games
148 -- 151Yogendra Pandey, S. K. Mishra. On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints