全文获取类型
收费全文 | 710篇 |
免费 | 20篇 |
出版年
2021年 | 13篇 |
2019年 | 16篇 |
2018年 | 6篇 |
2017年 | 11篇 |
2016年 | 14篇 |
2015年 | 13篇 |
2014年 | 8篇 |
2013年 | 131篇 |
2011年 | 8篇 |
2009年 | 7篇 |
2007年 | 17篇 |
2005年 | 9篇 |
2004年 | 9篇 |
2003年 | 12篇 |
2002年 | 10篇 |
2001年 | 6篇 |
2000年 | 6篇 |
1999年 | 13篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 13篇 |
1995年 | 8篇 |
1994年 | 14篇 |
1993年 | 16篇 |
1992年 | 12篇 |
1991年 | 16篇 |
1990年 | 13篇 |
1989年 | 22篇 |
1988年 | 23篇 |
1987年 | 13篇 |
1986年 | 21篇 |
1985年 | 11篇 |
1984年 | 6篇 |
1983年 | 6篇 |
1982年 | 17篇 |
1981年 | 9篇 |
1980年 | 11篇 |
1979年 | 12篇 |
1978年 | 11篇 |
1977年 | 10篇 |
1976年 | 7篇 |
1975年 | 9篇 |
1974年 | 17篇 |
1973年 | 10篇 |
1972年 | 8篇 |
1971年 | 17篇 |
1970年 | 8篇 |
1969年 | 11篇 |
1968年 | 9篇 |
1967年 | 9篇 |
排序方式: 共有730条查询结果,搜索用时 15 毫秒
221.
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. 相似文献
222.
223.
This article considers a two-person game in which the first player has access to certain information that is valuable but unknown to the second player. The first player can distort the information before it is passed on to the second player. The purpose in distorting the information is to render it as useless as possible to the second player. Based on the distorted information received, the second player then maximizes some given objective. In certain cases he may still be able to use the distorted information, but sometimes the information has been so badly distorted that it becomes completely useless to him. © 1993 John Wiley & Sons, Inc. 相似文献
224.
The purpose of this article is to investigate some managerial insights related to using the all-unit quantity discount policies under various conditions. The models developed here are general treatments that deal with four major issues: (a) one buyer or multiple buyers, (b) constant or price-elastic demand, (c) the relationship between the supplier's production schedule or ordering policy and the buyers' ordering sizes, and (d) the supplier either purchasing or manufacturing the item. The models are developed with two objectives: the supplier's profit improvement or the supplier's increased profit share analysis. Algorithms are developed to find optimal decision policies. Our analysis provides the supplier with both the optimal all-unit quantity discount policy and the optimal production (or ordering) strategy. Numerical examples are provided. © 1993 John Wiley & Sons. Inc. 相似文献
225.
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 相似文献
226.
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 相似文献
227.
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 相似文献
228.
T.C. Edwin Cheng Qing Ding Mikhail Y. Kovalyov Aleksander Bachman Adam Janiak 《海军后勤学研究》2003,50(6):531-554
We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003 相似文献
229.
In planar location problems with barriers one considers regions which are forbidden for the siting of new facilities as well as for trespassing. These problems are important since they model various actual applications. The resulting mathematical models have a nonconvex objective function and are therefore difficult to tackle using standard methods of location theory even in the case of simple barrier shapes and distance functions. For the case of center objectives with barrier distances obtained from the rectilinear or Manhattan metric, it is shown that the problem can be solved in polynomial time by identifying a dominating set. The resulting genuinely polynomial algorithm can be combined with bound computations which are derived from solving closely connected restricted location and network location problems. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 647–665, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10038 相似文献
230.
Joseph T. Buontempo 《Defense & Security Analysis》2015,31(2):99-109
The Ground-based Midcourse Defense system is intended to protect the US homeland against limited attacks from intermediate- and long-range ballistic missiles. It has succeeded in intercepting target missiles and can engage a threat launched from North Korea or the Middle East, targeting any point in the USA. Nevertheless, high-profile struggles and program changes related to homeland ballistic missile defense (BMD) continue to make headlines. The most significant struggle has been a string of three straight intercept test failures over five years, followed by the recent successful intercept test in June 2014. This article first briefly reviews the current threats of concern. It then examines homeland BMD policy objectives, followed by the current major technical issues in supporting these objectives and, then, the likelihood of negating a warhead. Finally, it highlights major considerations that should be part of the trajectory the US government takes moving forward. 相似文献