default search action
Operations Research Letters, Volume 48
Volume 48, Number 1, January 2020
- Shiran Rachmilevitch:
Discounting-sensitivity in symmetric repeated games: An example. 1-3 - Anna Castañer
, Jesús Marín-Solano
An agreeable collusive equilibrium in differential games with asymmetric players. 4-8 - Xiangyin Kong
Optimal policy for inventory systems with capacity commitment and fixed ordering costs. 9-17 - Yann Disser, Jannik Matuschke
The complexity of computing a robust flow. 18-23 - Shaojie Tang, Jing Yuan
Influence maximization with partial feedback. 24-28 - Sven O. Krumke, Le Huy Minh
Robust absolute single machine makespan scheduling-location problem on trees. 29-32 - Anthony Downward, Oscar Dowson, Regan Baucke:
Stochastic dual dynamic programming with stagewise-dependent objective uncertainty. 33-39 - Amarjit Kundu, Shovan Chowdhury:
On stochastic comparisons of series systems with heterogeneous dependent and independent location-scale family distributed components. 40-47 - Yogesh Kumar Agarwal
A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries. 48-54 - René van den Brink
The Shapley value, the Proper Shapley value, and sharing rules for cooperative ventures. 55-60 - Lei Wang, Cui Liu, Hongwei Gao, Chong Lin
Strongly strategic support of cooperative solutions for games over event trees. 61-66 - Julia Gaudio
An improved lower bound for the Traveling Salesman constant. 67-70 - Ioannis Papachristos
Optimal server assignment in a two-stage tandem queueing system. 71-77 - Dimitris Bertsimas, Ryan Cory-Wright
On polyhedral and second-order cone decompositions of semidefinite optimization problems. 78-85 - Alejandro Saavedra-Nieves
A multi-agent inventory problem with general transportation costs. 86-92 - Galit Ashkenazi-Golan, Eilon Solan
Characterizing the value functions of polynomial games. 93-95 - Yonghui Huang, Zhaotong Lian, Xianping Guo:
Risk-sensitive finite-horizon piecewise deterministic Markov decision processes. 96-103
Volume 48, Number 2, March 2020
- Ruhul Ali Khan
A change point estimation problem related to age replacement policies. 105-108 - Alice Paul, David P. Williamson:
Easy capacitated facility location problems, with connections to lot-sizing. 109-114 - Jan Harold Alcantara, Chen-Han Lee, Chieu Thanh Nguyen, Yu-Lin Chang, Jein-Shan Chen
On construction of new NCP functions. 115-121 - Radoslav Harman
On greedy heuristics for computing D-efficient saturated subsets. 122-129 - Hongcan Lin, David Saunders, Chengguo Weng:
BSDE approach to utility maximization with square-root factor processes. 130-135 - Petra Vis, René Bekker, Robert D. van der Mei, R. Núñez Queija
Heavy-traffic limits for Discriminatory Processor Sharing models with joint batch arrivals. 136-141 - Daniel Li Li, Erfang Shan:
The Myerson value for directed graph games. 142-146 - Jun Pei, Amir Motaei, Petar Momcilovic:
A note on a limit interchange for many-server queues. 147-151 - Ole Bueker, Bara Kim, Jeongsim Kim:
Customer equilibrium and optimal pricing in an M/G/1 queue with heterogeneous rewards and waiting cost rates. 152-156 - Jian Yu, Dingtao Peng:
Generic stability of Nash equilibria for noncooperative differential games. 157-162 - Raad Salman
Branch-and-bound for the Precedence Constrained Generalized Traveling Salesman Problem. 163-166 - Yuan Yuan
A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows. 167-169 - Yongwu Li, Zhongfei Li, Shouyang Wang
Dividend optimization for jump-diffusion model with solvency constraints. 170-175 - Will Ma, Balasubramanian Sivan:
Separation between second price auctions with personalized reserves and the revenue optimal auction. 176-179 - Morteza Davari
The multi-league sports scheduling problem, or how to schedule thousands of matches. 180-187 - Liguo Jiao
A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials. 188-194 - Fengjun Liu, Yingjie Niu, Zhentao Zou:
Incomplete markets, Knightian uncertainty and high-water marks. 195-201
Volume 48, Number 3, May 2020
- Dimitris Bertsimas, Michael Lingzhi Li:
Scalable holistic linear regression. 203-208 - Burak Cavdaroglu
Determining matchdays in sports league schedules to minimize rest differences. 209-216 - David A. Cohen, Martin C. Cooper
Steepest ascent can be exponential in bounded treewidth problems. 217-224 - Lars Schewe
A decomposition heuristic for mixed-integer supply chain problems. 225-232 - Stéphane R. A. Barde, Young Myoung Ko, Hayong Shin:
Fitting discrete phase-type distribution from censored and truncated observations with pre-specified hazard sequence. 233-239 - Adam N. Letchford, Georgia Souli:
Valid inequalities for mixed-integer programmes with fixed charges on sets of variables. 240-244 - Samuel C. Gutekunst, David P. Williamson:
Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP. 245-248 - Aditya Vedantam
An analysis of voluntary recycled content claims under demand benefit and uncertain recycled input supply. 249-256 - Daojian Yang, Xiujie Zhang
Omnichannel operations with ship-from-store. 257-261 - Eilon Solan
Logit equilibrium as an approximation of Nash equilibrium. 262-265 - Francisco Javier Zaragoza Martínez:
Postman problems on series-parallel mixed graphs. 266-270 - Arturo Berrones-Santos
Dual mean field annealing scheme for binary optimization under linear constraints. 271-277 - Archis Ghate:
Inverse optimization in semi-infinite linear programs. 278-285 - Bikramaditya Datta:
Investment timing, agency and overconfidence. 286-290 - Bing Lin, Jianjun Xu, Shaoxiang Chen
A hybrid model for airline seat inventory control of the multi-leg problems. 291-296 - Stephen E. Wright, Sooyeong Lim:
Solving nested-constraint resource allocation problems with an interior point method. 297-303 - Moshe Haviv, Eyal Winter:
An optimal mechanism charging for priority in a queue. 304-308 - Dorothée Honhon
In-Out Algorithm for assortment planning under a ranking-based consumer choice model. 309-316 - Yan Su
Bias optimality of admission control in a non-stationary repairable queue. 317-322 - Steffen Borgwardt
An implementation of steepest-descent augmentation for linear programs. 323-328 - Temitayo Ajayi, Varun Suriyanarayana, Andrew J. Schaefer
Theorems of the alternative for conic integer programming. 329-335 - Mathieu Martin, Zéphirin Nganmeni
A note on the finesse point. 336-341 - David T. Mildebrath, Victor Gonzalez
Relating single-scenario facets to the convex hull of the extensive form of a stochastic single-node flow polytope. 342-349 - Ali Eshragh
An analytical bound on the fleet size in vehicle routing problems: A dynamic programming approach. 350-355 - Hao-Hsiang Wu
An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions. 356-361 - Daniele Catanzaro
An information theory perspective on the balanced minimum evolution problem. 362-367 - Mark van der Boor
Zero-wait load balancing with sparse messaging. 368-375 - Ryan Cory-Wright
On stochastic auctions in risk-averse electricity markets with uncertain supply. 376-384 - Sylvain Béal, Florian Navarro
Necessary versus equal players in axiomatic studies. 385-391
Volume 48, Number 4, July 2020
- Sha Liao
Coping with the Renewable Portfolio Standards: A utility's perspective. 393-396 - Moris S. Strub
A note on monotone mean-variance preferences for continuous processes. 397-400 - Stefan Hougardy, Fabian Zaiser
The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem. 401-404 - Alessandro Agnetis, Thomas Lidbetter:
The Largest-Z-ratio-First algorithm is 0.8531-approximate for scheduling unreliable jobs on m parallel machines. 405-409 - Marcin Wnuk
Note on pairwise negative dependence of randomly shifted and jittered rank-1 lattices. 410-414 - Chenbo Zhu
An efficient approach for dual sourcing inventory systems with Tailored Base-Surge policies. 415-420 - Jaemin Kim, Babak Lotfaliei:
Debt recapitalization and value in waiting to finance a project. 421-427 - Guangjing Yang, Hao Sun, Marc Uetz:
Cooperative sequencing games with position-dependent learning effect. 428-434 - Zhentao Zou:
Optimal dividend-distribution strategy under ambiguity aversion. 435-440 - Jinyu Dai:
On globally solving the extended trust-region subproblems. 441-445 - Benjamin Heymann
How to bid in unified second-price auctions when requests are duplicated. 446-451 - David Van Bulck
On the complexity of pattern feasibility problems in time-relaxed sports timetabling. 452-459 - Wenbo Ma
A distributionally robust area under curve maximization model. 460-466 - Charles Audet
Binary, unrelaxable and hidden constraints in blackbox optimization. 467-471 - Hans Raj Tiwary
On the extension complexity of scheduling polytopes. 472-479 - Hossein Salmei, Mohammad Ali Yaghoobi
Improving the min-max method for multiobjective programming. 480-486 - Michel Grabisch
k-additive upper approximation of TU-games. 487-492 - Belleh A. Fontem:
Constrained maximum variance stopping for a finite horizon increasing random walk. 493-499 - Wei Geng:
Designing a referral reward program in freemium: The role of network externalities. 500-504 - Oscar Dowson, David P. Morton, Bernardo K. Pagnoncelli:
Partially observable multistage stochastic programming. 505-512 - Weijun Xie
Tractable reformulations of two-stage distributionally robust linear programs over the type-∞ Wasserstein ball. 513-523 - Zhixin Liu
Scheduling with partial rejection. 524-529 - Jonathan Chamberlain
Social welfare and price of anarchy in preemptive priority queues. 530-533 - Inés Jiménez
Risk quantification and validation for Bitcoin. 534-541
Volume 48, Number 5, September 2020
- Eugene A. Feinberg
Complexity bounds for approximately solving discounted MDPs by value iterations. 543-548 - Jin Gi Kim, Bong-Gyu Jang, Seyoung Park:
Annuitization and asset allocation with borrowing constraint. 549-551 - Attahiru Sule Alfa
Discrete time Markov chain model for age of information. 552-557 - A. Hedayat, H. Mohebi:
Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications. 558-565 - Edward J. Anderson
When can we improve on sample average approximation for stochastic optimization? 566-572 - Haris Aziz
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation. 573-578 - Le Hai Yen
A subgradient method for equilibrium problems involving quasiconvex bifunctions. 579-583 - Takashi Kamihigashi, John Stachurski
Partial stochastic dominance via optimal transport. 584-586 - Sven de Vries, Rakesh V. Vohra:
Matroidal approximations of independence systems. 587-593 - Matthias Claus
A note on Σ2p-completeness of a robust binary linear program with binary uncertainty set. 594-598 - Fatemeh Navidi, Inge Li Gørtz
Approximation algorithms for the a priori traveling repairman. 599-606 - Adam N. Letchford
Lifting the knapsack cover inequalities for the knapsack polytope. 607-611 - Christopher Hojny
Polynomial size IP formulations of knapsack may require exponentially large coefficients. 612-618 - Paola Labrecciosa:
Cournot competition with hyperbolic learning and myopic firms: A note. 619-622 - Luca Colombo:
A note on oligopoly exploitation of common-pool renewable resources. 623-626 - Xianghui Zhong
Slightly improved upper bound on the integrality ratio for the s-t Path TSP. 627-629 - Brian Clark, Zachary Feinstein
A machine learning efficient frontier. 630-634 - Jin Xu, Chi Zhang, Jianghua Zhang:
Three-player sequential contests with asymmetric valuations. 635-640 - Le Chang
Does Bitcoin dominate the price discovery of the Cryptocurrencies market? A time-varying information share analysis. 641-645 - Zhongbin Wang, Lei Fang, Sheng Zhu
Strategic behavior in queues with the effect of the number of customers behind. 646-651 - Dehia 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. 652-657 - Yuhong He
Cost analysis in global supply chains. 658-665 - Seksan Kiatsupaibul, Robert L. Smith, Zelda B. Zabinsky:
Single observation adaptive search for discrete and continuous stochastic optimization. 666-673 - Qingying Li
Equilibrium analysis of unobservable M∕M∕n priority queues with balking and homogeneous customers. 674-681 - Ruxian Wang
On the assortment optimization with endogenized market size. 682-686
Volume 48, Number 6, November 2020
- Shaojie Tang
Product sequencing and pricing under cascade browse model. 687-692 - Xiangyu Cui
Better than optimal mean-variance portfolio policy in multi-period asset-liability management problem. 693-696 - Anders Forsgren
On the existence of a short pivoting sequence for a linear program. 697-702 - Michi Nishihara
Closed-form solution to a real option problem with regime switching. 703-707 - Jonatas B. C. Chagas
Ants can orienteer a thief in their robbery. 708-714 - Chandan Pal
Continuous-time zero-sum stochastic game with stopping and control. 715-719 - Xingying Yu, Yang Shen
Portfolio selection with parameter uncertainty under α maxmin mean-variance criterion. 720-724 - Alejandro Saavedra-Nieves
Assessing systematic sampling in estimating the Banzhaf-Owen value. 725-731 - Alexander Zaigraev
Inequality in population weights, majority threshold and the inversion probability in the case of three states. 732-736 - Abdolghani Ebrahimi
Optimal control of a queue under a quality-of-service constraint with bounded and unbounded rates. 737-743 - Timothy C. Y. Chan, Adam Diamant
Sampling from the complement of a polyhedron: An MCMC algorithm for data augmentation. 744-751 - Tim J. Boonen
τ-value for risk capital allocation problems. 752-757 - Wenrui Feng, Weibin Han
A reformulated Shapley-like value for cooperative games with interval payoffs. 758-762 - Mahsa Moghaddass, Daria Terekhov:
Inverse integer optimization with an imperfect observation. 763-769 - Yan Chen, Ward Whitt
Extremal models for the GI∕GI∕K waiting-time tail-probability decay rate. 770-776 - Adam Ouorou:
Fast proximal algorithms for nonsmooth convex optimization. 777-783 - Dennis Fischer, Gerhard J. Woeginger:
A faster algorithm for the continuous bilevel knapsack problem. 784-786 - Samuel N. Kirshner
Oligopoly newsvendor competition with reference effects. 787-791 - Ling Zhao
Dynamic repositioning for vehicle sharing with setup costs. 792-797 - Vera Traub
Improving on Best-of-Many-Christofides for T-tours. 798-804 - Borga Deniz, Itir Z. Karaesmen
A comparison of inventory policies for perishable goods. 805-810 - Jetlir Duraj:
On expected utility in optimal stopping of diffusions. 811-815 - Oliver Bachtler
Robust single machine makespan scheduling with release date uncertainty. 816-819 - Yu Han
Connectedness of weak minimal solution set for set optimization problems. 820-826 - Collin Drent
Censored lifetime learning: Optimal Bayesian age-replacement policies. 827-834 - Dorit S. Hochbaum
A fully polynomial time approximation scheme for the Replenishment Storage problem. 835-839 - Shmuel Onn
On degree sequence optimization. 840-843 - Leah Epstein, Asaf Levin
A note on a variant of the online open end bin packing problem. 844-849
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-25 22: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: