全文获取类型
收费全文 | 710篇 |
免费 | 20篇 |
出版年
2021年 | 13篇 |
2019年 | 16篇 |
2018年 | 6篇 |
2017年 | 11篇 |
2016年 | 14篇 |
2015年 | 13篇 |
2014年 | 8篇 |
2013年 | 131篇 |
2011年 | 8篇 |
2009年 | 7篇 |
2007年 | 17篇 |
2005年 | 9篇 |
2004年 | 9篇 |
2003年 | 12篇 |
2002年 | 10篇 |
2001年 | 6篇 |
2000年 | 6篇 |
1999年 | 13篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 13篇 |
1995年 | 8篇 |
1994年 | 14篇 |
1993年 | 16篇 |
1992年 | 12篇 |
1991年 | 16篇 |
1990年 | 13篇 |
1989年 | 22篇 |
1988年 | 23篇 |
1987年 | 13篇 |
1986年 | 21篇 |
1985年 | 11篇 |
1984年 | 6篇 |
1983年 | 6篇 |
1982年 | 17篇 |
1981年 | 9篇 |
1980年 | 11篇 |
1979年 | 12篇 |
1978年 | 11篇 |
1977年 | 10篇 |
1976年 | 7篇 |
1975年 | 9篇 |
1974年 | 17篇 |
1973年 | 10篇 |
1972年 | 8篇 |
1971年 | 17篇 |
1970年 | 8篇 |
1969年 | 11篇 |
1968年 | 9篇 |
1967年 | 9篇 |
排序方式: 共有730条查询结果,搜索用时 31 毫秒
181.
Although cycling in the simplex method has long been known, a number of theoretical questions concerning cycling have not been fully answered. One of these, stated in [3], is to find the smallest example of cycling, and Beale's example with three equations and seven variables is conjectured to be the smallest one. The exact bounds on dimensions of cycling examples are established in this paper. We show that Beale's example is the smallest one which cycles at a non-optimal solution, that a smaller one can cycle at the optimum, and that, in general (including the completely degenerate case), a cycling example must have at least two equations, at least six variables, and at least three non-basic variables. Examples and geometries are given for the extreme cases, showing that the bounds are sharp. 相似文献
182.
183.
W. F. Lucas 《海军后勤学研究》1967,14(1):15-21
A unique polyhedral solution is given for most n-person games in partition function form when only partitions into coalitions with 1, n-1, and n players have large payoffs. 相似文献
184.
185.
186.
The objective of this article is to describe heuristic solutions to the problem of modeling inventories at each node of a large network in the context of a computer simulation model of that network. The heuristic solutions are compared with the mathematical solution which is too unwieldy for use in a simulation model. The Weibull cumulative distribution is used as an approximation for the heuristic models. We question whether the good performance of the Weibull is coincidence or perhaps mathematically justifiable. 相似文献
187.
T. M. Whitin 《海军后勤学研究》1985,32(2):361-362
This note points out the omission of a simple but vital constraint in the recent articles on partial backlogging. Also, a simple intuitive interpretation of the “backorder” inequality of [2], [3], and [4] is provided. 相似文献
188.
An important aspect of supply chain management is dealing with demand and supply uncertainty. The uncertainty of future supply can be reduced if a company is able to obtain advance capacity information (ACI) about future supply/production capacity availability from its supplier. We address a periodic‐review inventory system under stochastic demand and stochastic limited supply, for which ACI is available. We show that the optimal ordering policy is a state‐dependent base‐stock policy characterized by a base‐stock level that is a function of ACI. We establish a link with inventory models that use advance demand information (ADI) by developing a capacitated inventory system with ADI, and we show that equivalence can only be set under a very specific and restrictive assumption, implying that ADI insights will not necessarily hold in the ACI environment. Our numerical results reveal several managerial insights. In particular, we show that ACI is most beneficial when there is sufficient flexibility to react to anticipated demand and supply capacity mismatches. Further, most of the benefits can be achieved with only limited future visibility. We also show that the system parameters affecting the value of ACI interact in a complex way and therefore need to be considered in an integrated manner. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
189.
This paper presents a new methodology to solve the cyclic preference scheduling problem for hourly workers. The focus is on nurse rostering but is applicable to any organization in which the midterm scheduling decision must take into account a complex of legal, institutional, and preferential constraints. The objective is to strike a balance between satisfying individual preferences and minimizing personnel costs. The common practice is to consider each planning period independently and to generate new rosters at the beginning of each. To reduce some of the instability in the process, there is a growing trend toward cyclic schedules, which are easier to manage and are generally perceived to be more equitable. To address this problem, a new integer programming model is presented that combines the elements of both cyclic and preference scheduling. To find solutions, a branch‐and‐price algorithm is developed that makes use of several branching rules and an extremely effective rounding heuristic. A unique feature of the formulation is that the master problem contains integer rather than binary variables. Computational results are reported for problem instances with up to 200 nurses. Most were solved within 10 minutes and many within 3 minutes when a double aggregation approach was applicable. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
190.
This study presents power‐of‐two policies for a serial inventory system with constant demand rate and incremental quantity discounts at the most upstream stage. It is shown that an optimal solution is nested and follows a zero‐inventory ordering policy. To prove the effectiveness of power‐of‐two policies, a lower bound on the optimal cost is obtained. A policy that has a cost within 6% of the lower bound is developed for a fixed base planning period. For a variable base planning period, a 98% effective policy is provided. An extension is included for a system with price dependent holding costs. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献