-
作者:Wang, Dongyang; Muthuraman, Kumar; Morrice, Douglas
作者单位:University of Texas System; University of Texas Austin
摘要:Current healthcare reforms advocate significantly to improve the coordination of services around a patient-centric model. With most patient care delivered through outpatient services, the need to coordinate scheduling between different services in a hospital or colocated clinics becomes central to successful reform. Currently, outpatient services require independent appointment decisions, and the coordination is left to the patient. This approach causes several inefficiencies, including an inc...
-
作者:Chehrazi, Naveed; Cipriano, Lauren E.; Enns, Eva A.
作者单位:University of Texas System; University of Texas Austin; Western University (University of Western Ontario); University of Minnesota System; University of Minnesota Twin Cities
摘要:Antimicrobial resistance is a significant public health threat. In the United States alone, two million people are infected, and 23,000 die each year from antibiotic-resistant bacterial infections. In many cases, infections are resistant to all but a few remaining drugs. We examine the case in which a single drug remains and solve for the optimal treatment policy for a susceptible-infected-susceptible infectious disease model, incorporating the effects of drug resistance. The problem is formul...
-
作者:Bertsimas, Dimitris; Misic, Velibor V.
作者单位:Massachusetts Institute of Technology (MIT); Massachusetts Institute of Technology (MIT); University of California System; University of California Los Angeles
摘要:A fundamental problem faced by firms is that of product line design: given a set of candidate products that may be offered to a collection of customers, what subset of those products should be offered to maximize the profit that is realized when customers make purchases according to their preferences? In this paper, we consider the product line design problem when customers choose according to a first-choice rule and present a new mixed-integer optimization formulation of the problem. We theor...
-
作者:Huettner, Frank; Boyaci, Tamer; Akcay, Yalcin
作者单位:European School of Management & Technology; University of Melbourne
摘要:Consumers often do not have complete information about the choices they face and, therefore, have to spend time and effort acquiring information. Because information acquisition is costly, consumers trade off the value of better information against its cost and make their final product choices based on imperfect information. We model this decision using the rational inattention approach and describe the rationally inattentive consumer's choice behavior when the consumer faces alternatives with...
-
作者:Brandeau, Margaret L.
作者单位:Stanford University
摘要:Public health security-achieved by effectively preventing, detecting, and responding to events that affect public health such as bioterrorism, disasters, and naturally occurring disease outbreaks-is a key aspect of national security. However, effective public health preparedness depends on answering largely unanswerable questions. For example: What is the chance of a bioterror attack in the United States in the next five years? What is the chance of an anthrax attack? What might be the locatio...
-
作者:Balseiro, Santiago R.; Besbes, Omar; Weintraub, Gabriel Y.
作者单位:Columbia University; Stanford University
摘要:We study the dynamic mechanism design problem of a seller who repeatedly auctions independent items over a discrete time horizon to buyers who face a cumulative budget constraint. A driving motivation behind our model is the emergence of real-time bidding markets for online display advertising in which such budgets are prevalent. We assume the seller has a strong form of limited commitment: she commits to the rules of the current auction but cannot commit to those of future auctions. We show t...
-
作者:Hellerstein, Lisa; Lidbetter, Thomas; Pirutinsky, Daniel
作者单位:New York University; New York University Tandon School of Engineering; Rutgers University System; Rutgers University Newark; Rutgers University New Brunswick
摘要:We present efficient algorithms for computing optimal or approximately optimal strategies in a zero-sum game for which player I has n pure strategies and player II has an arbitrary number of pure strategies. We assume that for any given mixed strategy of player I, a best response, or approximate best response, of player II can be found by an oracle-in-time polynomial in n. We then show how our algorithms may be applied to several search games with applications to security and counterterrorism....
-
作者:Sunar, Nur; Birge, John R.; Vitavasiri, Sinit
作者单位:University of North Carolina; University of North Carolina Chapel Hill; University of Chicago; Ericsson
摘要:We consider a firm that dynamically chooses its effort to develop a product for a network of customers represented by a connected graph. The technology of the product evolves as a real-valued stochastic process that depends on the firm's dynamic efforts over time. In addition to dynamically choosing its development effort, the firm chooses when to launch or abandon the product. If the firm launches the product, the firm also chooses a selling price, a promotional price, and a target customer t...
-
作者:Luebbecke, Elisabeth; Luebbecke, Marco E.; Moehring, Rolf H.
作者单位:RWTH Aachen University; Technical University of Berlin; Beijing University of Technology
摘要:We introduce a hard practical optimization problem, the ship traffic control problem (STCP). We study it at the Kiel Canal, which is the most frequented artificial waterway in the world. The canal is operated bidirectionally, but large ships can pass each other only in sidings. Decisions must be made about who is waiting for whom, where, and for how long, subject to a multitude of operational constraints. The objective is to minimize the total waiting times of all ships. This problem generaliz...
-
作者:Georghiou, Angelos; Tsoukalas, Angelos; Wiesemann, Wolfram
作者单位:McGill University; American University of Beirut; Imperial College London
摘要:Multistage robust optimization problems, where the decision maker can dynamically react to consecutively observed realizations of the uncertain problem parameters, pose formidable theoretical and computational challenges. As a result, the existing solution approaches for this problem class typically determine suboptimal solutions under restrictive assumptions. In this paper, we propose a robust dual dynamic programming (RDDP) scheme for multistage robust optimization problems. The RDDP scheme ...