3期

最新文章

• Deadlines, Offer Timing, and the Search for Alternatives AI翻译
  作者：Zorc, Sasa; Tsetlin, Ilia
  作者单位：University of Virginia; INSEAD Business School
  摘要：We model two agents who can benefit from a mutual deal or partnership, yet are also searching for outside alternatives. This generic situation is observed in various settings (e.g., the job market for experts) and involves several decisions. The proposer decides not only on the timing, deadline, and value of her offer but also on how to handle her outside alternatives; the responder decides whether to accept the proposer's offer (if any) and how to handle his own outside alternatives. A respon...
• Sustainability Planning for Healthcare Information Exchanges with Supplier Rebate Program AI翻译
  作者：Rajapakshe, Tharanga; Kumar, Subodha; Sen, Arun; Sriskandarajah, Chelliah
  作者单位：State University System of Florida; University of Florida; Pennsylvania Commonwealth System of Higher Education (PCSHE); Temple University; Texas A&M University System; Texas A&M University College Station; Mays Business School
  摘要：Healthcare information exchanges (HIEs) facilitate the electronic transfer of healthcare information among healthcare organizations. Several studies have shown that HIEs have the potential of saving billions of dollars per year and significantly improving healthcare delivery. Despite this economic benefit, financial sustainability is still a key challenge for many HIEs. Even though the issue of HIE sustainability is very important, it has not been analyzed rigorously. Hence the focus of our wo...
• Dynamic Nonlinear Pricing of Inventories over Finite Sales Horizons AI翻译
  作者：Gallego, Guillermo; Li, Michael Z. F.; Liu, Yan
  作者单位：Hong Kong University of Science & Technology; Nanyang Technological University; Chinese Academy of Sciences; University of Science & Technology of China, CAS
  摘要：We consider a finite-horizon, finite-capacity dynamic pricing model where consumers may purchase multiple units of the same product. We present three models that differ in their complexity and revenue potential. The dynamic nonlinear pricing (DNP) model allows the seller to dynamically selecting a price for each bundle size. The dynamic linear pricing model restricts the seller to dynamically select a unit price for all bundle sizes. There can be a significant revenue gap between the two model...
• Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms AI翻译
  作者：Bertsimas, Dimitris; Sturt, Bradley
  作者单位：Massachusetts Institute of Technology (MIT)
  摘要：The bootstrap is a nonparametric approach for calculating quantities, such as confidence intervals, directly from data. Since calculating exact bootstrap quantities is believed to be intractable, randomized resampling algorithms are traditionally used. In this paper, we present a new perspective on the bootstrapmethod through the lens of counting integer points in polyhedra. Through this new perspective, we make several advances for the bootstrap method, both theoretically and algorithmically....
• The Benders Dual Decomposition Method AI翻译
  作者：Rahmaniani, Ragheb; Ahmed, Shabbir; Crainic, Teodor Gabriel; Gendreau, Michel; Rei, Walter
  作者单位：University System of Georgia; Georgia Institute of Technology; Universite de Montreal; University of Quebec; University of Quebec Montreal; University of Quebec; University of Quebec Montreal; Universite de Montreal; Polytechnique Montreal; Universite de Montreal; Polytechnique Montreal
  摘要：Many methods that have been proposed to solve large-scale mixed integer linear programing (MILP) problems rely on decomposition techniques. These methods exploit either the primal or the dual structure of the problem, yielding the Benders decomposition or Lagrangian dual decomposition methods. We propose a new and high-performance approach, called Benders dual decomposition (BDD), which combines the complementary advantages of both methods. The development of BDD is based on a specific reformu...
• An Efficient Frontier Approach to Scoring and Ranking Hospital Performance AI翻译
  作者：Adelman, Daniel
  作者单位：University of Chicago
  摘要：The Centers for Medicare and Medicaid Services (CMS) star rating methodology for publicly evaluating hospitals uses a latent variable model that is based on the presumption of a single, but unobservable, hospital-specific quality factor shared across a group of performance measures. Performance measures are given higher weight if they statistically appear to be more strongly correlated with this hidden factor. We show how this approach, when applied to measures that are weakly or not correlate...
• The Distributionally Robust Chance-Constrained Vehicle Routing Problem AI翻译
  作者：Ghosal, Shubhechyya; Wiesemann, Wolfram
  作者单位：Imperial College London
  摘要：We study a variant of the capacitated vehicle routing problem (CVRP), which asks for the cost-optimal delivery of a single product to geographically dispersed customers through a fleet of capacity-constrained vehicles. Contrary to the classical CVRP, which assumes that the customer demands are deterministic, we model the demands as a random vector whose distribution is only known to belong to an ambiguity set. We then require the delivery schedule to be feasible with a probability of at least ...
• Technical Note-Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands AI翻译
  作者：Bertazzi, Luca; Secomandi, Nicola
  作者单位：University of Brescia; Carnegie Mellon University
  摘要：The extant literature on the vehicle routing problem with stochastic demands indicates that the restocking strategy yields moderate percentage expected cost reductions relative to the a priori approach but lacks theoretical support for this improvement. We conduct a worst-case analysis that corroborates the observed restocking benefits and enhances our understanding of a foundational model in logistics under uncertainty.
• Assortment Optimization Under the Paired Combinatorial Logit Model AI翻译
  作者：Zhang, Heng; Rusmevichientong, Paat; Topaloglu, Huseyin
  作者单位：University of Southern California
  摘要：We consider uncapacitated and capacitated assortment problems under the paired combinatorial logit model, where the goal is to find a set of products to offer to maximize the expected revenue obtained from a customer. In the uncapacitated setting, we can offer any set of products, whereas in the capacitated setting, there is an upper bound on the number of products that we can offer. We establish that even the uncapacitated assortment problem is strongly NP-hard. To develop an approximation fr...
• Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs AI翻译
  作者：Johnson, David S.; Breslau, Lee; Diakonikolas, Ilias; Duffield, Nick; Gu, Yu; Hajiaghayi, MohammadTaghi; Karloff, Howard; Resende, Mauricio G. C.; Sen, Subhabrata
  作者单位：AT&T; University of Wisconsin System; University of Wisconsin Madison; Texas A&M University System; Texas A&M University College Station; Amazon.com; University System of Maryland; University of Maryland College Park; Amazon.com; University of Washington; University of Washington Seattle; Nokia Corporation; Nokia Bell Labs; AT&T
  摘要：In this paper, we consider two special cases of the cover-by-pairs optimization problem that arises when we need to place facilities so that each customer is served by two facilities that reach it by disjoint shortest paths. These problems arise in a network trafficmonitoring scheme proposed by Breslau et al. and have potential applications to content distribution. The set-disjoint variant applies to networks that use the open shortest path first routing protocol, and the path-disjoint variant...