全文获取类型
| 收费全文 | 524篇 |
| 免费 | 0篇 |
专业分类
| 524篇 |
出版年
| 2021年 | 9篇 |
| 2020年 | 5篇 |
| 2019年 | 13篇 |
| 2018年 | 5篇 |
| 2017年 | 7篇 |
| 2016年 | 12篇 |
| 2015年 | 9篇 |
| 2014年 | 7篇 |
| 2013年 | 77篇 |
| 2011年 | 6篇 |
| 2009年 | 6篇 |
| 2007年 | 15篇 |
| 2005年 | 5篇 |
| 2004年 | 7篇 |
| 2003年 | 9篇 |
| 2002年 | 8篇 |
| 2001年 | 5篇 |
| 1999年 | 10篇 |
| 1998年 | 9篇 |
| 1997年 | 10篇 |
| 1996年 | 10篇 |
| 1995年 | 4篇 |
| 1994年 | 9篇 |
| 1993年 | 13篇 |
| 1992年 | 11篇 |
| 1991年 | 13篇 |
| 1990年 | 12篇 |
| 1989年 | 19篇 |
| 1988年 | 18篇 |
| 1987年 | 8篇 |
| 1986年 | 15篇 |
| 1985年 | 8篇 |
| 1984年 | 6篇 |
| 1982年 | 10篇 |
| 1981年 | 8篇 |
| 1980年 | 7篇 |
| 1979年 | 9篇 |
| 1978年 | 9篇 |
| 1977年 | 7篇 |
| 1976年 | 6篇 |
| 1975年 | 5篇 |
| 1974年 | 12篇 |
| 1973年 | 5篇 |
| 1972年 | 4篇 |
| 1971年 | 10篇 |
| 1970年 | 6篇 |
| 1969年 | 7篇 |
| 1968年 | 4篇 |
| 1967年 | 7篇 |
| 1948年 | 5篇 |
排序方式： 共有524条查询结果，搜索用时 15 毫秒
121.
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 相似文献
122.
The reformulation‐linearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of “product factors” of the discrete variables with problem constraints to form polynomial restrictions, which are subsequently linearized. For special problem forms, the structure of these linearized constraints tends to suggest that certain classes may be more beneficial than others. We examine the usefulness of subsets of constraints for a family of 0–1 quadratic multidimensional knapsack programs and perform extensive computational tests on a classical special case known as the 0–1 quadratic knapsack problem. We consider RLT forms both with and without these inequalities, and their comparisons with linearizations derived from published methods. Interestingly, the computational results depend in part upon the commercial software used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
123.
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. 相似文献
124.
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. 相似文献
125.
In this paper, a branch-and-bound procedure is presented for treating the general knapsack problem. The fundamental notion of the procedure involves a variation of traditional branching strategies as well as the incorporation of penalties in order to improve bounds. Substantial computational experience has been obtained, the results of which would indicate the feasibility of the procedure for problems of large size. 相似文献
126.
Nancy R. Mann 《海军后勤学研究》1969,16(2):207-216
A statistic is determined for testing the hypothesis of equality for scale parameters from two populations, each of which has the first asymptotic distribution of smallest (extreme) values. The probability distribution is derived for this statistic, and critical values are determined and given in tabular form for a one-sided or two-sided alternative, for censored samples of size n1 and n2, n1 = 2, 3, …. 6, n2 = 2, 3, …. 6. The power function of the test for certain alternatives is also calculated and listed in each case considered. 相似文献
127.
A procedure for obtaining a facilities scatter diagram within a rectangular boundary is developed using a multifacility location model. This method gives favorable computational results and has the advantage over other scatter diagram methods of being able to accommodate fixed facility locations. Examples illustrate how this method can be used by a designer/analyst either as a one-step algorithm or iteratively to build a layout. 相似文献
128.
This article examines the historical impact of foreign fighters and how the international community has sought to counter this threat. It argues that foreign fighters have contributed significantly to the metastasis of Salafi-jihadism over the past 30 years. They have globalized local conflicts. They have brought advanced skills to battlefields. Further, the logistics infrastructure built by foreign fighters has allowed Salafi-jihadism to expand rapidly. The challenge for security officials today is how to prevent the foreign fighters in Syria and Iraq from expanding the threat of Salafi-jihadism further. To inform this effort, this article derives lessons learned from past efforts against Arab Afghans in Bosnia (1992–1995) and Abu Musab al-Zarqawi’s foreign volunteers in Iraq (2003–2008). 相似文献
129.
We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance. 相似文献
130.