-
作者：Ozel, Aysu; Smilowitz, Karen; Goldstein, Lila K. S.
作者单位：Northwestern University
摘要：Comprehensive community engagement in public school district design is essential to create equitable and effective enrollment policies reflective of community needs and values. We revisit the school district design problem with a focus on codesigning with community partners. We introduce a new compact formulation that incorporates multiple decisions simultaneously by assigning students in each geographic unit to a set of schools (e.g., elementary, middle, and high schools, and schools with spe...
-
作者：Yu, Man; Zheng, Shaohui; Chen, Jiguang
作者单位：Hong Kong University of Science & Technology; Xiamen University
摘要：This paper characterizes joint order fulfillment and inventory policies for assemble-to-order generalized W systems, in which k products are assembled from a common component and k product-specific (dedicated) components. We consider a periodicreview system and focus on nested fulfillment policies, in which orders are fulfilled in decreasing order of profit margins. We prove that the optimal fulfillment policy of a twoproduct W system is nested. For systems with more than two products, althoug...
-
作者：Benade, Gerdus; Halpern, Daniel; Psomas, Alexandros
作者单位：Boston University; Harvard University; Purdue University System; Purdue University
摘要：We consider the fundamental problem of fairly and efficiently allocating T indivisible items among n agents with additive preferences. Items become available over a sequence of rounds, and every item must be allocated immediately and irrevocably before the next one arrives. Previous work shows that when the agents' valuations for the items are drawn from known distributions, it is possible (under mild assumptions) to find allocations that are envy-free with high probability and Pareto efficien...
-
作者：Ota, Matheus J.; Fukasawa, Ricardo
作者单位：University of Waterloo
摘要：The vehicle routing problem with stochastic demands (VRPSD) generalizes the classic vehicle routing problem by considering customer demands as random variables. Similar to other vehicle routing variants, state-of-the-art algorithms for the VRPSD are often based on set-partitioning formulations, which require efficient routines for the associated pricing problems. However, all of these set partitioning-based approaches have strong assumptions on the correlation between the demands of random var...
-
作者：Daw, Andrew; Fralix, Brian; Pender, Jamol
作者单位：University of Southern California; Clemson University; Cornell University
摘要：Across domains as diverse as communication channels, computing systems, and public health management, a myriad of real -world queueing systems receive batch arrivals of jobs or customers. In this work, we show that under a natural scaling regime, both the queue -length process and the workload process associated with a properly scaled sequence of infinite -server queueing systems with batch arrivals converge almost surely, uniformly on compact sets, to shot -noise processes. Given the applicab...
-
作者：Sun, Hailong; Li, Xiaobo; Teo, Chung-Piaw
作者单位：Shanghai Jiao Tong University; National University of Singapore; National University of Singapore; National University of Singapore
摘要：Product bundling is a widely used selling strategy among multiproduct firms, yet designing and pricing bundles optimally remain a complex challenge. This paper addresses this fundamental issue by exploring the selection and pricing of a single bundle from a range of products. For instance, in the single bundle with the rest (SBR) framework, the bundle is optimally chosen and priced, whereas the remaining products are offered individually, collectively maximizing profit. We show that the SBR op...
-
作者：Aghaei, Sina; Gomez, Andres; Vayanos, Phebe
作者单位：University of Southern California; University of Southern California
摘要：Decision trees are among the most popular machine learning models and are used routinely in applications ranging from revenue management and medicine to bioinformatics. In this paper, we consider the problem of learning optimal binary classification trees with univariate splits. Literature on the topic has burgeoned in recent years, motivated both by the empirical suboptimality of heuristic approaches and the tremendous improvements in mixed-integer optimization (MIO) technology. Yet, existing...
-
作者：Ghuge, Rohan; Gupta, Anupam; Nagarajan, Viswanath
作者单位：University System of Georgia; Georgia Institute of Technology; New York University; University of Michigan System; University of Michigan
摘要：Sequential testing problems involve a complex system with several components, each of which is working with some independent probability. The outcome of each component can be determined by performing a test, which incurs some cost. The overall system status is given by a function f of the outcomes of its components. The goal is to evaluate this function f by performing tests at the minimum expected cost. Although there has been extensive prior work on this topic, provable approximation bounds ...
-
作者：Goyal, Vineet; Iyengar, Garud; Udwani, Rajan
作者单位：Columbia University; University of California System; University of California Berkeley
摘要：We consider the problem of online allocation (matching, budgeted allocations, and assortments) of reusable resources for which an adversarial sequence of resource requests is revealed over time and any allocated resource is used/rented for a stochastic duration drawn independently from a resource-dependent usage distribution. Previously, it was known that a greedy algorithm is 0.5-competitive against the clairvoyant benchmark that knows the entire sequence of requests in advance. We give a nov...
-
作者：Chan, Timothy C. Y.; Huang, Simon Y.; Sarhangian, Vahid
作者单位：University of Toronto
摘要：We study a control problem for queueing systems in which customers may return for additional episodes of service after their initial service completion. At each service completion epoch, the decision maker can choose to reduce the probability of return for the departing customer but at a cost that is convex increasing in the amount of reduction in the return probability. Other costs are incurred as customers wait in the queue and every time they return for service. Our primary motivation comes...
