全文获取类型
收费全文 | 3224篇 |
免费 | 74篇 |
国内免费 | 1篇 |
出版年
2021年 | 37篇 |
2019年 | 91篇 |
2018年 | 55篇 |
2017年 | 82篇 |
2016年 | 81篇 |
2015年 | 63篇 |
2014年 | 67篇 |
2013年 | 721篇 |
2010年 | 35篇 |
2009年 | 37篇 |
2008年 | 48篇 |
2007年 | 53篇 |
2006年 | 37篇 |
2005年 | 43篇 |
2004年 | 57篇 |
2003年 | 43篇 |
2002年 | 58篇 |
2001年 | 33篇 |
2000年 | 31篇 |
1999年 | 41篇 |
1998年 | 46篇 |
1997年 | 49篇 |
1996年 | 61篇 |
1995年 | 43篇 |
1994年 | 59篇 |
1993年 | 64篇 |
1992年 | 58篇 |
1991年 | 74篇 |
1989年 | 31篇 |
1986年 | 70篇 |
1985年 | 64篇 |
1984年 | 37篇 |
1983年 | 42篇 |
1982年 | 43篇 |
1981年 | 45篇 |
1980年 | 51篇 |
1979年 | 46篇 |
1978年 | 49篇 |
1977年 | 46篇 |
1976年 | 45篇 |
1975年 | 46篇 |
1974年 | 52篇 |
1973年 | 51篇 |
1972年 | 52篇 |
1971年 | 43篇 |
1970年 | 40篇 |
1969年 | 40篇 |
1968年 | 34篇 |
1967年 | 33篇 |
1966年 | 27篇 |
排序方式: 共有3299条查询结果,搜索用时 15 毫秒
921.
推导得到了宽带 MIMO-OFDM 信道模型。在空间相关情况下推导了非盲信道估计的 Bayesian CRB及 Bayesian MMSE。利用 Bayesian CRB 准则对发送的训练序列进行了功率分配,而后利用一种线性规划的方法对带有保护带宽 MIMO-OFDM 训练符号进行子载波功率分配,并利用发端酉矩阵进行最优相位设计。 相似文献
922.
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 相似文献
923.
Stephen D. Wrage 《Defense & Security Analysis》2003,19(2):101-109
924.
925.
The dynamics of the environment in which supply chains evolve requires that companies frequently redesign their logistics distribution networks. In this paper we address a multiperiod single‐sourcing problem that can be used as a strategic tool for evaluating the costs of logistics network designs in a dynamic environment. The distribution networks that we consider consist of a set of production and storage facilities, and a set of customers who do not hold inventories. The facilities face production capacities, and each customer's demand needs to be delivered by a single facility in each period. We deal with the assignment of customers to facilities, as well as the location, timing, and size of inventories. In addition, to mitigate start and end‐of‐study effects, we view the planning period as a typical future one, which will repeat itself. This leads to a cyclic model, in which starting and ending inventories are equal. Based on an assignment formulation of the problem, we propose a greedy heuristic, and prove that this greedy heuristic is asymptotically feasible and optimal in a probabilistic sense. We illustrate the behavior of the greedy heuristic, as well as some improvements where the greedy heuristic is used as the starting point of a local interchange procedure, on a set of randomly generated test problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 412–437, 2003 相似文献
926.
Richard A. Bitzinger 《战略研究杂志》2016,39(5-6):762-789
ABSTRACTEven with sizable economic inputs, access to foreign technologies, and considerable political will, China, up until the late 1990s, experienced only limited success when it came to the local design, development, and manufacture of advanced conventional weapons. Not surprisingly, therefore, reforming the local defense industry in order to upgrade its technology base and manufacturing capabilities and to make armaments production more efficient and cost-effective has long preoccupied the Chinese leadership. The fact that most of these efforts had little positive impact on the country’s military technological and industrial capabilities only encouraged Beijing to experiment with additional reforms in the hopes of finally getting it right. 相似文献
927.
In this article, we study a two‐level lot‐sizing problem with supplier selection (LSS), which is an NP‐hard problem arising in different production planning and supply chain management applications. After presenting various formulations for LSS, and computationally comparing their strengths, we explore the polyhedral structure of one of these formulations. For this formulation, we derive several families of strong valid inequalities, and provide conditions under which they are facet‐defining. We show numerically that incorporating these valid inequalities within a branch‐and‐cut framework leads to significant improvements in computation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 647–666, 2017 相似文献
928.
David H. Ucko 《战略研究杂志》2019,42(3-4):448-479
Despite the emphasis in doctrine and academia that counterinsurgency is in its essence political, these operations are all too commonly discussed and approached as primarily military endeavors. Informed by the need to refocus counterinsurgency studies, this article revisits a foundational case of the canon – the Malayan Emergency – to discuss its political (i.e., not military) unfolding. The analysis distinguishes itself by emphasizing the diplomatic processes, negotiations, and deals that gave strategic meaning to the military operations underway. In so doing, the article also generates insight on the use of leverage and elite bargains in creating new political settlements and bringing insurgent conflicts to an end. 相似文献
929.
We study an infinite‐horizon, N‐stage, serial production/inventory system with two transportation modes between stages: regular shipping and expedited shipping. The optimal inventory policy for this system is a top–down echelon base‐stock policy, which can be computed through minimizing 2N nested convex functions recursively (Lawson and Porteus, Oper Res 48 (2000), 878–893). In this article, we first present some structural properties and comparative statics for the parameters of the optimal inventory policies, we then derive simple, newsvendor‐type lower and upper bounds for the optimal control parameters. These results are used to develop near optimal heuristic solutions for the echelon base‐stock policies. Numerical studies show that the heuristic performs well. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
930.
We formulate and solve a discrete‐time path‐optimization problem where a single searcher, operating in a discretized three‐dimensional airspace, looks for a moving target in a finite set of cells. The searcher is constrained by maximum limits on the consumption of one or more resources such as time, fuel, and risk along any path. We develop a specialized branch‐and‐bound algorithm for this problem that uses several network reduction procedures as well as a new bounding technique based on Lagrangian relaxation and network expansion. The resulting algorithm outperforms a state‐of‐the‐art algorithm for solving time‐constrained problems and also is the first algorithm to solve multi‐constrained problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献