全文获取类型
收费全文 | 196篇 |
免费 | 6篇 |
专业分类
202篇 |
出版年
2021年 | 8篇 |
2019年 | 3篇 |
2018年 | 4篇 |
2017年 | 2篇 |
2016年 | 3篇 |
2014年 | 4篇 |
2013年 | 26篇 |
2012年 | 2篇 |
2010年 | 2篇 |
2009年 | 7篇 |
2007年 | 5篇 |
2006年 | 2篇 |
2005年 | 2篇 |
2004年 | 5篇 |
2003年 | 2篇 |
2002年 | 7篇 |
2001年 | 5篇 |
2000年 | 4篇 |
1999年 | 2篇 |
1998年 | 3篇 |
1997年 | 3篇 |
1996年 | 3篇 |
1995年 | 7篇 |
1994年 | 2篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1989年 | 5篇 |
1988年 | 6篇 |
1987年 | 6篇 |
1986年 | 5篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1978年 | 4篇 |
1977年 | 5篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1973年 | 4篇 |
1972年 | 2篇 |
1971年 | 2篇 |
1970年 | 2篇 |
1969年 | 3篇 |
1968年 | 2篇 |
1948年 | 1篇 |
排序方式: 共有202条查询结果,搜索用时 0 毫秒
31.
Finding all nondominated vectors for multi‐objective combinatorial optimization (MOCO) problems is computationally very hard in general. We approximate the nondominated frontiers of MOCO problems by fitting smooth hypersurfaces. For a given problem, we fit the hypersurface using a single nondominated reference vector. We experiment with different types of MOCO problems and demonstrate that in all cases the fitted hypersurfaces approximate all nondominated vectors well. We discuss that such an approximation is useful to find the neighborhood of preferred regions of the nondominated vectors with very little computational effort. Further computational effort can then be spent in the identified region to find the actual nondominated vectors the decision maker will prefer. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
32.
33.
We study the assignment of flexible servers to stations in tandem lines with service times that are not necessarily exponentially distributed. Our goal is to achieve optimal or near‐optimal throughput. For systems with infinite buffers, it is already known that the effective assignment of flexible servers is robust to the service time distributions. We provide analytical results for small systems and numerical results for larger systems that support the same conclusion for tandem lines with finite buffers. In the process, we propose server assignment heuristics that perform well for systems with different service time distributions. Our research suggests that policies known to be optimal or near‐optimal for Markovian systems are also likely to be effective when used to assign servers to tasks in non‐Markovian systems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
34.
We consider a class of partitioning problems where the partitioned set is a finite set of real numbers and the objective function of a partition is a function of the vector whose coordinates are the sums of the elements in each part of the given partition (the number of such parts is assumed given). We obtain an explicit solution of such partitioning problem with polynomial complexity bounds. © John Wiley & Sons, Inc. Naval Research Logistics 47: 531–540, 2000 相似文献
35.
36.
Capacity expansion models typically minimize the discounted cost of acquisition and operation over a given planning horizon. In this article we generalize this idea to one in which a capital supply curve replaces the usual discount rate. A capital supply curve is a means to model financial outlook, investment limits, and risk. We show that when such a curve is included in a capacity expansion model, it will, under certain conditions, provide a less capital intensive solution than one which incorporates a discount rate. In this article, we also provide an algorithm that solves capacity expansion models that incorporate a capital supply curve. The attractive feature of this algorithm is that it provides a means to utilize the “discount rate” models efficiently. Throughout, we give applications in power generation planning and computational experience for this application is also presented. 相似文献
37.
38.
Willem K. Brauers 《海军后勤学研究》2002,49(4):327-340
Multiple Objectives Optimization is much seen in combination with linear functions and even with linear programming, together with an adding of the objectives by using weights. With distance functions, normalization instead of weights is used. It is also possible that together with an additive direct influence of the objectives on the utility function a mutual utility of the objectives exists under the form of a multiplicative representation. A critical comment is brought on some representations of this kind. A full‐multiplicative form may offer other opportunities, which will be discussed at length in an effort to exclude weights and normalization. This theoretical approach is followed by an application for arms procurement. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 327–340, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10014 相似文献
39.
We study the (s,S) inventory system in which the server takes a rest when the level of the inventory is zero. The demands are assumed to occur for one unit at a time. The interoccurrence times between successive demands, the lead times, and the rest times are assumed to follow general distributions which are mutually independent. Using renewal and convolution techniques we obtain the state transition probabilities. 相似文献
40.
AbstractThe Military Compensation and Retirement Modernization Commission was established by the Congress in 2013 to perform a systematic review of military compensation to address rising costs and other trends. Their recommendation for reforming the TRICARE health care program was sweeping, and differed greatly from earlier proposals that focused on increasing beneficiary cost shares. Specifically, the commission proposed overhauling the current benefit delivery model and replacing it with a premium-based insurance model offering a menu of DoD-sponsored private health plans. The analysis presented here is based on work that supported the commission by estimating the budgetary impact of its proposed reforms. Results indicate that movement towards the premium-based model would produce an annual budgetary cost savings in the $2 billion to $4 billion range, with a best savings estimate of $3.2 billion. 相似文献