全文获取类型
收费全文 | 359篇 |
免费 | 12篇 |
出版年
2021年 | 3篇 |
2020年 | 3篇 |
2019年 | 8篇 |
2018年 | 7篇 |
2017年 | 8篇 |
2016年 | 13篇 |
2015年 | 8篇 |
2014年 | 4篇 |
2013年 | 96篇 |
2011年 | 6篇 |
2010年 | 4篇 |
2009年 | 3篇 |
2008年 | 3篇 |
2007年 | 4篇 |
2006年 | 3篇 |
2005年 | 8篇 |
2004年 | 5篇 |
2003年 | 7篇 |
2002年 | 7篇 |
2001年 | 3篇 |
2000年 | 4篇 |
1999年 | 11篇 |
1998年 | 3篇 |
1997年 | 6篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 9篇 |
1992年 | 8篇 |
1991年 | 9篇 |
1990年 | 5篇 |
1989年 | 5篇 |
1988年 | 5篇 |
1987年 | 8篇 |
1986年 | 5篇 |
1984年 | 4篇 |
1982年 | 3篇 |
1981年 | 5篇 |
1979年 | 5篇 |
1978年 | 7篇 |
1977年 | 4篇 |
1976年 | 4篇 |
1975年 | 3篇 |
1974年 | 7篇 |
1972年 | 4篇 |
1971年 | 7篇 |
1969年 | 5篇 |
1968年 | 5篇 |
1967年 | 2篇 |
1966年 | 3篇 |
排序方式: 共有371条查询结果,搜索用时 31 毫秒
51.
Component grouping problems, a type of set-partitioning problem, arise in a number of different manufacturing and material logistics application areas. For example, in circuit board assembly, robotic work cells can be used to insert components onto a number of different types of circuit boards. Each type of circuit board requires particular components, with some components appearing on more than one type. The problem is to decide which components should be assigned to each work cell in order to minimize the number of visits by circuit boards to work cells. We describe two new heuristics for this problem, based on so-called greedy random adaptive search procedures (GRASP). With GRASP, a local search technique is replicated many times with different starting points. The starting points are determined by a greedy procedure with a probabilistic aspect. The best result is then kept as the solution. Computational experiments on problems based on data from actual manufacturing processes indicate that these GRASP methods outperform, both in speed and in solution quality, an earlier, network-flow-based heuristic. We also describe techniques for generating lower bounds for the component grouping problem, based on the combinatorial structure of a problem instance. The lower bounds for our real-world test problems averaged within 7%-8% of the heuristic solutions. Similar results are obtained for larger, randomly generated problems. © 1994 John Wiley & Sons. Inc. 相似文献
52.
53.
Let p(⩾0.5) denote the probability that team A beats B in a single game. The series continues until either A or B wins n games. Assuming that these games are independent replications, we study some features of the distribution of Xn, the number of games played in the series. It is shown that Xn is unimodal, has an IFRA distribution, and is stochastically decreasing in p. Close approximations to its mode, mean, and variance are given. Finally, it is shown that the maximum-likelihood estimator of p based on Xn is unique. 相似文献
54.
John W. Chinneck 《海军后勤学研究》1992,39(4):531-543
Nonviable network models have edges which are forced to zero flow simply by the pattern of interconnection of the nodes. The original nonviability diagnosis algorithm [4] is extended here to cover all classes of network models, including pure, generalized, pure processing, nonconserving processing, and generalized processing. The extended algorithm relies on the conversion of all network forms to a pure processing form. Efficiency improvements to the original algorithm are also presented. 相似文献
55.
We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable. 相似文献
56.
AbstractThe Military Compensation and Retirement Modernization Commission was established by the Congress in 2013 to perform a systematic review of military compensation to address rising costs and other trends. Their recommendation for reforming the TRICARE health care program was sweeping, and differed greatly from earlier proposals that focused on increasing beneficiary cost shares. Specifically, the commission proposed overhauling the current benefit delivery model and replacing it with a premium-based insurance model offering a menu of DoD-sponsored private health plans. The analysis presented here is based on work that supported the commission by estimating the budgetary impact of its proposed reforms. Results indicate that movement towards the premium-based model would produce an annual budgetary cost savings in the $2 billion to $4 billion range, with a best savings estimate of $3.2 billion. 相似文献
57.
58.
This article explores the relationship between ethnic representation in security sector institutions and perceptions of safety. While most studies on post-conflict institutional reform focus on national institutions and outcomes, this article argues that a more nuanced view on ethnic representation is fruitful in order to account for the everyday perceptions of local people. Drawing on post-conflict Kosovo, the article analyzes how the representation of ethnic minorities in security institutions affects perceptions of safety among individuals across Kosovo’s municipalities. It also analyzes original interview data collected in the Pristina and Mitrovica municipalities that are typical cases of our sample. Both approaches validate that those municipalities that have ethnically representative security institutions also have higher levels of perceived safety. 相似文献
59.
We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
60.