default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research Letters, Volume 47
Volume 47, Number 1, January 2019
- Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Constrained submodular maximization via greedy local search. 1-6 - Cong Chen
, Yinfeng Xu:
Selfish load balancing for jobs with favorite machines. 7-11 - Matteo Brunelli, Jafar Rezaei:
A multiplicative best-worst method for multi-criteria decision making. 12-15 - Ravi Kumar Kolla, Prashanth L. A., Sanjay P. Bhat, Krishna P. Jagannathan:
Concentration bounds for empirical conditional value-at-risk: The unbounded case. 16-20 - André B. Chassein, Marc Goerigk:
On the complexity of robust geometric programming with polyhedral uncertainty. 21-24 - José Correa, Patricio Foncea, Dana Pizarro, Victor Verdugo:
From pricing to prophets, and back! 25-29 - Rui Chen, Hai Jiang:
Capacitated assortment and price optimization under the multilevel nested logit model. 30-35 - Qingwen Hu:
Bullwhip effect in a supply chain model with multiple delivery delays. 36-40 - Hongjun Wei, Jinjiang Yuan:
Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time. 41-46 - Pierre Aboulker, Samuel Fiorini, Tony Huynh, Marco Macchia, Johanna Seif:
Extension complexity of the correlation polytope. 47-51 - Karthick Gopalswamy, Yahya Fathi, Reha Uzsoy:
Valid inequalities for concave piecewise linear regression. 52-58 - Ali Mohammad Nezhad, Tamás Terlaky:
A rounding procedure for semidefinite optimization. 59-65 - Yusuke Kobayashi, Ryo Sako:
Two disjoint shortest paths problem with non-negative edge length. 66-69 - Marinus Gottschau, Marcus Kaiser, Clara Waldmann:
The undirected two disjoint shortest paths problem. 70-75
Volume 47, Number 2, March 2019
- Hongwei Bi, Wei Zhu:
The non-integer higher-order Stochastic dominance. 77-82 - Adam N. Letchford, Georgia Souli:
On lifted cover inequalities: A new lifting procedure with unusual properties. 83-87 - Martin Gairing, Max Klimm:
Greedy metric minimum online matchings with random arrivals. 88-91 - Mehmet Murat Fadiloglu, Önder Bulut:
An embedded Markov chain approach to stock rationing under batch orders. 92-98 - Ward Whitt, Wei You:
The advantage of indices of dispersion in queueing approximations. 99-104 - Thai Doan Chuong:
Exact relaxations for parametric robust linear optimization problems. 105-109 - Anurag Jayswal, Izhar Ahmad, Babli Kumari:
Vector variational inequalities on Hadamard manifolds involving strongly geodesic convex functions. 110-114 - Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das:
The 1-dimensional discrete Voronoi game. 115-121 - Manfred Besner:
Weighted Shapley hierarchy levels values. 122-126 - Zhigang Cao, Xiaoguang Yang:
Ordinally symmetric games. 127-129 - Tong Zhang, Stan Uryasev, Yongpei Guan:
Derivatives and subderivatives of buffered probability of exceedance. 130-132 - Jasper de Jong, Marc Uetz:
The sequential price of anarchy for affine congestion games with few players. 133-139 - Esa Hyytiä:
Last in line. 140-145 - Zhe Wang, Yi Zhou, Yingbin Liang, Guanghui Lan:
A note on inexact gradient and Hessian conditions for cubic regularized Newton's method. 146-149
Volume 47, Number 3, May 2019
- Masaya Tano, Ryuhei Miyashiro, Tomonari Kitahara:
Steepest-edge rule and its number of simplex iterations for a nondegenerate LP. 151-156 - Gang Chen, Zaiming Liu, Jingchuan Zhang:
The effect of D-policy on the strategic customer behavior in M∕G∕1 queues. 157-161 - Raneetha Abeywickrama, Moshe Haviv, Binyamin Oz, Ilze Ziedins:
Strategic bidding in a discrete accumulating priority queue. 162-167 - Yu Han, San-hua Wang, Nan-Jing Huang:
Arcwise connectedness of the solution sets for set optimization problems. 168-172 - Song Huang, Wenqiang Xiao, Jun Yang:
Optimal contracts under endogenous demand information acquisition. 173-177 - Dominika Machowska:
Delayed effects of cooperative advertising in goodwill dynamics. 178-184 - Giulio Galvan, Matteo Lapucci:
On the convergence of inexact augmented Lagrangian methods for problems with convex constraints. 185-189 - Yajing Chen, Zhenhua Jiao, Ziyang Shen, Guoqiang Tian:
Affirmative action under common school priorities: The top trading cycles mechanism case. 190-196 - Ryan J. O'Neil, Karla Hoffman:
Decision diagrams for solving traveling salesman problems with pickup and delivery in real time. 197-201 - Yan Su, Junping Li, Yanyun Li:
Optimality of admission control in a repairable queue. 202-207 - Hongbo Dong:
On integer and MPCC representability of affine sparsity. 208-212 - Franziska Eberle, Felix A. Fischer, Jannik Matuschke, Nicole Megow:
On index policies for stochastic minsum scheduling. 213-218 - Adam Diamant, Opher Baron:
Double-sided matching queues: Priority and impatient customers. 219-224 - Vera Traub, Jens Vygen:
An improved upper bound on the integrality ratio for the s-t-path TSP. 225-228
Volume 47, Number 4, July 2019
- Jingyong Tang, Jinchuan Zhou:
A quadratically convergent descent method for the absolute value equation Ax+B|x|=b. 229-234 - Baris Vardar, Georges Zaccour:
Strategic bilateral exchange of a bad. 235-240 - Zuosong Liang, Erfang Shan, Huiyu Xing, Chunsong Bai:
A linear-time algorithm for clique-coloring planar graphs. 241-243 - Yang Woo Shin:
Asymptotic mean and variance of departures in an M∕G∕1∕K+1 queue. 244-249 - Belleh A. Fontem, Burcu B. Keskin, Sharif H. Melouk, Carley Vaughn:
An exact decomposition algorithm for a chance-constrained new product risk model. 250-256 - Dohyun Ahn, Kyoung-Kuk Kim:
Optimal intervention under stress scenarios: A case of the Korean financial system. 257-263 - Dipankar Mondal, N. Selvaraju:
A note on a mean-lower partial moment CAPM without risk-free asset. 264-269 - Youcheng Lou:
On the investment direction of a behavioral portfolio choice model. 270-273 - Erik Diessel, Heiner Ackermann:
Domino sequencing: Scheduling with state-based sequence-dependent setup times. 274-280 - Lawrence W. Robinson, Srinagesh Gavirneni:
Retailer order commitments improve distribution supply chain performance. 281-287 - Mohit Singh:
Integrality gap of the vertex cover linear programming relaxation. 288-290 - Benar Fux Svaiter:
A simplified proof of weak convergence in Douglas-Rachford method. 291-293 - Xialiang Dou, Mihai Anitescu:
Distributionally robust optimization with correlated data from vector autoregressive processes. 294-299 - Loe Schlicher, Marieke Musegaas, Evelot Westerink-Duijzer:
Resource location games. 300-304 - Zhongyuan Hao, Li Jiang:
Direct selling by suppliers improves system-wide information flow. 305-310 - Amin Dehghanian, Jeffrey P. Kharoufeh:
Optimal stopping with a capacity constraint: Generalizing Shepp's urn scheme. 311-316 - Chiwei Yan, Prem Swaroop, Michael O. Ball, Cynthia Barnhart, Vikrant Vaze:
Majority judgment over a convex candidate space. 317-325 - Geofferey Jiyun Kim, Bara Kim, Jeongsim Kim:
Equilibrium in a war of attrition with an option to fight decisively. 326-330
Volume 47, Number 5, September 2019
- Li Chen, Chengyu Wu:
Open-loop policies in Bayesian dynamic pricing: Some counter-intuitive observations and insights. 331-338 - Siao-Leu Phouratsamay, T. C. E. Cheng:
The single-item lot-sizing problem with two production modes, inventory bounds, and periodic carbon emissions capacity. 339-343 - Haris Aziz:
Algorithms for Pareto optimal exchange with bounded exchange cycles. 344-347 - Christopher Hojny, Hendrik Lüthen, Marc E. Pfetsch:
Sparsity of integer formulations for binary programs. 348-352 - Adam N. Letchford, Georgia Souli:
New valid inequalities for the fixed-charge and single-node flow polytopes. 353-357 - Ahmad Abdi, Gérard Cornuéjols:
Idealness and 2-resistant sets. 358-362 - Shiran Rachmilevitch:
On the difficulty of extending the coco value to games with more than two players. 363-365 - Gustavo Bergantiños, Adriana Navarro-Ramos:
A characterization of the folk rule for multi-source minimal cost spanning tree problems. 366-370 - Milad Asadpour, Hadi Shirouyehzad:
Performance evaluation and ranking of Academy Award winners for Best Original Score applying Data Envelopment Analysis: 1990-2016. 371-376 - Vijay Kamble:
Revenue management on an on-demand service platform. 377-385 - Jack Brimberg, Zvi Drezner:
Solving multiple facilities location problems with separated clusters. 386-390 - Benjamin Legros:
Transient analysis of a Markovian queue with deterministic rejection. 391-397 - Sang Won Bae:
Computing a minimum-width cubic and hypercubic shell. 398-405 - Yasuhito Tanaka:
A dynamic free-entry oligopoly with sluggish entry and exit adjustments. 406-409 - Yanyi Xu, Sang-Phil Kim, Arnab Bisi, Suresh Chand, Maqbool Dada:
Structural properties of the lost sales problem with fractional lead times. 410-416 - Edmond J. Vanderperre, Stanislav S. Makhanov:
Point availability of Gaver's duplex system supervised by a safety device unit. 417-420 - Nadav Hallak, Marc Teboulle:
A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization. 421-426 - Kristoffer Lindensjö:
A regular equilibrium solves the extended HJB system. 427-432 - Byung-Cheon Choi, Yunhong Min, Myoung-Ju Park:
Strong NP-hardness of minimizing total deviation with generalized and periodic due dates. 433-437 - Franklyn Wang, Ravi Jagadeesan, Scott Duke Kominers:
Optimizing reserves in school choice: A dynamic programming approach. 438-446 - Zhongbin Wang, Jinting Wang:
Pre-commitment or post-payment: Which worsens a line-sitting firm's revenue? 447-451 - Xiaolong Li, Jiannan Ke:
Robust assortment optimization using worst-case CVaR under the multinomial logit model. 452-457 - Matthias Walter, Stefan Weltge:
Extended formulations for radial cones. 458-463
Volume 47, Number 6, November 2019
- Ying Cao, Zuo-Jun Max Shen:
Quantile forecasting and data-driven inventory management under nonstationary demand. 465-472 - Tao Jiang, Lu Liu, Qingqing Ye, Xudong Chai:
Tail asymptotics for service systems with transfers of customers in an alternating environment. 473-477 - Vasily V. Gusev, Vladimir V. Mazalov:
Potential functions for finding stable coalition structures. 478-482 - Onno J. Boxma, David Perry, Wolfgang Stadje:
The (S-1, S) inventory model and its counterparts in queueing theory. 483-488 - Ramez Kian, Emre Berk, Ülkü Gürler:
Minimal conic quadratic reformulations and an optimization model. 489-493 - Daniel Bienstock, Abhinav Verma:
Strong NP-hardness of AC power flows feasibility. 494-501 - Mathieu Martin, Zéphirin Nganmeni:
The finagle point might not be within the ϵ-core. 502-506 - Wenbo Chen, Huixiao Yang:
Assortment planning for vertically differentiated products under a consider-then-choose model. 507-512 - Mariska Heemskerk, Michel Mandjes:
Exact asymptotics in an infinite-server system with overdispersed input. 513-520 - Vladimir Dvorkin Jr., Jalal Kazempour, Pierre Pinson:
Electricity market equilibrium under information asymmetry. 521-526 - Stefano Colombo:
Strategic delegation under cost asymmetry revised. 527-529 - N. H. Chieu, Thai Doan Chuong, V. Jeyakumar, Guoyin Li:
A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints. 530-536 - Matteo Cosmi, Gianpaolo Oriolo, Veronica Piccialli, Paolo Ventura:
Single courier single restaurant meal delivery (without routing). 537-541 - Tatsuaki Kimura, Hiroyuki Masuyama, Yutaka Takahashi:
Corrigendum to "Heavy-Traffic Asymptotics for Stationary GI/G/1-Type Markov Chains" [Oper. Res. Lett. 40 (2012) 185-189]. 542-545 - Venus Lo, Huseyin Topaloglu:
Assortment optimization under the multinomial logit model with product synergies. 546-552 - Vincent Leclère:
Epiconvergence of relaxed stochastic optimization problems. 553-559 - Michela Chessa:
A Shapley-based Groves mechanism: when the mechanism designer plays the wise man. 560-564 - Denis Cornaz, Fabio Furini, Enrico Malaguti, Alberto Santini:
A note on selective line-graphs and partition colorings. 565-568 - Refail Kasimbeyli, Masoud Karimi:
Separation theorems for nonconvex sets and application in optimization. 569-573 - Erfang Shan, Jiayu Han, Jilei Shi:
The efficient proportional Myerson values. 574-578 - Ting-Yu Ho, Shan Liu, Zelda B. Zabinsky:
A branch and bound algorithm for dynamic resource allocation in population disease management. 579-586 - Niv Buchbinder, Roy Schwartz, Baruch Weizman:
A simple algorithm for the multiway cut problem. 587-593 - Chengcheng Liu, John J. Hasenbein:
Naor's model with heterogeneous customers and arrival rate uncertainty. 594-600 - Joey Huchette, Juan Pablo Vielma:
A geometric way to build strong mixed-integer programming formulations. 601-606 - Qiulan Zhao, Jinjiang Yuan:
A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine. 607-610 - Pasi E. Lassila, Samuli Aalto:
On energy-aware M/G/1-LAS queue with batch arrivals. 611-617 - Jose H. Blanchet, Nian Si:
Optimal uncertainty size in distributionally robust inverse covariance estimation. 618-621 - Stefano Coniglio, Fabio D'Andreagiovanni, Fabio Furini:
A lexicographic pricer for the fractional bin packing problem. 622-628 - Onno J. Boxma, Offer Kella, Liron Ravner:
Fluid queues with synchronized output. 629-635
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 2026-09-03 22:39 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
