相关论文: Resolvable designs with large blocks
We consider algorithmic approaches to the D-optimality problem for cases where the input design matrix is large and highly structured, in particular implicitly specified as a full quadratic or linear response-surface model in several levels…
We develop $D$-optimal designs for linear models with first-order interactions on a subset of the $2^K$ full factorial design region, when both the number of factors set to the higher level and the number of factors set to the lower level…
The assortment planning problem is a central piece in the revenue management strategy of any company in the retail industry. In this paper, we study a robust assortment optimization problem for substitutable products under a sequential…
We study a sequential decision-making model where a set of items is repeatedly matched to the same set of agents over multiple rounds. The objective is to determine a sequence of matchings that either maximizes the utility of the least…
We study the scalability of consensus-based distributed optimization algorithms by considering two questions: How many processors should we use for a given problem, and how often should they communicate when communication is not free?…
A design problem of finding an optimally stiff membrane structure by selecting one-dimensional fiber reinforcements is formulated and solved. The membrane model is derived in a novel manner from a particular three-dimensional linear elastic…
It is pointed out that separability problem for arbitrary multi-partite states can be fully solved by a finite size, elementary recursive algorithm. In the worse case scenario, the underlying numerical procedure, may grow doubly…
We study two-stage stochastic optimization problems with random recourse, where the adaptive decisions are multiplied with the uncertain parameters in both the objective function and the constraints. To mitigate the computational…
Two-level factorial designs are widely used in industrial experiments. For processes involving \(n\) factors, the construction of designs comprising \(2^n\) and \(2^{n-p}\) factorials, arranged in blocks of size \(2^q\) is investigated. The…
We investigate distributed memory parallel sorting algorithms that scale to the largest available machines and are robust with respect to input size and distribution of the input elements. The main outcome is that four sorting algorithms…
We study the optimal design problem under second-order least squares estimation which is known to outperform ordinary least squares estimation when the error distribution is asymmetric. First, a general approximate theory is developed,…
We develop $D$-optimal designs for linear main effects models on a subset of the $2^K$ full factorial design region, when the number of factors set to the higher level is bounded. It turns out that in the case of narrow margins only those…
We consider the problem of reconstructing sparse symmetric block models with two blocks and connection probabilities $a/n$ and $b/n$ for inter- and intra-block edge probabilities, respectively. It was recently shown that one can do better…
With distributed computing and mobile applications becoming ever more prevalent, synchronizing diverging replicas of the same data is a common problem. Reconciliation -- bringing two replicas of the same data structure as close as possible…
In this article the most fundamental decomposition-based optimization method - block coordinate search, based on the sequential decomposition of problems in subproblems - and building performance simulation programs are used to reason about…
In the present paper we consider design criteria which depend on several designs simultaneously. We formulate equivalence theorems based on moment matrices (if criteria depend on designs via moment matrices) or with respect to the designs…
We consider the problem of assigning or allocating resources to a set of jobs. We consider the case when the resources are fungible, that is, the job can be done with any mix of the resources, but with different efficiencies. In our…
We consider linear programs involving uncertain parameters and propose a new tractable robust counterpart which contains and generalizes several other models including the existing Affinely Adjustable Robust Counterpart and the Fully…
The present paper deals with the problem of allocating patients to two competing treatments in the presence of covariates or prognostic factors in order to achieve a good trade-off among ethical concerns, inferential precision and…
Efficiency techniques are an integral part of Entity Resolution, since its infancy. In this survey, we organized the bulk of works in the field into Blocking, Filtering and hybrid techniques, facilitating their understanding and use. We…