全文获取类型
收费全文 | 319篇 |
免费 | 14篇 |
国内免费 | 1篇 |
出版年
2021年 | 5篇 |
2019年 | 7篇 |
2018年 | 4篇 |
2017年 | 5篇 |
2016年 | 5篇 |
2015年 | 5篇 |
2014年 | 6篇 |
2013年 | 69篇 |
2012年 | 5篇 |
2011年 | 5篇 |
2010年 | 5篇 |
2009年 | 3篇 |
2008年 | 4篇 |
2007年 | 4篇 |
2006年 | 6篇 |
2003年 | 3篇 |
2002年 | 3篇 |
2000年 | 3篇 |
1998年 | 2篇 |
1997年 | 5篇 |
1996年 | 7篇 |
1995年 | 2篇 |
1994年 | 6篇 |
1993年 | 9篇 |
1992年 | 6篇 |
1991年 | 7篇 |
1990年 | 2篇 |
1989年 | 7篇 |
1988年 | 7篇 |
1987年 | 4篇 |
1986年 | 6篇 |
1985年 | 8篇 |
1984年 | 5篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 4篇 |
1980年 | 8篇 |
1979年 | 7篇 |
1978年 | 8篇 |
1977年 | 2篇 |
1976年 | 7篇 |
1975年 | 10篇 |
1974年 | 6篇 |
1973年 | 8篇 |
1972年 | 5篇 |
1971年 | 4篇 |
1970年 | 5篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 3篇 |
排序方式: 共有334条查询结果,搜索用时 15 毫秒
251.
252.
In hinterland container transportation the use of barges is getting more and more important. We propose a real‐life operational planning problem model from an inland terminal operating company, in which the number of containers shipped per barge is maximized and the number of terminals visited per barge is minimized. This problem is solved with an integer linear program (ILP), yielding strong cost reductions, about 20%, compared to the method used currently in practice. Besides, we develop a heuristic that solves the ILP in two stages. First, it decides for each barge which terminals to visit and second it assigns containers to the barges. This heuristic produces almost always optimal solutions and otherwise near‐optimal solutions. Moreover, the heuristic runs much faster than the ILP, especially for large‐sized instances. 相似文献
253.
With incomplete data the maximum likelihood estimates of the parameters of the Weibull process can only be obtained by solving the likelihood equations iteratively. In this article we show that the solution of the likelihood equations may lie outside of the parameter space if none of the processes can be observed from time zero. 相似文献
254.
Max G. Manwaring 《Low Intensity Conflict & Law Enforcement》2002,11(1):55-76
Building regional security cooperation in the Western Hemisphere is not a strictly short-term, unilateral or bilateral defense effort. Regional security will only result from a long-term, cooperative, multilateral civil-military effort. A viable framework for success includes the need to advance hemispheric understanding of the security concerns of each country and those that the region as a whole faces (for example, the internal and external threat(s) to security). Finally, these issues and associated recommendations demand a carefully staffed and phased regional security plan of action, with measurable short- and long-term objectives to validate its planning and implementation. The basic directions for a regional security plan, as identified at the Miami conference, are as follow. 相似文献
255.
This paper describes the Value Added Analysis methodology which is used as part of the U.S. Army's Planning, Programming, Budgeting, and Execution System to assist the Army leadership in evaluating and prioritizing competing weapon system alternatives during the process of building the Army budget. The Value Added Analysis concept uses a family of models to estimate an alternative system's contribution to the Army's effectiveness using a multiattribute value hierarchy. A mathematical optimization model is then used to simultaneously determine an alternative's cost‐benefit and to identify an optimal mix of weapon systems for inclusion in the Army budget. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 233–253, 1999 相似文献
256.
This article deals with the problem of minimizing the transportation and inventory cost associated with the shipment of several products from a source to a destination, when a finite set of shipping frequencies is available. A mixed-integer programming model—shown to be NP-hard—is formulated for that problem. The computational complexity of some similar models applied to different problems is also investigated. In particular, whereas the capacitated plant location problem with operational cost in product form is NP-hard, the simple plant location problem with the same characteristics can be solved in polynomial time. A branch-and-bound algorithm is finally worked out, and some computational results are presented. © 1996 John Wiley & Sons, Inc. 相似文献
257.
Ship berthing plans reserve a location for inbound U.S. Navy surface vessels prior to their port entrance, or reassign ships once in port to allow them to complete, in a timely manner, reprovisioning, repair, maintenance, training, and certification tests prior to redeploying for future operational commitments. Each ship requires different services when in port, such as shore power, crane, ordnance, and fuel. Unfortunately, not all services are offered at all piers, and berth shifting is disruptive and expensive: A port operations scheduler strives to reduce unnecessary berth shifts. We present an optimization model for berth planning and demonstrate it for Norfolk Naval Station, which exhibits all the richness of berthing problems the Navy faces. ® 1994 John Wiley & Sons, Inc. 相似文献
258.
Mark G. Tang 《海军后勤学研究》1993,40(5):677-696
In this article we solve and analyze a stochastic version of the Boiteux problem by employing the stochastic optimal control method. Our setup is close to that of Thompson [22]. Our focus is to analyze, under the same structure, how different production functions and how the variance in machine deterioration/maintenance affect our optimal machine maintenance and sale date decisions. © 1993 John Wiley & Sons, Inc. 相似文献
259.
The Stein-Chen method for establishing Poisson convergence is used to approximate the reliability of coherent systems with exponential-type distribution functions. These bounds lead to quite general limit theorems for the lifetime distribution of large coherent systems. © 1993 John Wiley & Sons, Inc. 相似文献
260.
We consider two opponents that compete in developing asymmetric technologies where each party's technology is aimed at damaging (or neutralizing) the other's technology. The situation we consider is different than the classical problem of commercial R&D races in two ways: First, while in commercial R&D races the competitors compete over the control of market share, in our case the competition is about the effectiveness of technologies with respect to certain capabilities. Second, in contrast with the “winner‐takes‐all” assumption that characterizes much of the literature on this field in the commercial world, we assume that the party that wins the race gains a temporary advantage that expires when the other party develops a superior technology. We formulate a variety of models that apply to a one‐sided situation, where one of the two parties has to determine how much to invest in developing a technology to counter another technology employed by the other party. The decision problems are expressed as (convex) nonlinear optimization problems. We present an application that provides some operational insights regarding optimal resource allocation. We also consider a two‐sided situation and develop a Nash equilibrium solution that sets investment values, so that both parties have no incentive to change their investments. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 128–145, 2012 相似文献