全文获取类型
收费全文 | 469篇 |
免费 | 12篇 |
国内免费 | 1篇 |
出版年
2021年 | 5篇 |
2019年 | 13篇 |
2018年 | 7篇 |
2017年 | 9篇 |
2016年 | 7篇 |
2015年 | 5篇 |
2014年 | 8篇 |
2013年 | 100篇 |
2012年 | 4篇 |
2010年 | 8篇 |
2007年 | 8篇 |
2006年 | 4篇 |
2005年 | 9篇 |
2004年 | 6篇 |
2003年 | 4篇 |
2002年 | 8篇 |
2000年 | 4篇 |
1999年 | 7篇 |
1998年 | 7篇 |
1997年 | 7篇 |
1996年 | 7篇 |
1995年 | 6篇 |
1994年 | 12篇 |
1993年 | 12篇 |
1992年 | 8篇 |
1991年 | 11篇 |
1990年 | 9篇 |
1989年 | 8篇 |
1988年 | 10篇 |
1987年 | 6篇 |
1986年 | 10篇 |
1985年 | 10篇 |
1983年 | 4篇 |
1982年 | 12篇 |
1981年 | 6篇 |
1980年 | 8篇 |
1979年 | 6篇 |
1978年 | 7篇 |
1977年 | 6篇 |
1976年 | 5篇 |
1975年 | 8篇 |
1974年 | 8篇 |
1973年 | 10篇 |
1972年 | 7篇 |
1971年 | 9篇 |
1969年 | 7篇 |
1968年 | 10篇 |
1967年 | 4篇 |
1966年 | 4篇 |
1948年 | 5篇 |
排序方式: 共有482条查询结果,搜索用时 15 毫秒
171.
In this paper, we extend the results of Ferguson M. Naval Research Logistics 8 . on an end‐product manufacturer's choice of when to commit to an order quantity from its parts supplier. During the supplier's lead‐time, information arrives about end‐product demand. This information reduces some of the forecast uncertainty. While the supplier must choose its production quantity of parts based on the original forecast, the manufacturer can wait to place its order from the supplier after observing the information update. We find that a manufacturer is sometimes better off with a contract requiring an early commitment to its order quantity, before the supplier commits resources. On the other hand, the supplier sometimes prefers a delayed commitment. The preferences depend upon the amount of demand uncertainty resolved by the information as well as which member of the supply chain sets the exchange price. We also show conditions where demand information updating is detrimental to both the manufacturer and the supplier. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
172.
We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
173.
Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
174.
Ebru K. Bish Thin‐Yin Leong Chung‐Lun Li Jonathan W. C. Ng David Simchi‐Levi 《海军后勤学研究》2001,48(5):363-385
We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP‐hard and develop a heuristic algorithm based on formulating the problem as an assignment problem. The effectiveness of the heuristic is analyzed from both worst‐case and computational points of view. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 363–385, 2001 相似文献
175.
176.
David H. Ucko 《战略研究杂志》2016,39(1):29-61
Rather than win hearts and minds, authoritarian counterinsurgency is said to rely heavily on coercion. It has a reputation for effectiveness, if also for its amorality. Still, the research into authoritarian counterinsurgency is surprisingly lacking. By distilling common features from key cases, this article concludes that this approach goes beyond the indiscriminate violence that typically captures the imagination. Like their democratic counterparts but differently, authoritarian regimes also engage in mobilisation, create narratives, and turn military advantage into political gain. The analysis explains how these tasks are undertaken and, by contradistinction, sheds light on more liberal approaches as well. 相似文献
177.
In a previous paper, the authors have introduced a class of multivariate lifetimes (MIFRA) which generalize the univariate lifetimes with increasing failure rate average (IFRA). They have also shown that this class satisfies many fundamental properties. In this paper it is shown that other concepts of multivariate IFRA do not satisfy all of these properties. Relationships between MIFRA and these other concepts are given. Finally, positive dependence implications with respect to these classes are also discussed. 相似文献
178.
Mary W. Cooper 《海军后勤学研究》1981,28(2):301-307
An algorithm is presented to gain postoptimality data about the family of nonlinear pure integer programming problems in which the objective function and constraints remain the same except for changes in the right-hand side of the constraints. It is possible to solve such families of problems simultaneously to give a global optimum for each problem in the family, with additional problems solved in under 2 CPU seconds. This represents a small fraction of the time necessary to solve each problem individually. 相似文献
179.
Military Helicopters. By E. J. Everett‐Heath, G. M. Moss, A. W. Mowat and K. E. Reid. Brassey's, London (1990), ISBN 0–08–037341–0 (hardcover), ISBN 0–08–036716‐X (flexicover), £22.50 (hardcover), £12.95 (flexicover)
The Killing Ground: the British Army, the Western Front and the Emergence of Modern Warfare 1900–1918. By Tim Travers. Unwin‐Hyman, London (1990), ISBN 0–04–4457367, £11.95
The Influence of S. L. A. Marshall on the United States Army. By Major F. D. G. Williams. TRADOC Historical Monograph Series, Fort Monroe, VA (1990) 相似文献
180.
Lower confidence limits are derived for the impact probability within a circle of fixed radius. The bivariate normal distribution with zero means, unequal variances, and zero correlation is the probability model for impacts. A new representation of the impact probability function is offered. This presentation is valid also for the dependent case, where the eigenvalues of the covariance matrix replace the variances. When the ratio of variances is known the lower confidence limits are uniformly most accurate (UMA). A few alternative approaches are compared by simulation when the ratio of variances is unknown. 相似文献