全文获取类型
收费全文 | 449篇 |
免费 | 10篇 |
出版年
2020年 | 6篇 |
2019年 | 11篇 |
2018年 | 12篇 |
2017年 | 12篇 |
2016年 | 12篇 |
2015年 | 11篇 |
2013年 | 117篇 |
2011年 | 4篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2007年 | 3篇 |
2006年 | 5篇 |
2005年 | 7篇 |
2004年 | 7篇 |
2003年 | 4篇 |
2001年 | 3篇 |
2000年 | 4篇 |
1999年 | 6篇 |
1998年 | 6篇 |
1997年 | 6篇 |
1996年 | 12篇 |
1995年 | 6篇 |
1994年 | 10篇 |
1993年 | 6篇 |
1992年 | 8篇 |
1991年 | 15篇 |
1990年 | 5篇 |
1989年 | 7篇 |
1988年 | 6篇 |
1987年 | 8篇 |
1986年 | 13篇 |
1985年 | 13篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1975年 | 3篇 |
1974年 | 5篇 |
1973年 | 3篇 |
1972年 | 9篇 |
1971年 | 6篇 |
1970年 | 8篇 |
1969年 | 4篇 |
1968年 | 6篇 |
1967年 | 5篇 |
1966年 | 4篇 |
排序方式: 共有459条查询结果,搜索用时 78 毫秒
161.
Dirichlet mixed models find wide application. Estimation is usually achieved through the method of moments. Here we present an iterative hybrid algorithm for obtaining the maximum likelihood estimate employing both modified Newton-Raphson and E-M methods. This successful MLE algorithm enables calculation of a jack-knife MLE. Simulation comparison of the three estimates is provided. The MLE substantially improves upon the moments estimator particularly with increasing dimension. The jack-knife MLE in turn offers dramatic improvement over the MLE. 相似文献
162.
The reformulation‐linearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of “product factors” of the discrete variables with problem constraints to form polynomial restrictions, which are subsequently linearized. For special problem forms, the structure of these linearized constraints tends to suggest that certain classes may be more beneficial than others. We examine the usefulness of subsets of constraints for a family of 0–1 quadratic multidimensional knapsack programs and perform extensive computational tests on a classical special case known as the 0–1 quadratic knapsack problem. We consider RLT forms both with and without these inequalities, and their comparisons with linearizations derived from published methods. Interestingly, the computational results depend in part upon the commercial software used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
163.
164.
We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016 相似文献
165.
John E. Angus 《海军后勤学研究》1987,34(6):845-851
The confidence coefficient of a two-sided confidence interval for the binomial parameter p is the infimum of the coverage probability of the interval as p ranges between 0 and 1. The confidence coefficients for five different approximate confidence intervals are computed and compared to the confidence coefficient for the two-sided Clopper-Pearson confidence interval. Pratt's approximation method [10] yields virtually the same confidence coefficients as the Clopper-Pearson interval, and is easily computed without resorting to interative methods. 相似文献
166.
167.
168.
169.
Alvin E. Roth 《海军后勤学研究》1982,29(3):521-527
170.
Paul Zipkin 《海军后勤学研究》1982,29(2):257-270
Transportation problems with uncertain demands are useful applied models themselves, and also they represent in a formal way the problem of estimating demands for use in deterministic models. We consider the effects of using a small, aggregate model of this type in place of a larger, more detailed one. Formulation of the aggregate objective function turns out to depend on how one chooses to use (disaggregate) the solution; several alternative methods are examined. Bounds are derived on the error induced by the approximation, thus facilitating comparison of alternative aggregations. We also consider the problem of estimating demands for an aggregate-level deterministic problem. In a specific sense, it is often not the case (as one might expect) that such aggregate demands are easier to estimate than the detailed demands. This is because aggregation and centralization are not the same thing. 相似文献