全文获取类型
收费全文 | 651篇 |
免费 | 17篇 |
出版年
2019年 | 8篇 |
2018年 | 7篇 |
2017年 | 12篇 |
2016年 | 12篇 |
2015年 | 13篇 |
2014年 | 7篇 |
2013年 | 119篇 |
2011年 | 7篇 |
2009年 | 10篇 |
2007年 | 8篇 |
2005年 | 10篇 |
2004年 | 13篇 |
2003年 | 8篇 |
2002年 | 9篇 |
2001年 | 8篇 |
2000年 | 6篇 |
1999年 | 9篇 |
1998年 | 9篇 |
1997年 | 11篇 |
1996年 | 14篇 |
1995年 | 13篇 |
1994年 | 16篇 |
1993年 | 12篇 |
1992年 | 16篇 |
1991年 | 23篇 |
1990年 | 8篇 |
1989年 | 9篇 |
1988年 | 12篇 |
1987年 | 14篇 |
1986年 | 12篇 |
1985年 | 18篇 |
1984年 | 10篇 |
1983年 | 8篇 |
1982年 | 6篇 |
1981年 | 10篇 |
1980年 | 9篇 |
1979年 | 14篇 |
1978年 | 10篇 |
1977年 | 10篇 |
1976年 | 11篇 |
1975年 | 10篇 |
1974年 | 12篇 |
1973年 | 8篇 |
1972年 | 16篇 |
1971年 | 12篇 |
1970年 | 11篇 |
1969年 | 8篇 |
1968年 | 8篇 |
1967年 | 10篇 |
1966年 | 5篇 |
排序方式: 共有668条查询结果,搜索用时 15 毫秒
551.
552.
Peter C. Fishburn 《海军后勤学研究》1988,35(6):567-574
It is shown that when X is an arbitrary finite subset of an n-factor product set and preference relations on each factor or criterion are assumed only to be asymmetric, efficient (undominated) points always exist in the set P of probability distributions on X when the preference relations are extended to probability distributions on the factors according to SSB utility theory. Thus, arbitrary finite structures and potentially cyclic preferences do not present a problem for the theory of efficiency under the convexification-extension procedure. 相似文献
553.
We consider a generalized minmax programming problem, and establish, under certain weaker convexity assumptions, the Fritz John sufficient optimality conditions for such a problem. A dual program is introduced and using those optimality conditions duality theorems are proved relating the dual and the primal. Duality for the generalized fractional programming problem is considered as an application of the results proved. 相似文献
554.
Resource-constrained project scheduling with cash flows occurs in many settings, ranging from research and development to commercial and residential construction. Although efforts have been made to develop efficient optimal procedures to maximize the net present value of cash flows for resource-constrained projects, the inherent intractability of the problem has led to the development of a variety of heuristic methods to aid in the development of near-optimal schedules for large projects. This research focuses on the use of insights gained from the solution of a relaxed optimization model in developing heuristic procedures to schedule projects with multiple constrained resources. It is shown that a heuristic procedure with embedded priority rules that uses information from the revised solution of a relaxed optimization model increases project net present value. The heuristic procedure and nine different embedded priority rules are tested in a variety of project environments that account for different network structures, levels of resource constrainedness, and cash-flow parameters. Extensive testing with problems ranging in size from 21 to 1000 activities shows that the new heuristic procedures dominate heuristics using information from the critical path method (CPM), and in most cases outperform heuristics from previous research. The best performing heuristic rules classify activities into priority and secondary queues according to whether they lead to immediate progress payments, thus front loading the project schedule. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 365–381, 1997 相似文献
555.
Previous studies criticize the general use of the normal approximation of lead-time demand on the grounds that it can lead to serious errors in safety stock. We reexamine this issue for the distribution of fast-moving finished goods. We first determine the optimal reorder points and quantities by using the classical normal-approximation method and a theoretically correct procedure. We then evaluate the misspecification error of the normal approximation solution with respect to safety stock, logistics-system costs, total costs (logistics costs, including acquisition costs), and fill rates. The results provide evidence that the normal approximation is robust with respect to both cost and service for seven major industry groups. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 165–186, 1997 相似文献
556.
A centralized inventory system serves a number of stores with common ownership, and thus reliable and timely information sharing. Each of them pays a share of the inventory cost, and the reward structure leaves the owners of individual stores rewarded for their individual performance. Appropriate selection of a cost allocation method is important if such a centralized system is to last. In this work we propose three necessary criteria—stability (core of a related cooperative game), justifiability (consistency of benefits with costs), and polynomial computability. For a concrete example we demonstrate that common allocation procedures may not meet all three tests, and we present a method that that meets all three criteria. This kind of cost allocation analysis helps the common management to evaluate the trade-offs in choosing an allocation scheme for the cost of inventory centralization. © 1996 John Wiley & Sons, Inc. 相似文献
557.
We consider a routing problem where the objective is to maximize the sum of the rewards collected at the nodes visited. Node rewards are decreasing linear functions of time. Time is spent when traveling between pairs of nodes, and while visiting the nodes. We propose a penalty-based greedy (heuristic) algorithm and a branch-and-bound (optimal) algorithm for this problem. The heuristic is very effective in obtaining good solutions. We can solve problems with up to 20 nodes optimally on a microcomputer using the branch-and-bound algorithm. We report our computational experience with this problem. © 1996 John Wiley & Sons, Inc. 相似文献
558.
Functional equations enable us to arrive at a simple consensus model for fatigue life of longitudinal elements based on engineering principles. The model is then applied to two representative data sets. By the application of proportional hazards techniques and subsequent likelihood analysis, simple parsimonious Weibull models are derived. Inter alia attention is given to the desirability of deriving models exhibiting plausible asymptotic independence. © 1996 John Wiley & Sons, Inc. 相似文献
559.
We present a computationally efficient procedure to determine control policies for an infinite horizon Markov Decision process with restricted observations. The optimal policy for the system with restricted observations is a function of the observation process and not the unobservable states of the system. Thus, the policy is stationary with respect to the partitioned state space. The algorithm we propose addresses the undiscounted average cost case. The algorithm combines a local search with a modified version of Howard's (Dynamic programming and Markov processes, MIT Press, Cambridge, MA, 1960) policy iteration method. We demonstrate empirically that the algorithm finds the optimal deterministic policy for over 96% of the problem instances generated. For large scale problem instances, we demonstrate that the average cost associated with the local optimal policy is lower than the average cost associated with an integer rounded policy produced by the algorithm of Serin and Kulkarni Math Methods Oper Res 61 (2005) 311–328. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
560.
This article develops a mathematical model and heuristic algorithm to design recreational boating mooring fields. The boating industry is important to the Florida economy, and boat storage is becoming a concern among those in the industry. The mooring field design problem is formulated to maximize the total number of boat feet moored in the mooring field. In the model, we allow two adjacent moorings to overlap, which introduces a risk that under certain conditions the boats on these moorings could contact each other. We identify the conditions when contact is possible and quantify the probability of contact. The mooring field design problem is formulated as a nonlinear mixed‐integer programming problem. To solve the problem, we decompose it into two separate models, a mooring radii assignment model and a mooring layout model, which are solved sequentially. The first is solved via exhaustive enumeration and the second via a depth‐first search algorithm. Two actual mooring fields are evaluated, and in both cases our model leads to better layouts than ones experts developed manually. The mooring field design model rationalizes the mooring field design and shows that in one case by increasing the risk from 0 to 1%, the mooring efficiency increases from 74.8% to 96.2%. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献