全文获取类型
收费全文 | 282篇 |
免费 | 13篇 |
国内免费 | 1篇 |
出版年
2021年 | 3篇 |
2019年 | 13篇 |
2018年 | 8篇 |
2017年 | 5篇 |
2016年 | 7篇 |
2015年 | 2篇 |
2014年 | 8篇 |
2013年 | 45篇 |
2012年 | 3篇 |
2010年 | 7篇 |
2007年 | 9篇 |
2006年 | 3篇 |
2005年 | 7篇 |
2004年 | 7篇 |
2003年 | 5篇 |
2002年 | 7篇 |
2000年 | 2篇 |
1999年 | 5篇 |
1998年 | 7篇 |
1997年 | 7篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 9篇 |
1993年 | 10篇 |
1992年 | 5篇 |
1991年 | 8篇 |
1990年 | 9篇 |
1989年 | 4篇 |
1988年 | 7篇 |
1987年 | 4篇 |
1986年 | 4篇 |
1985年 | 6篇 |
1983年 | 2篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1980年 | 3篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1974年 | 3篇 |
1973年 | 4篇 |
1972年 | 3篇 |
1969年 | 2篇 |
1968年 | 5篇 |
1967年 | 2篇 |
1966年 | 3篇 |
1949年 | 1篇 |
1948年 | 2篇 |
排序方式: 共有296条查询结果,搜索用时 15 毫秒
231.
Given point-to-point demand forecasts of transmission facilities for services such as voice or data transmission in each period of a finite planning horizon, a decision has to be made as to which types of transmission facilities—together with the amounts of transmission circuits—are to be installed, if any, on each link of the telecommunications network, in each period of the planning horizon. The availability of alternative transmission systems with significantly different costs and circuit capacities necessitates the determination of a minimum (discounted) cost facility installation scheme. This combinatoric choice problem is complicated by the availability of switching equipments enabling the transmission of some of the traffic through intermediary points. This possibility of alternately routing the traffic or the facility requirements of certain point pairs further complicates the problem while creating the opportunity to benefit from economies of scale. We present here a heuristic method for finding a good solution for the general problem; namely, we consider multiple transmission systems and multiple alternate routes. Numerical examples are given and computational experience is reported. 相似文献
232.
Distributions are studied which arise by considering independent and identically distributed random variables conditioned on events involving order statistics. It is shown that these distributions are negatively dependent in a very strong sense. Furthermore, bounds are found on the distribution functions. The conditioning events considered occur naturally in reliability theory as the time to system failure for k-out-of-n systems. An application to systems formed with “second-hand” components is given. 相似文献
233.
In this article, we consider a situation in which a group of facilities need to be constructed in order to serve a given set of customers. However, the facilities cannot guarantee an absolute coverage to any of the customers. Hence, we formulate this problem as one of maximizing the total service reliability of the system subject to a budgetary constraint. For this problem, we develop and test suitable branch-and-bound algorithms and study the effect of problem parameters on solution difficulty. Some generalizations of this problem are also mentioned as possible extensions. 相似文献
234.
Unmanned aerial vehicles (UAVs), increasingly vital to the success of military operations, operate in a complex and dynamic environment, sometimes in concert with manned aircraft. We present an extensible modeling framework for the solution to the dynamic resource management (DRM) problem, where airborne resources must be reassigned to time‐sensitive tasks in response to changes in battlespace conditions. The DRM problem is characterized by diverse tasks with time windows, heterogeneous resources with fuel‐ and payload‐capacity limitations, and multiple competing objectives. We propose an integer linear programing formulation for this problem, where mathematical feasibility is guaranteed. Although motivated by airborne military operations, the proposed general modeling framework is applicable to a wide array of settings, such as disaster relief operations. Additionally, land‐ or water‐based operations may be modeled within this framework, as well as any combination of manned and unmanned vehicles. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
235.
This article introduces the Doubly Stochastic Sequential Assignment Problem (DSSAP), an extension of the Sequential Stochastic Assignment Problem (SSAP), where sequentially arriving tasks are assigned to workers with random success rates. A given number of tasks arrive sequentially, each with a random value coming from a known distribution. On a task arrival, it must be assigned to one of the available workers, each with a random success rate coming from a known distribution. Optimal assignment policies are proposed for DSSAP under various assumptions on the random success rates. The optimal assignment algorithm for the general case of DSSAP, where workers have distinct success rate distribution, has an exponential running time. An approximation algorithm that achieves a fraction of the maximum total expected reward in a polynomial time is proposed. The results are illustrated by several numerical experiments. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 124–137, 2016 相似文献
236.
The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016 相似文献
237.
Building evacuation problems can be represented as dynamic network-flow problems [3]. The underlying network structure of a building evolves through time yielding a time-expanded network (a dynamic network). Usually in such evacuation problems involving time, more than one objective function is appropriate. For example, minimizing the total evacuation time and evacuating a portion of the building as early as possible are two such objectives. In this article we show that lexicographical optimization is applicable in handling such multiple objectives. Minimizing the total evacuation time while avoiding cyclic movements in a building and “priority evacuation” are treated as lexicographical min cost flow problems. 相似文献
238.
Ruud H. Teunter 《海军后勤学研究》2001,48(6):484-495
We study a deterministic EOQ model of an inventory system with items that can be recovered (repaired/refurbished/remanufactured). We use different holding cost rates for manufactured and recovered items, and include disposal. We derive simple square root EOQ formulas for both the manufacturing batch quantity and the recovery batch quantity. 相似文献
239.
Jomana H. Amara 《Defence and Peace Economics》2018,29(1):1-5
AbstractThe U.S. Department of Defense (DoD) and the U.S. Department of Veterans Affairs (VA) need to bridge a gap in their understanding of service members’ health outcomes and the issues involved in treatment, such as cost. In addition, clinicians and policy analysts must overcome existing knowledge barriers. Clinicians need to be aware of policy changes that will affect their patient load in numbers and in treatment needs. Policy analysts need to be aware of issues relevant to clinical treatment, such as quality and timeliness of care. Given the need for services and support to military personnel and families, and the fact that the fastest growing expenses in defense are health care costs, a multi-disciplinary line of research will help lawmakers understand the most efficient and effective resource use across the health care services. 相似文献
240.
Kirstin J. H. Brathwaite 《Defence Studies》2018,18(1):1-18
How do we understand combat effectiveness – soldiers’ performance in battle? Despite the broad consensus that understanding combat effectiveness is important both for scholars and policymakers, there is widespread disagreement about what combat effectiveness is. More specifically, studies of effectiveness tend to focus on either the skill of soldiers in battle, or their will to fight. Yet both skill and will are essential components of an effective fighting force. This article argues that understanding combat effectiveness requires understanding both of these key components of effectiveness. In other words, combat effectiveness requires both the skill and will to engage the enemy in an organized manner. It then demonstrates the usefulness of this conceptualization by applying it to the cases of British, Indian, and Australian forces fighting the Japanese during the Second World War. Only when scholars are talking about the same concept will our understanding of the conditions under which militaries are effective in battle progress. By comparing different units fighting the same opponent under the same material conditions, I demonstrate that units vary both in their combat skill and their will to fight, and that understanding their effectiveness in battle requires analyzing both of these key factors. 相似文献