-
作者：Strickland, DM; Barnes, E; Sokol, JS
作者单位：Winthrop University; University System of Georgia; Georgia Institute of Technology
摘要：In biology, the protein structure alignment problem answers the question of how similar two proteins are. Proteins with strong physical similarities in their tertiary (folded) structure often have similar functions, so understanding physical similarity could be a key to developing protein-based medical treatments. One of the models for protein structure alignment is the maximum contact map overlap (CMO) model. The CMO model of protein structure alignment can be cast as a maximum clique problem...
-
作者：Siegmann, A; Lucas, A
作者单位：Vrije Universiteit Amsterdam; Tinbergen Institute
摘要：We consider a dynamic asset allocation problem formulated as a mean-shortfall model in discrete time. A characterization of the solution is derived analytically under general distributional assumptions for serially independent risky returns. The solution displays risk taking under shortfall, as well as a specific form of time diversification. Also, for a representative stock-return distribution, risk taking increases monotonically with the number of decision moments given a fixed horizon. This...
-
作者：Zhang, D; Cooper, WL
作者单位：University of Minnesota System; University of Minnesota Twin Cities
摘要：We consider the simultaneous seat-inventory control of a set of parallel flights between a common origin and destination with dynamic customer choice among the flights. We formulate the problem as an extension of the classic multiperiod, single-flight block demand revenue management model. The resulting Markov decision process is quite complex, owing to its multidimensional state space and the fact that the airline's inventory controls do affect the distribution of demand. Using stochastic com...
-
作者：Patel, DJ; Batta, R; Nagi, R
作者单位：State University of New York (SUNY) System; University at Buffalo, SUNY; State University of New York (SUNY) System; University at Buffalo, SUNY
摘要：Sensors in a data fusion environment over hostile territory are geographically dispersed and change location with time. To collect and process data from these sensors, an equally flexible network of fusion beds (i.e., clusterheads) is required. To account for the hostile environment, we allow communication links between sensors and clusterheads to be unreliable. We develop a mixed-integer linear programming (MILP) model to determine the clusterhead location strategy that maximizes the expected...
-
作者：Su, XM; Zenios, SA
作者单位：University of California System; University of California Berkeley; Stanford University
摘要：This paper investigates the effect of patient choice on kidney allocation using the following sequential stochastic assignment model. There are n transplant patients to be allocated n kidneys that will arrive sequentially. Each patient and each kidney has its own type, kidney types are random and revealed upon arrival, and the reward from allocating a kidney to a particular patient depends on both their types. Patients may choose to accept or decline any kidney offer. The objective is to deter...
-
作者：Wu, JT; Wein, LM; Perelson, AS
作者单位：United States Department of Energy (DOE); Los Alamos National Laboratory; University System of Georgia; Georgia Institute of Technology; Stanford University
摘要：The World Health Organization (WHO) recommends which strains of influenza to include in each year's vaccine to countries around the globe. The current WHO strategy attempts to match the vaccine strains with the expected upcoming epidemic strains, a strategy we refer to as the follow policy. The recently proposed antigenic distance hypothesis suggests that vaccine efficacy can be enhanced by taking into account the antigenic histories of vaccinees. To assess the potential benefit of history-bas...
-
作者：Lambert, TJ III; Epelman, MA; Smith, RL
作者单位：Nevada System of Higher Education (NSHE); Truckee Meadows Community College; University of Michigan System; University of Michigan
摘要：In this paper, we investigate the properties of the sampled version of the fictitious play algorithm, familiar from game theory, for games with identical payoffs, and propose a heuristic based on fictitious play as a solution procedure for discrete optimization problems of the form max {u(y): y (y(1),..., y(n)) is an element of y(1) x(...)x y(n)} i.e., in which the feasible region is a Cartesian product of finite sets y(i), i is an element of N = {1,..., n}. The contributions of this paper are...
-
作者：Goycoolea, M; Murray, AT; Barahona, F; Epstein, R; Weintraub, A
作者单位：University System of Georgia; Georgia Institute of Technology; University System of Ohio; Ohio State University; International Business Machines (IBM); IBM USA; Universidad de Chile
摘要：We consider a spatial problem arising in forest harvesting. For regulatory reasons, blocks harvested should not exceed a certain total area, typically 49 hectares. Traditionally, this problem, called the adjacency problem, has been approached by forming a priori blocks from basic cells of 5 to 25 hectares and solving the resulting mixed-integer program. Superior solutions can be obtained by including the construction of blocks in the decision process. The resulting problem is far more complex ...
-
作者：Yang, H; Ye, M; Tang, WHC; Wong, SC
作者单位：Hong Kong University of Science & Technology; University of Hong Kong
摘要：This paper presents a spatially aggregated multiperiod taxi service model with endogenous service intensity. The whole day service period is divided into a number of subperiods; during each subperiod, taxi supply and customer demand characteristics are assumed to be uniform. Customer demand is period-specific and described as a function of waiting time and taxi fare. Taxi operating cost for each work shift consists of two components: one component a function of total service time and the other...
-
作者：Andradóttir, S; Ayhan, H
作者单位：University System of Georgia; Georgia Institute of Technology
摘要：For a Markovian queueing network with two stations in tandem, finite intermediate buffer, and M flexible servers, we study how the servers should be assigned dynamically to stations to obtain optimal long-run average throughput. We assume that each server can work on only one job at a time, that several servers can work together on a single job, and that the travel times between stations are negligible. Under these assumptions, we completely characterize the optimal policy for systems with thr...
