首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   390篇
  免费   6篇
  2021年   7篇
  2019年   9篇
  2018年   5篇
  2017年   4篇
  2016年   7篇
  2015年   2篇
  2014年   5篇
  2013年   65篇
  2012年   3篇
  2009年   4篇
  2007年   12篇
  2005年   2篇
  2004年   3篇
  2003年   7篇
  2002年   6篇
  2001年   2篇
  2000年   4篇
  1999年   4篇
  1998年   7篇
  1997年   8篇
  1996年   9篇
  1995年   3篇
  1994年   6篇
  1993年   10篇
  1992年   7篇
  1991年   9篇
  1990年   10篇
  1989年   17篇
  1988年   14篇
  1987年   7篇
  1986年   13篇
  1985年   8篇
  1984年   4篇
  1983年   3篇
  1982年   10篇
  1981年   6篇
  1980年   8篇
  1979年   9篇
  1978年   8篇
  1977年   5篇
  1976年   6篇
  1975年   4篇
  1974年   9篇
  1973年   5篇
  1972年   4篇
  1971年   7篇
  1970年   6篇
  1969年   5篇
  1967年   6篇
  1948年   4篇
排序方式: 共有396条查询结果,搜索用时 15 毫秒
121.
An algorithm is given for the conditional p-center problem, namely, the optimal location of one or more additional facilities in a region with given demand points and one or more preexisting facilities. The solution dealt with here involves the minimax criterion and Euclidean distances in two-dimensional space. The method used is a generalization to the present conditional case of a relaxation method previously developed for the unconditional p-center problems. Interestingly, its worst-case complexity is identical to that of the unconditional version, and in practice, the conditional algorithm is more efficient. Some test problems with up to 200 demand points have been solved. © 1993 John Wiley & Sons, Inc.  相似文献   
122.
The United States military frequently has difficulty retaining enlisted personnel beyond their initial enlistment. A bonus program within each service, called a Selective Reenlistment Bonus (SRB) program, seeks to enhance reenlistments and thus reduce personnel shortages in critical military occupational specialties (MOSs). The amount of bonus is set by assigning “SRB multipliers” to each MOS. We develop a nonlinear integer program to select multipliers which minimize a function of deviations from desired reenlistment targets. A Lagrangian relaxation of a linearized version of the integer program is used to obtain lower bounds and feasible solutions. The best feasible solution, discovered in a coordinate search of the Lagrangian function, is heuristically improved by apportioning unexpended funds. For large problems a heuristic variable reduction is employed to speed model solution. U.S. Army data and requirements for FY87 yield a 0-1 integer program with 12,992 binary variables and 273 constraints, which is solved within 0.00002% of optimality on an IBM 3033AP in less than 1.7 seconds. More general models with up to 463,000 binary variables are solved, on average, to within 0.009% of optimality in less than 1.8 minutes. The U.S. Marine Corps has used a simpler version of this model since 1986. © 1993 John Wiley & Sons, Inc.  相似文献   
123.
In this article, we introduce the capacitated warehouse location model with risk pooling (CLMRP), which captures the interdependence between capacity issues and the inventory management at the warehouses. The CLMRP models a logistics system in which a single plant ships one type of product to a set of retailers, each with an uncertain demand. Warehouses serve as the direct intermediary between the plant and the retailers for the shipment of the product and also retain safety stock to provide appropriate service levels to the retailers. The CLMRP minimizes the sum of the fixed facility location, transportation, and inventory carrying costs. The model simultaneously determines warehouse locations, shipment sizes from the plant to the warehouses, the working inventory, and safety stock levels at the warehouses and the assignment of retailers to the warehouses. The costs at each warehouse exhibit initially economies of scale and then an exponential increase due to the capacity limitations. We show that this problem can be formulated as a nonlinear integer program in which the objective function is neither concave nor convex. A Lagrangian relaxation solution algorithm is proposed. The Lagrangian subproblem is also a nonlinear integer program. An efficient algorithm is developed for the linear relaxation of this subproblem. The Lagrangian relaxation algorithm provides near‐optimal solutions with reasonable computational requirements for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
124.
In this paper we study a machine repair problem in which a single unreliable server maintains N identical machines. The breakdown times of the machines are assumed to follow an exponential distribution. The server is subject to failure and the failure times are exponentially distributed. The repair times of the machine and the service times of the repairman are assumed to be of phase type. Using matrix‐analytic methods, we perform steady state analysis of this model. The time spent by a failed machine in service and the total time in the repair facility are shown to be of phase type. Several performance measures are evaluated. An optimization problem to determine the number of machines to be assigned to the server that will maximize the expected total profit per unit time is discussed. An illustrative numerical example is presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 462–480, 2003  相似文献   
125.
In this paper we consider networks that consist of components operating under a randomly changing common environment. Our work is motivated by power system networks that are subject to fluctuating weather conditions over time that affect the performance of the network. We develop a general setup for any network that is subject to such environment and present results for network reliability assessment under two repair scenarios. We also present Bayesian analysis of network failure data and illustrate how reliability predictions can be obtained for the network. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 574–591, 2003  相似文献   
126.
The terrorist attacks in France and Belgium of 2015–2016 that occurred while these countries were in a heightened state of alert raise questions about indications and warning methodology as well as effectiveness of the blanket-protection deployment of security services assisted even by the military. Response and perhaps even more anticipation may require strategic rethinking in light of the predatory attacks that target the most vulnerable spots of the public space. This study looks at threat analysis in Belgium as conducted through her intelligence fusion centre Coordination Unit for Threat Analysis (CUTA)?????? since its inception in 2006. With a special focus on what is known, at the time of writing, about the terrorist attacks in Paris and Brussels, this study hopes to put into context how the system (mal)functions and will also consider the preventive measures that respond to the threat, and the international aspects which have implications far beyond Belgian borders. Therefore, a case is made for not just a Belgian homeland security framework, but one that fits into an EU-wide security concept.  相似文献   
127.
This paper provides a political economy analysis of the evolution of unmanned aerial vehicles (UAV), or ‘drones’ in the USA. Focus is placed on the interplay between the polity and private economic influences, and their impact on the trajectory of political, economic, and military outcomes. We identify the initial formation of the drone industry, trace how the initial relationships between the military and the private sector expanded over time, and discuss present relationships. Understanding the historical evolution of UAV technology, as well as the major players in the industry today, is important for ongoing policy debates regarding the use of drones both domestically and internationally.  相似文献   
128.
Why should deployment affect re‐enlistment? In our model, members enter the military with naïve beliefs about deployment and use actual deployment experience to update their beliefs and revise their expected utility of re‐enlisting. Empirically, re‐enlistment is related to the type and number of deployments, consistent with the learning model. Non‐hostile deployment increases first‐term re‐enlistment but hostile deployment has little effect except for the Army, where the effect is positive. Both types increase second‐term re‐enlistment. Interestingly, first‐term members with dependants tend to respond to deployment like second‐term members. In addition, deployment acts directly to affect re‐enlistment, not indirectly through time to promotion.  相似文献   
129.
“As we close this century, there is for the first time realistic hope of a more just future. A Century stained with the sufferings of ceaseless war and atrocity is as much marked by our incomplete efforts to secure the foundations of an international society, one in which all peoples are equal and equally protected from abuse. The last decade has seen the application of dormant humanitarian principles and laws in various fora. The ICC offers us the opportunity to build on these disjointed enforcement efforts. A properly functioning permanent court will be humanity's best chance yet to move out of its self-destructive cycle. Justice is a vindication, a historical right and a deterrent.”  相似文献   
130.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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