全文获取类型
收费全文 | 292篇 |
免费 | 9篇 |
国内免费 | 1篇 |
出版年
2020年 | 2篇 |
2019年 | 11篇 |
2018年 | 7篇 |
2017年 | 5篇 |
2016年 | 4篇 |
2015年 | 2篇 |
2014年 | 7篇 |
2013年 | 55篇 |
2012年 | 3篇 |
2010年 | 8篇 |
2007年 | 6篇 |
2006年 | 2篇 |
2005年 | 6篇 |
2004年 | 5篇 |
2003年 | 2篇 |
2002年 | 7篇 |
2000年 | 2篇 |
1999年 | 4篇 |
1998年 | 7篇 |
1997年 | 7篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1994年 | 10篇 |
1993年 | 9篇 |
1992年 | 6篇 |
1991年 | 7篇 |
1990年 | 7篇 |
1989年 | 4篇 |
1988年 | 9篇 |
1987年 | 3篇 |
1986年 | 6篇 |
1985年 | 7篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 4篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 4篇 |
1976年 | 4篇 |
1975年 | 5篇 |
1974年 | 3篇 |
1973年 | 5篇 |
1972年 | 4篇 |
1969年 | 2篇 |
1968年 | 6篇 |
1967年 | 2篇 |
1966年 | 3篇 |
1948年 | 2篇 |
排序方式: 共有302条查询结果,搜索用时 15 毫秒
101.
Multiple-facility loading (MFL) involves the allocation of products among a set of finite-capacity facilities. Applications of MFL arise naturally in a variety of production scheduling environments. MFL models typically assume that capacity is consumed as a linear function of products assigned to a facility. Product similarities and differences, however, result in capacity-based economies or diseconomies of scope, and thus the effective capacity of the facility is often a (nonlinear) function of the set of tasks assigned to the facility. This article addresses the multiple-facility loading problem under capacity-based economies (and diseconomies) of scope (MFLS). We formulate MFLS as a nonlinear 0–1 mixed-integer programming problem, and we discuss some useful properties. MFLS generalizes many well-known combinatorial optimization problems, such as the capacitated facility location problem and the generalized assignment problem. We also define a tabu-search heuristic and a branch-and-bound algorithm for MFLS. The tabu-search heuristic alternates between two search phases, a regional search and a diversification search, and offers a novel approach to solution diversification. We also report computational experience with the procedures. In addition to demonstrating MFLS problem tractability, the computational results indicate that the heuristic is an effective tool for obtaining high-quality solutions to MFLS. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 229–256, 1997 相似文献
102.
This paper develops a new model for allocating demand from retailers (or customers) to a set of production/storage facilities. A producer manufactures a product in multiple production facilities, and faces demand from a set of retailers. The objective is to decide which of the production facilities should satisfy each retailer's demand, in order minimize total production, inventory holding, and assignment costs (where the latter may include, for instance, variable production costs and transportation costs). Demand occurs continuously in time at a deterministic rate at each retailer, while each production facility faces fixed‐charge production costs and linear holding costs. We first consider an uncapacitated model, which we generalize to allow for production or storage capacities. We then explore situations with capacity expansion opportunities. Our solution approach employs a column generation procedure, as well as greedy and local improvement heuristic approaches. A broad class of randomly generated test problems demonstrates that these heuristics find high quality solutions for this large‐scale cross‐facility planning problem using a modest amount of computation time. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
103.
Charles Kirke 《Defense & Security Analysis》2015,31(1):74-82
This article describes the results of research into the social phenomenon of “respect” as framed by junior members of the British Army, as part of a wider study into the Values and Standards of the British Army. This research was interview based, using qualitative analysis software to detect, manage, and draw conclusions from the qualitative data recorded in those interviews. The data indicated that the primary situation in which “respect” was visualised by the participants was the unit context, and that it comprised a combination of three different strands: respect for rank or “hierarchical respect,” “professional respect” for a person's military competence, and “personal respect” for an individual's character, personal behaviour, and attributes. The overall respect that an individual is given arises from the combination of these three areas. “Respect” as a concept was, in the soldiers’ characterisation, something that had to be earned (except for the “given” represented by rank) and was not stable: a person's fund of respect could go up or down in social value. Respect was also linked to trust: the more respect a person had, the more they could be trusted. Although the unit context was the primary one for discussing their framing of the concept of respect, many of the participants reported a wider dimension in which every human being deserves a basic level of respect simply for being human, and this level could not be forfeited. 相似文献
104.
105.
For many years, non-nuclear weapons states have sought binding commitments from nuclear armed states that they would not be the victim of either the threat or use of nuclear weapons—so-called negative security assurances (NSAs). The nuclear weapon states have traditionally resisted granting such unconditional NSAs. Recent U.S. efforts to use nuclear deterrence against the acquisition and use by other states of chemical, biological and radiological weapons, however, have further exacerbated this divide. This article analyzes the historical development of NSAs and contrasts U.S. commitments not to use nuclear weapons with the empirical realities of current U.S. nuclear weapons employment doctrines. The authors conclude that NSAs are most likely to be issued as unilateral declarations and that such pledges are the worst possible manner in which to handle the issue of security assurance. 相似文献
106.
107.
Automated responses are an inevitable aspect of cyberwarfare, but there has not been a systematic treatment of the conditions in which they are morally permissible. We argue that there are three substantial barriers to the moral permissibility of an automated response: the attribution, chain reaction, and projection bias problems. Moreover, these three challenges together provide a set of operational tests that can be used to assess the moral permissibility of a particular automated response in a specific situation. Defensive automated responses will almost always pass all three challenges, while offensive automated responses typically face a substantial positive burden in order to overcome the chain reaction and projection bias challenges. Perhaps the most interesting cases arise in the middle ground between cyber-offense and cyber-defense, such as automated cyber-exploitation responses. In those situations, much depends on the finer details of the response, the context, and the adversary. Importantly, however, the operationalizations of the three challenges provide a clear guide for decision-makers to assess the moral permissibility of automated responses that could potentially be implemented. 相似文献
108.
Brendan Simms Bruce Hoffman Daniel W. Fitz‐Simons Robert H. Dorff Jennifer Morrison Taw Gabriel Marcella 《Small Wars & Insurgencies》2013,24(1):127-139
Frank Zimmer, Bismarcks Kampf gegen Kaiser Franz Joseph Konigsgratz und seine Folgen. Graz, Vienna, Cologne: Styria Verlag 1996. Pp.203,49 illus., 1 map. OS 350/DM 49. ISBN 3–222–12377–2. Saul Zadka, Blood in Zion: How the Jewish Guerrillas drove the British out of Palestine. London and Washington: Brassey's, 1995. Pp.227, chron., illus., index. £19.95. ISBN 1–85753–136–1. Theodore L. Gatchel, At the Water's Edge: Defending against the Modern Amphibious Assault. Annapolis, MD: Naval Institute Press, 1996. Pp.xvi+217, notes, biblio, index. $36.95. ISBN 1–55750–308–7. Max G. Manwaring and William J. Olson (eds.) Managing Contemporary Conflict: Pillars of Success. Boulder, CO: Westview Press, 1996. Pp.269, no index. $65 (cloth); $25 (paper). ISBN 0–8133–8969 and 9978–5 Chris Seiple, The US Military/NGO Relationship in Humanitarian Interventions, Carlisle Barracks, PA: The Richard L. Millett and Michael Gold‐Biss (eds.) Beyond Praetorianism: The Latin American Military in Transition. University of Miami: North/South Center Press; Boulder, CO: Lynne Rienner, 1996. Pp.xv +317, index. $24.95. ISBN 1–5745–000–9. Rudolph C. Barnes Jr, Military Legitimacy: Might and Right in the New Millennium. London and Portland, OR: Frank Cass, 1996. Pp.199, select biblio., index. £27.50/$39.50, ISBN 0–714–4624–5. 相似文献
109.
The stochastic sequential assignment problem (SSAP) considers how to allocate available distinct workers to sequentially arriving tasks with stochastic parameters such that the expected total reward obtained from the sequential assignments is maximized. Implementing the optimal assignment policy for the SSAP involves calculating a new set of breakpoints upon the arrival of each task (i.e., for every time period), which is impractical for large‐scale problems. This article studies two problems that are concerned with obtaining stationary policies, which achieve the optimal expected reward per task as the number of tasks approaches infinity. The first problem considers independent and identically distributed (IID) tasks with a known distribution function, whereas in the second problem tasks are derived from r different unobservable distributions governed by an ergodic Markov chain. The convergence rate of the expected reward per task to the optimal value is also obtained for both problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
110.