全文获取类型
收费全文 | 532篇 |
免费 | 8篇 |
出版年
2021年 | 6篇 |
2020年 | 6篇 |
2019年 | 15篇 |
2018年 | 5篇 |
2017年 | 12篇 |
2016年 | 11篇 |
2015年 | 7篇 |
2014年 | 6篇 |
2013年 | 102篇 |
2010年 | 6篇 |
2008年 | 10篇 |
2005年 | 5篇 |
2004年 | 7篇 |
2003年 | 7篇 |
2002年 | 5篇 |
2001年 | 5篇 |
2000年 | 6篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1996年 | 13篇 |
1995年 | 8篇 |
1994年 | 7篇 |
1993年 | 7篇 |
1992年 | 8篇 |
1991年 | 12篇 |
1990年 | 7篇 |
1989年 | 11篇 |
1988年 | 14篇 |
1987年 | 12篇 |
1986年 | 14篇 |
1985年 | 11篇 |
1984年 | 7篇 |
1983年 | 5篇 |
1982年 | 12篇 |
1981年 | 6篇 |
1980年 | 14篇 |
1979年 | 7篇 |
1978年 | 9篇 |
1977年 | 8篇 |
1976年 | 6篇 |
1975年 | 9篇 |
1974年 | 9篇 |
1973年 | 8篇 |
1972年 | 9篇 |
1971年 | 14篇 |
1970年 | 7篇 |
1969年 | 8篇 |
1968年 | 10篇 |
1967年 | 6篇 |
1966年 | 8篇 |
排序方式: 共有540条查询结果,搜索用时 31 毫秒
131.
Although cycling in the simplex method has long been known, a number of theoretical questions concerning cycling have not been fully answered. One of these, stated in [3], is to find the smallest example of cycling, and Beale's example with three equations and seven variables is conjectured to be the smallest one. The exact bounds on dimensions of cycling examples are established in this paper. We show that Beale's example is the smallest one which cycles at a non-optimal solution, that a smaller one can cycle at the optimum, and that, in general (including the completely degenerate case), a cycling example must have at least two equations, at least six variables, and at least three non-basic variables. Examples and geometries are given for the extreme cases, showing that the bounds are sharp. 相似文献
132.
133.
Satya D. Dubey 《海军后勤学研究》1966,13(2):113-128
Test functions, based on various types of censored and noncensored data, for testing several hypotheses about the location, the scale, and the shape parameters of the Weibull distributions are proposed. The exact sampling distributions of these test statistics are derived and their properties in special cases are discussed. A numerical example is considered to illustrate the application of the test functions. The results of this paper possess good possibility of wide application in view of the fact that hosts of real data arising from diverse fields of human endeavor are adequately described by the Weibull distribution. 相似文献
134.
135.
W. F. Lucas 《海军后勤学研究》1967,14(1):15-21
A unique polyhedral solution is given for most n-person games in partition function form when only partitions into coalitions with 1, n-1, and n players have large payoffs. 相似文献
136.
Darrell D. Perry 《海军后勤学研究》1985,32(1):17-19
MIL-STD-414 has been in existence in its original form since 1957. Obviously, there are some things that are right about 414. But there are some changes to the standard that are long overdue. This article presents some pros and cons of 414 and a recommendation that it be replaced by a MIL-STD-414A. Two concerns regarding ANSI/ASQC Z1.9 are discussed. 相似文献
137.
The objective of this article is to describe heuristic solutions to the problem of modeling inventories at each node of a large network in the context of a computer simulation model of that network. The heuristic solutions are compared with the mathematical solution which is too unwieldy for use in a simulation model. The Weibull cumulative distribution is used as an approximation for the heuristic models. We question whether the good performance of the Weibull is coincidence or perhaps mathematically justifiable. 相似文献
138.
A heuristic for 0–1 integer programming is proposed that features a specific rule for breaking ties that occur when attempting to determine a variable to set to 1 during a given iteration. It is tested on a large number of small- to moderate-sized randomly generated generalized set-packing models. Solutions are compared to those obtained using an existing well-regarded heuristic and to solutions to the linear programming relaxations. Results indicate that the proposed heuristic outperforms the existing heuristic except for models in which the number of constraints is large relative to the number of variables. In this case, it performs on par with the existing heuristic. Results also indicate that use of a specific rule for tie breaking can be very effective, especially for low-density models in which the number of variables is large relative to the number of constraints. 相似文献
139.
140.
This paper presents a new methodology to solve the cyclic preference scheduling problem for hourly workers. The focus is on nurse rostering but is applicable to any organization in which the midterm scheduling decision must take into account a complex of legal, institutional, and preferential constraints. The objective is to strike a balance between satisfying individual preferences and minimizing personnel costs. The common practice is to consider each planning period independently and to generate new rosters at the beginning of each. To reduce some of the instability in the process, there is a growing trend toward cyclic schedules, which are easier to manage and are generally perceived to be more equitable. To address this problem, a new integer programming model is presented that combines the elements of both cyclic and preference scheduling. To find solutions, a branch‐and‐price algorithm is developed that makes use of several branching rules and an extremely effective rounding heuristic. A unique feature of the formulation is that the master problem contains integer rather than binary variables. Computational results are reported for problem instances with up to 200 nurses. Most were solved within 10 minutes and many within 3 minutes when a double aggregation approach was applicable. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献