全文获取类型
收费全文 | 330篇 |
免费 | 4篇 |
出版年
2023年 | 2篇 |
2021年 | 2篇 |
2019年 | 7篇 |
2018年 | 11篇 |
2017年 | 9篇 |
2016年 | 7篇 |
2015年 | 5篇 |
2014年 | 6篇 |
2013年 | 94篇 |
2011年 | 2篇 |
2009年 | 4篇 |
2008年 | 6篇 |
2007年 | 4篇 |
2006年 | 4篇 |
2005年 | 5篇 |
2004年 | 7篇 |
2003年 | 5篇 |
2002年 | 7篇 |
2001年 | 3篇 |
2000年 | 2篇 |
1999年 | 3篇 |
1998年 | 5篇 |
1997年 | 5篇 |
1996年 | 4篇 |
1995年 | 9篇 |
1994年 | 7篇 |
1993年 | 6篇 |
1992年 | 7篇 |
1991年 | 7篇 |
1990年 | 5篇 |
1989年 | 5篇 |
1988年 | 5篇 |
1987年 | 9篇 |
1986年 | 5篇 |
1985年 | 7篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 5篇 |
1981年 | 2篇 |
1980年 | 4篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1974年 | 6篇 |
1973年 | 5篇 |
1972年 | 3篇 |
1970年 | 2篇 |
1969年 | 4篇 |
1967年 | 2篇 |
1966年 | 1篇 |
排序方式: 共有334条查询结果,搜索用时 234 毫秒
71.
72.
73.
74.
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. 相似文献
75.
76.
77.
78.
79.
This article addresses bottleneck linear programming problems and in particular capacitated and constrained bottleneck transportation problems. A pseudopricing procedure based on the poly-ω procedure is used to facilitate the primal simplex procedure. This process allows the recent computational developments such as the Extended Threaded Index Method to be applied to bottleneck transportation problems. The impact on problem solution times is illustrated by computational testing and comparison with other current methods. 相似文献
80.
This paper presents the details for applying and specializing the work of Ellis Johnson [10] and [11] to develop a primal code for the well-known capacitated transportation problem. The code was developed directly from the work of Johnson, but is similar to codes developed by Glover, Karney, Klingman, and Napier [6] and Srinivasan and Thompson [14]. The emphasis in the presentation is the use of the graphical representation of the basis to carry out the revised simplex operations. This is a means of exploiting the special structure and sparseness of the constraint matrix to minimize computational effort and storage requirements. We also present the results of solving several large problems with the code developed. 相似文献