全文获取类型
收费全文 | 3341篇 |
免费 | 82篇 |
国内免费 | 1篇 |
专业分类
3424篇 |
出版年
2021年 | 37篇 |
2019年 | 89篇 |
2018年 | 51篇 |
2017年 | 81篇 |
2016年 | 80篇 |
2015年 | 64篇 |
2014年 | 64篇 |
2013年 | 703篇 |
2010年 | 37篇 |
2009年 | 37篇 |
2008年 | 47篇 |
2007年 | 52篇 |
2006年 | 36篇 |
2005年 | 42篇 |
2004年 | 56篇 |
2003年 | 42篇 |
2002年 | 57篇 |
1999年 | 41篇 |
1998年 | 46篇 |
1997年 | 51篇 |
1996年 | 62篇 |
1995年 | 41篇 |
1994年 | 59篇 |
1993年 | 63篇 |
1992年 | 58篇 |
1991年 | 74篇 |
1990年 | 39篇 |
1989年 | 72篇 |
1988年 | 78篇 |
1987年 | 68篇 |
1986年 | 71篇 |
1985年 | 65篇 |
1984年 | 36篇 |
1983年 | 42篇 |
1982年 | 43篇 |
1981年 | 46篇 |
1980年 | 51篇 |
1979年 | 45篇 |
1978年 | 49篇 |
1977年 | 45篇 |
1976年 | 45篇 |
1975年 | 46篇 |
1974年 | 52篇 |
1973年 | 50篇 |
1972年 | 52篇 |
1971年 | 43篇 |
1970年 | 40篇 |
1969年 | 40篇 |
1968年 | 34篇 |
1967年 | 34篇 |
排序方式: 共有3424条查询结果,搜索用时 15 毫秒
831.
Gerald G. Brown Kelly J. Cormican Siriphong Lawphongpanich Daniel B. Widdis 《海军后勤学研究》1997,44(4):301-318
Submarine berthing plans reserve mooring locations for inbound U.S. Navy nuclear submarines prior to their port entrance. Once in port, submarines may be shifted to different berthing locations to allow them to better receive services they require or to make way for other shifted vessels. However, submarine berth shifting is expensive, labor intensive, and potentially hazardous. This article presents an optimization model for submarine berth planning and demonstrates it with Naval Submarine Base, San Diego. After a berthing plan has been approved and published, changed requests for services, delays, and early arrival of inbound submarines are routine events, requiring frequent revisions. To encourage trust in the planning process, the effect on the solution of revisions in the input is kept small by incorporating a persistence incentive in the optimization model. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 301–318, 1997. 相似文献
832.
This contribution acquaints the reader with a model for multilevel single-machine proportional lot sizing and scheduling problems (PLSPs) that appear in the scope of short-term production planning. It is one of the first articles that deals with dynamic capacitated multilevel lot sizing and scheduling, which is of great practical importance. The PLSP model refines well-known mixed-integer programming formulations for dynamic capacitated lot sizing and scheduling as, for instance, the DLSP or the CSLP. A special emphasis is given on a new method called demand shuffle to solve multilevel PLSP instances efficiently but suboptimally. Although the basic idea is very simple, it becomes clear that in the presence of precedence and capacity constraints many nontrivial details are to be concerned. Computational studies show that the presented approach decidedly improves recent results. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 319–340, 1997 相似文献
833.
We consider a version of the famous bin-packing problem where the cost of a bin is a concave function of the number of items in the bin. We analyze the problem from an average-case point of view and develop techniques to determine the asymptotic optimal solution value for a variety of functions. We also describe heuristic techniques that are asymptotically optimal. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 673–686, 1997 相似文献
834.
835.
836.
837.
838.
This article provides a new approach to the set of (perfect) equilibria. With the help of an equivalence relation on the strategy space of each player. Nash sets and Selten sets are introduced. The number of these sets is finite and each of these sets is a polytope. As a consequence the set of (perfect) equilibria is a finite union of polytopes. © 1994 John Wiley & Sons. Inc. 相似文献
839.
This article examines a game of multiproduct technology adoption. We consider a duopoly model in which firms choose when to switch from a traditional single-product technology to a more flexible and more expensive multiproduct technology. The multiproduct technology allows a firm to invade the other firm's market, creating a more competitive environment and reducing profits. We analyze this investment decision as a game of timing using two different equilibrium concepts. First, we utilize the “silent” equilibrium concept, where firms commit at time zero to a switching time. This concept would be applicable to situations where firms cannot observe each other's actions, or when the implementation of the technology requires long lead times and the investment decision is private information. Using this notion we find that both firms adopt the multiproduct technology simultaneously within a certain time interval. We then characterize this time interval in terms of cost and demand conditions. We also derive conditions under which sequential adoption of the multiproduct technology occurs. The second concept used is that of noisy equilibrium, where firms cannot precommit themselves to an adoption time. This concept is appropriate when investment decisions are common knowledge. In this case a firm can credibly threaten to immediately follow suit if the other firm decides to adopt. This threat is sufficient to ensure the collusive outcome where neither firm adopts the flexible technology. © 1994 John Wiley & Sons, Inc. 相似文献
840.
Kurt M. Bretthauer 《海军后勤学研究》1994,41(3):455-463
A wide variety of optimization problems have been approached with branch-and-bound methodology, most notably integer programming and continuous nonconvex programming. Penalty calculations provide a means to reduce the number of subproblems solved during the branch-and-bound search. We develop a new penalty based on the Tuy cutting plane for the nonconvex problem of globally minimizing a concave function over linear constraints and continuous variables. Computational testing with a branch-and-bound algorithm for concave minimization indicates that, for the problems solved, the penalty reduces solution time by a factor ranging from 1.2 to 7.2. © 1994 John Wiley & Sons, Inc. 相似文献