全文获取类型
收费全文 | 507篇 |
免费 | 17篇 |
国内免费 | 1篇 |
出版年
2021年 | 5篇 |
2020年 | 5篇 |
2019年 | 12篇 |
2018年 | 7篇 |
2017年 | 14篇 |
2016年 | 11篇 |
2015年 | 7篇 |
2014年 | 10篇 |
2013年 | 123篇 |
2012年 | 5篇 |
2011年 | 6篇 |
2010年 | 7篇 |
2009年 | 6篇 |
2008年 | 5篇 |
2007年 | 6篇 |
2006年 | 8篇 |
2005年 | 6篇 |
2003年 | 5篇 |
2002年 | 5篇 |
2001年 | 5篇 |
2000年 | 5篇 |
1998年 | 5篇 |
1997年 | 7篇 |
1996年 | 9篇 |
1995年 | 8篇 |
1994年 | 9篇 |
1993年 | 11篇 |
1992年 | 12篇 |
1991年 | 15篇 |
1989年 | 10篇 |
1988年 | 7篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 14篇 |
1984年 | 7篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 11篇 |
1979年 | 7篇 |
1978年 | 9篇 |
1976年 | 8篇 |
1975年 | 10篇 |
1974年 | 10篇 |
1973年 | 10篇 |
1972年 | 5篇 |
1971年 | 5篇 |
1970年 | 8篇 |
1969年 | 5篇 |
1968年 | 7篇 |
1967年 | 5篇 |
排序方式: 共有525条查询结果,搜索用时 15 毫秒
391.
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. 相似文献
392.
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. 相似文献
393.
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. 相似文献
394.
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 相似文献
395.
Robert F. Dell James N. Eagle Gustavo Henrique Alves Martins Almir Garnier Santos 《海军后勤学研究》1996,43(4):463-480
The search theory open literature has paid little, if any, attention to the multiple-searcher, moving-target search problem. We develop an optimal branch-and-bound procedure and six heuristics for solving constrained-path problems with multiple searchers. Our optimal procedure outperforms existing approaches when used with only a single searcher. For more than one searcher, the time needed to guarantee an optimal solution is prohibitive. Our heuristics represent a wide variety of approaches: One solves partial problems optimally, two use paths based on maximizing the expected number of detections, two are genetic algorithm implementations, and one is local search with random restarts. A heuristic based on the expected number of detections obtains solutions within 2% of the best known for each one-, two-, and three-searcher test problem considered. For one- and two-searcher problems, the same heuristic's solution time is less than that of other heuristics. For three-searcher problems, a genetic algorithm implementation obtains the best-known solution in as little as 20% of other heuristic solution times. © 1996 John Wiley & Sons, Inc. 相似文献
396.
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. 相似文献
397.
Capacity expansion refers to the process of adding facilities or manpower to meet increasing demand. Typical capacity expansion decisions are characterized by uncertain demand forecasts and uncertainty in the eventual cost of expansion projects. This article models capacity expansion within the framework of piecewise deterministic Markov processes and investigates the problem of controlling investment in a succession of same type projects in order to meet increasing demand with minimum cost. In particular, we investigate the optimality of a class of investment strategies called cutoff strategies. These strategies have the property that there exists some undercapacity level M such that the strategy invests at the maximum available rate at all levels above M and does not invest at any level below M. Cutoff strategies are appealing because they are straightforward to implement. We determine conditions on the undercapacity penalty function that ensure the existence of optimal cutoff strategies when the cost of completing a project is exponentially distributed. A by-product of the proof is an algorithm for determining the optimal strategy and its cost. © 1995 John Wiley & Sons, Inc. 相似文献
398.
For infinite-horizon replacement economy problems it is common practice to truncate the problem at some finite horizon. We develop bounds on the error due to such a truncation. These bounds differ from previous results in that they include both revenues and costs. Bounds are illustrated through a numerical example from a real case in vehicle replacement. © 1994 John Wiley & Sons, Inc. 相似文献
399.
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. 相似文献
400.
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. 相似文献