首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   572篇
  免费   13篇
  2021年   6篇
  2019年   13篇
  2018年   9篇
  2017年   11篇
  2016年   9篇
  2015年   9篇
  2013年   105篇
  2010年   5篇
  2009年   9篇
  2008年   10篇
  2006年   5篇
  2005年   8篇
  2004年   12篇
  2003年   8篇
  2002年   5篇
  2001年   5篇
  2000年   7篇
  1999年   5篇
  1998年   7篇
  1997年   6篇
  1996年   17篇
  1995年   7篇
  1994年   9篇
  1993年   7篇
  1992年   11篇
  1991年   18篇
  1990年   7篇
  1989年   12篇
  1988年   12篇
  1987年   14篇
  1986年   16篇
  1985年   18篇
  1984年   9篇
  1983年   5篇
  1982年   5篇
  1981年   6篇
  1980年   12篇
  1979年   6篇
  1978年   9篇
  1977年   9篇
  1976年   9篇
  1975年   7篇
  1974年   8篇
  1972年   11篇
  1971年   12篇
  1970年   11篇
  1969年   8篇
  1968年   9篇
  1967年   9篇
  1966年   9篇
排序方式: 共有585条查询结果,搜索用时 31 毫秒
41.
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.  相似文献   
42.
43.
Blue strike aircraft enter region ? to attack Red targets. In Case 1, Blue conducts (preplanned) SEAD to establish air superiority. In the (reactive) SEAD scenario, which is Case 2, such superiority is already in place, but is jeopardized by prohibitive interference from Red, which threatens Blue's ability to conduct missions. We utilize both deterministic and stochastic models to explore optimal tactics for Red in such engagements. Policies are developed which will guide both Red's determination of the modes of operation of his engagement radar, and his choice of Blue opponent to target next. An index in the form of a simple transaction kill ratio plays a major role throughout. Published 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 723–742, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10046  相似文献   
44.
45.
46.
Multivariable elimination algorithms, which may be regarded as generalizations of various one-dimensional search procedures, have not found wide application. A probable reason may be the generally very irregularly shaped regions of uncertainty that evolve iteratively in the procedures. Hence hope for practical salvage of this class of algorithms seems to lie in controlling the shape of the successively smaller regions of uncertainty. In this article an extension of Bolzano search to rectangles which preserves rectangular iterates is given. Since the result is essentially geometrical in nature, a geometric proof of this procedure is given. Hopefully the proof procedure will be of independent interest. A numerical illustration of the procedure is given for a game problem, such problems lending themselves to this method.  相似文献   
47.
The flow-shop scheduling problem with sequence-dependent additive setup times is considered as a special case of the general problem, and a polynomially bounded approximate method is developed to find a minimum makespan permutation schedule. The approximate algorithm is shown to yield optimal results for the two-machine case. A version of Sule's model is defined that produces the first approximation of the optimal solution for this problem. Computational experience along with numerical examples are provided to test the effectiveness of the method.  相似文献   
48.
The use of life-cycle costs in procurement is limited by the accuracy of cost estimates and assessments of availability risks under the conditions generating costs. Critical to these problems are the needs and responses of equipment to maintenance and repair. Using transition probabilities to define the relationships between serviceability and maintenance and repairs, this article develops a comprehensive decision support system for military procurement. It uses a dynamic programming model to determine the least-cost set of maintenance and repair decisions, where adjustments are included for warranty conditions, time value of money, the opportunity costs of equipment failure, and the end-of-cycle salvage values or disposal costs. The system allows users to define working and failed states, create their own rules or indicators of availability from estimates of state probabilities and establish thresholds of risk acceptability.  相似文献   
49.
50.
This article is concerned with the scaling variant of Karmarkar's algorithm for linear programming problems. Several researchers have presented convergence analyses for this algorithm under various nondegeneracy types of assumptions, or under assumptions regarding the nature of the sequence of iterates generated by the algorithm. By employing a slight perturbation of the algorithm, which is computationally imperceptible, we are able to prove without using any special assumptions that the algorithm converges finitely to an ε-optimal solution for any chosen ε > 0, from which it can be (polynomically) rounded to an optimum, for ε > 0 small enough. The logarithmic barrier function is used as a construct for this analysis. A rounding scheme which produces an optimal extreme point solution is also suggested. Besides the non-negatively constrained case, we also present a convergence analysis for the case of bounded variables. An application in statistics to the L1 estimation problem and related computational results are presented.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号