全文获取类型
收费全文 | 197篇 |
免费 | 0篇 |
专业分类
197篇 |
出版年
2023年 | 2篇 |
2019年 | 2篇 |
2018年 | 2篇 |
2017年 | 5篇 |
2016年 | 3篇 |
2015年 | 2篇 |
2014年 | 2篇 |
2013年 | 46篇 |
2011年 | 1篇 |
2009年 | 3篇 |
2008年 | 4篇 |
2007年 | 2篇 |
2006年 | 1篇 |
2004年 | 4篇 |
2003年 | 2篇 |
2002年 | 6篇 |
2001年 | 2篇 |
2000年 | 2篇 |
1999年 | 3篇 |
1998年 | 3篇 |
1997年 | 4篇 |
1996年 | 3篇 |
1995年 | 6篇 |
1994年 | 5篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1991年 | 6篇 |
1990年 | 5篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1987年 | 7篇 |
1986年 | 4篇 |
1985年 | 5篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1975年 | 2篇 |
1974年 | 4篇 |
1973年 | 3篇 |
1972年 | 2篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1969年 | 3篇 |
1968年 | 1篇 |
1967年 | 2篇 |
排序方式: 共有197条查询结果,搜索用时 15 毫秒
51.
52.
53.
54.
55.
56.
Single- and multi-facility location problems are often solved with iterative computational procedures. Although these procedures have proven to converage, in practice it is desirable to be able to compute a lower bound on the objective function at each iteration. This enables the user to stop the iterative process when the objective function is within a prespecified tolerance of the optimum value. In this article we generalize a new bounding method to include multi-facility problems with lp distances. A proof is given that for Euclidean distance problems the new bounding procedure is superior to two other known methods. Numerical results are given for the three methods. 相似文献
57.
In an earlier article we showed that, for facilities-location problems characterized by generalized distance norms and any even number of existing facilities, the optimal location of the new facility is at the intersection of the lines joining the pairs of facilities if these lines intersect at a single point. In this article we extend this concept to show that, for a more general class of problems, the optimal location is one of a set of points which is specified by the existing facilities. 相似文献
58.
59.
Empirical distance functions are used to estimate actual travel distances in a transportation network, to verify the accuracy of road mileage data, and to formulate continuous location models. In this article we consider the problem of fitting the weighted lp norm to a given network. Mathematical properties are derived for two fitting criteria found in the literature. These properties are used to develop an accurate and efficient methodology to solve for the best-fitting parameter values. The directional bias of the lp norm is analyzed for its effect on the range of search for the optimal p value. Concepts and methodology are applied to a case study of the road system in Southern Ontario. In conclusion, a general framework for other types of distance functions is briefly discussed. 相似文献
60.
Without restricting the class of permissible schedules, we derive optimal schedules for economic lot scheduling problems that are fully loaded, have external setups, and have only two products. The fully loaded condition accurately represents certain types of bottlenecks. We show that the optimal schedule must have the Wagner-Whitin property. We also develop a measure of aggregate inventory, derive an optimal steady-state aggregate inventory policy, and provide conditions under which the aggregate inventory level of an optimal schedule must approach a steady state. By restricting the class of permissible schedules to rotation cycle schedules, we extend these results to more than two products. 相似文献