default search action
Operations Research Letters, Volume 49
Volume 49, Number 1, January 2021
- Tomohito Fujii, Shuji Kijima
:
Every finite distributive lattice is isomorphic to the minimizer set of an M♮-concave set function. 1-4 - Qimeng Yu
A polyhedral approach to bisubmodular function minimization. 5-10 - Lei Guo
Mathematical programs with multiobjective generalized Nash equilibrium problems in the constraints. 11-16 - Sungjin Im, Benjamin Moseley, Kirk Pruhs
The matroid intersection cover problem. 17-22 - Ioannis Dimitriou
Analysis of the symmetric join the shortest orbit queue. 23-29 - Miguel F. Anjos
A note on the Lasserre hierarchy for different formulations of the maximum independent set problem. 30-34 - Xiaojuan Puyang
Asymptotic efficiency analysis on the modified Paulson's procedure with a PAC guarantee. 35-39 - Henry Lam
Minimax efficient finite-difference stochastic gradient estimators using black-box function evaluations. 40-47 - Manjanna Basappa
The Euclidean k-supplier problem in IR2. 48-54 - Xin Guo, Yi Zhang
A useful technique for piecewise deterministic Markov decision processes. 55-61 - Koen M. J. De Bontridder
Local improvement algorithms for a path packing problem: A performance analysis based on linear programming. 62-68 - Sheldon M. Ross, Sridhar Seshadri:
An optimal stocking problem to minimize the expected time to sellout. 69-75 - Lukasz Kruk
Instability of LAS multiclass queueing networks. 76-80 - Jun Zhao, Jian Ni:
A dynamic analysis of corporate investments and emission tax policy in an oligopoly market with network externality. 81-83 - Qingda Wei, Xian Chen
Average stochastic games for continuous-time jump processes. 84-90 - Ken R. Duffy
MDS coding is better than replication for job completion times. 91-95 - Tangi Migot
On Minty-variational inequalities and evolutionary stable states of generalized monotone games. 96-100 - Augusto Hasman
Does the financial market compensate investors for operational Losses? 101-105 - Thomas A. Weber
Minimum-error classes for matching parts. 106-112 - Gal Mendelson
A lower bound on the stability region of redundancy-d with FIFO service discipline. 113-120 - Derek Singh
Distributionally robust profit opportunities. 121-128 - Alejandro Saavedra-Nieves
Statistics and game theory: Estimating coalitional values in R software. 129-135 - Gábor Pauer
Binary integer modeling of the traffic flow optimization problem, in the case of an autonomous transportation system. 136-143 - Kaarthik Sundar
Piecewise polyhedral formulations for a multilinear term. 144-149 - Qijun Qiu, Li Jiang
Firms can benefit from inaccurate market beliefs. 150-156
Volume 49, Number 2, March 2021
- Jan Karel Lenstra:
Amy Ward new Editor-in-Chief. 1 - Matthew K. Tam
Gearhart-Koshy acceleration for affine subspaces. 157-163 - Jie Zhang
Asymptotic analysis for a stochastic semidefinite programming. 164-170 - Jiejian Feng, Michael Zhang, Jinglei Yang
New necessary and sufficient condition for the irreducibility of joint inventory positions in an assemble-to-order system. 171-175 - Arindam Panja, Pradip Kundu
Stochastic comparisons of lifetimes of series and parallel systems with dependent and heterogeneous components. 176-183 - Jonathan Chamberlain
Strategic revenue management of preemptive versus non-preemptive queues. 184-187 - Sheldon M. Ross:
On the number of tests needed for the pooled testing halving scheme. 188-190 - Chen Jin
Selling multiple units to strategic consumers. 191-196 - Goran Banjac
On the minimal displacement vector of the Douglas-Rachford operator. 197-200 - Dimitris Bertsimas
Near-optimal Nonlinear Regression Trees. 201-206 - Bara Kim, Jeongsim Kim:
Comparison of socially optimal and profit maximizing prices in an unobservable queue with heterogeneous waiting costs. 207-211 - Katsunobu Sasanuma
Approximate performance measures for a single station two-stage reneging queue. 212-217 - Jun Deng, Bin Zou
Quadratic hedging for sequential claims with random weights in discrete time. 218-225 - Alberto Del Pia, Dion Gijswijt
Integer packing sets form a well-quasi-ordering. 226-230 - Caleb Bugg
Logarithmic sample bounds for Sample Average Approximation with capacity- or budget-constraints. 231-238 - Danial Davarnia
Strong relaxations for continuous nonlinear programs based on decision diagrams. 239-245 - Christoph Dürr
Randomized two-valued bounded delay online buffer management. 246-249 - Jason Rhuggenaath
Maximizing revenue for publishers using header bidding and ad exchange auctions. 250-256 - Coulter Beeson, Neil Olver:
A short proof of convexity of step-out-step-in sequencing games. 257-259 - Ben Amiet
When "Better" is better than "Best". 260-264 - Jie Jiang
On complexity of multistage stochastic programs under heavy tailed distributions. 265-269 - Vsevolod A. Afanasev
The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable. 270-277 - Wenzhong Li, Genjiu Xu
A dynamic transfer scheme deriving from the dual similar associated game. 278-282 - Nguyen Van Hung
A novel approach to Hölder continuity of a class of parametric variational-hemivariational inequalities. 283-289
Volume 49, Number 3, May 2021
- Amy R. Ward:
Editorial. 1 - Christos Ordoudis, Viet Anh Nguyen, Daniel Kuhn, Pierre Pinson
Energy and reserve dispatch with distributionally robust joint chance constraints. 291-299 - Yajing Chen
On the equivalence of the Boston and top trading cycles school choice mechanisms. 300-303 - Tatsuya Matsuoka, Naoto Ohsaka
Spanning tree constrained determinantal point processes are hard to (approximately) evaluate. 304-309 - Steffen Borgwardt
A note on the approximability of deepest-descent circuit steps. 310-315 - Ward Whitt
On the many-server fluid limit for a service system with routing based on delayed information. 316-319 - Refael Hassin, Nikita Leshenko:
Greedy Differencing Edge-Contraction heuristic for the Max-Cut problem. 320-325 - Sampath Rajagopalan, Chunyang Tong
Payment models to coordinate healthcare providers: Extension to risk-averse providers. 326-332 - Mircea Balaj
Existence results for quasi-equilibrium problems under a weaker equilibrium condition. 333-337 - Prakash Chakraborty
A many-server functional strong law for a non-stationary loss model. 338-344 - Bobby S. Nyotta, Fernanda Bravo
Computing the conditional entry-state distribution in Erlang loss systems. 345-349 - Jing Xu
Lose oneself in comparison: An investment and consumption game between two agents. 350-356 - Daniel Bienstock
Pitch, extension complexity, and covering problems. 357-364 - Abbas Kazerouni, Lawrence M. Wein
Best arm identification in generalized linear bandits. 365-371 - Xue Dong He, Zhaoli Jiang
Optimal payoff under the generalized dual theory of choice. 372-376 - Karan N. Chadha, Ankur A. Kulkarni
Efficiency fairness tradeoff in battery sharing. 377-384 - Rodolfo Ayala Lopes
Local Search with Groups of Step Sizes. 385-392 - Benjamin Legros
Transient analysis of an affine Queue-Hawkes process. 393-399 - Alan M. Frieze, Tomasz Tkocz
Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects. 400-404 - Sungjin Im, Benjamin Moseley, Rudy Zhou
The Matroid Cup Game. 405-411 - Matthias Claus
On continuity in risk-averse bilevel stochastic linear programming with random lower level objective function. 412-417 - Christian Ewerhart
A class of N-player Colonel Blotto games with multidimensional private information. 418-425 - Michal Benelli
Rational joining behavior in a queueing system with abandonments. 426-430 - Hoa T. Bui
A note on the finite convergence of alternating projections. 431-438 - Aner Sela:
Reverse contests. 439-441
Volume 49, Number 4, July 2021
- Lei Fang, Sai Zhao
Strategic delegation in a differentiated duopoly with asymmetric costs. 443-446 - Martina Cerulli
Polynomial programming prevents aircraft (and other) conflicts. 447-451 - Cheik Traoré
Sequential convergence of AdaGrad algorithm for smooth convex optimization. 452-458 - Josu Doncel
Optimal performance of parallel-server systems with job size prediction errors. 459-464 - Najakorn Khajonchotpanya
A revised approach for risk-averse multi-armed bandits under CVaR criterion. 465-472 - Yongling Gao
Incentivizing the adoption of electric vehicles under subsidy schemes: A duopoly analysis. 473-476 - Zhenyu Cui, Chihoon Lee
On the optimal design of the randomized unbiased Monte Carlo estimators. 477-484 - Zhongbin Wang, Jinting Wang
The effect of information on queue-scalping service systems. 485-491 - Daniel Li Li, Erfang Shan:
Egalitarian allocation and players of certain type. 492-495 - Jianru Zhang
Salesforce contracting under model uncertainty. 496-500 - Orcun Karaca
A market-based approach for enabling inter-area reserve exchange. 501-506 - Ariel Kulik
A refined analysis of submodular Greedy. 507-514 - Xianghui Zhong
On the approximation ratio of the 3-Opt algorithm for the (1, 2)-TSP. 515-521 - Seth Brown, Wenxin Zhang, Temitayo Ajayi
A Gilmore-Gomory construction of integer programming value functions. 522-529 - Trivikram Dokka
On the complexity of surrogate and group relaxation for integer linear programs. 530-534 - Qing Li
The secretary problem with multiple job vacancies and batch candidate arrivals. 535-542 - Arezu Zare
Quadratic double-ratio minimax optimization. 543-547 - Xiao-Bing Li, Suliman Al-Homidan, Qamrul Hasan Ansari
A sufficient condition for asymptotically well behaved property of convex polynomials. 548-552 - Alessio Trivella
Socially responsible merchant operations: Comparison of shutdown-averse CVaR and anticipated regret policies. 553-558 - Dorit S. Hochbaum
Complexity, algorithms and applications of the integer network flow with fractional supplies problem. 559-564 - Cyrille W. Combettes
Complexity of linear minimization and projection on some sets. 565-571 - Naoyuki Kamiyama, Pasin Manurangsi, Warut Suksompong:
On the complexity of fair house allocation. 572-577 - Bo Wei, Dacheng Yao
Ergodic inventory control with diffusion demand and general ordering costs. 578-585 - Adam N. Letchford
Strengthened clique-family inequalities for the stable set polytope. 586-589 - Vacharapat Mettanant
Fair resource allocation for demands with sharp lower tail inequalities. 590-596 - Muhammad Maaz
Saturating stable matchings. 597-601 - Meichun Lin
Multi-period lot-sizing with supplier selection: Structural results, complexity and algorithms. 602-609 - Laura Galli
A separation algorithm for the simple plant location problem. 610-615 - Daniela Hurtado-Lange
Throughput and delay optimality of power-of-d choices in inhomogeneous load balancing systems. 616-622 - Matthias Walter
The Graphical Traveling Salesperson Problem has no integer programming formulation in the original space. 623-624
Volume 49, Number 5, September 2021
- Hong-Fa Cheng, Kun Zhang
Non-nested estimators for the central moments of a conditional expectation and their convergence properties. 625-632 - Trung Thanh Nguyen
A PTAS for a class of binary non-linear programs with low-rank functions. 633-638 - S. Srivatsa Srinivas
To incentivize the fast server or not? Firm's dilemma when queue signals service rate in high-contact services. 639-644 - Martijn van Ee
A 12/7-approximation algorithm for the discrete Bamboo Garden Trimming problem. 645-649 - Geoffrey W. Brown, Narayanaswamy Balakrishnan:
Busy periods of discrete-time queues using the Lagrange implicit function theorem. 650-654 - Yuri Faenza, Ioannis Mourtos
(Un)stable matchings with blocking costs. 655-662 - Donggyu Jeon, Michael K. Lim
Got organic milk? Joint inventory model with supply uncertainties and partial substitution. 663-670 - Antonio Frangioni, Stefania Pan, Emiliano Traversi
A constraints-aware Reweighted Feasibility Pump approach. 671-675 - Alexander Shapiro
Central limit theorem and sample complexity of stationary stochastic programs. 676-681 - Attila Lovas
Ergodic theorems for queuing systems with dependent inter-arrival times. 682-687 - Hannan Amoozad Mahdiraji
Differential game approach to pricing and advertising decisions. 688-695 - Carlos Andrés Gamboa
Decomposition methods for Wasserstein-based data-driven distributionally robust problems. 696-702 - Christoph Buchheim, Dorothee Henke
On the complexity of robust bilevel optimization with uncertain follower's objective. 703-707 - Benjamin Legros
Age-based Markovian approximation of the G/M/1 queue. 708-714 - Konstantinos Gkillas
Transaction activity and bitcoin realized volatility. 715-719 - Yakov Babichenko, Segev Shlomov
Robust learning in social networks via matrix scaling. 720-727 - Huiwen Jia
Multi-armed bandit with sub-exponential rewards. 728-733 - Eugene A. Feinberg
MDPs with setwise continuous transition probabilities. 734-740 - Bram de Jonge
Condition-based maintenance optimization based on matrix algebra. 741-747 - Bernardo F. Quiroga
Nonparametric identification and estimation of score auctions in multi-attribute procurement. 748-751 - Yasmine Beck
A robust approach for modeling limited observability in bilevel optimization. 752-758 - Ilia Shilov
Privacy impact on generalized Nash equilibrium in peer-to-peer electricity market. 759-766 - Yang Song, Huijun Lu
Exact tail asymptotics for the Israeli queue with retrials and non-persistent customers. 767-771 - Jizhou Lu
Information sharing and information errors with noninferable demand. 772-776 - Yinping You, Li Fan, Xiaohu Li:
On redundant weighted voting systems with components having stochastic arrangement increasing lifetimes. 777-784 - José R. Correa, Matías Romero
On the asymptotic behavior of the expectation of the maximum of i.i.d. random variables. 785-786 - Matteo Böhm
Algorithms for fair k-clustering with multiple protected attributes. 787-789 - Naoyuki Kamiyama:
Envy-free matchings with one-sided preferences and matroid constraints. 790-794 - Hou-Duo Qi
On the long-only minimum variance portfolio under single factor model. 795-801 - Alexander Eckl, Anja Kirschbaum, Marilena Leichter
A stronger impossibility for fully online matching. 802-808 - Alexander Shapiro
Distributionally robust Optimal Control and MDP modeling. 809-814 - Alexis Akira Toda
Perov's contraction principle and dynamic programming with stochastic discounting. 815-819
Volume 49, Number 6, November 2021
- Yue Tang
A queueing model for customer rescheduling and no-shows in service systems. 821-828 - Michael N. Katehakis
On the evaluation of bidding strategies in sequential auctions. 829-836 - Jiyoung Im
A strengthened Barvinok-Pataki bound on SDP rank. 837-841 - Joseph Cheriyan, R. Ravi
A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs. 842-843 - Thiago Alcântara Luiz
Cover by disjoint cliques cuts for the knapsack problem with conflicting items. 844-850 - Hongtao Zhu, Pengxiang Pan
The restricted Chinese postman problems with penalties. 851-854 - Orcun Karaca
Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid. 855-861 - Tatsuaki Kimura
A heavy-traffic-limit formula for the moments of the stationary distribution in GI/G/1-type Markov chains. 862-867 - Johannes O. Royset, Ji-Eun Byun
Gradients and subgradients of buffered failure probability. 868-873 - Miguel Ángel Marfurt Alarcón
Improved approximation for the capacitated inventory access point problem. 874-876 - Douglas G. Down
Single-item lot-sizing with quantity discount and bounded inventory. 877-882 - Gabriel Haeser
On constraint qualifications for second-order optimality conditions depending on a single Lagrange multiplier. 883-889 - Guang Zhang
Adaptive allocation rules for hypergraph games. 890-895 - Matthias Brugger
Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes. 896-901 - Igor Averbakh
The pairwise flowtime network construction problem. 902-907 - Dusan Knop
Parameterized complexity of configuration integer programs. 908-913 - Dahai Cai, Yucheng Dong, Meng Wu
Can loss aversion explain sourcing diversification under supply risk? 914-919
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: