全文获取类型
收费全文 | 207篇 |
免费 | 10篇 |
出版年
2021年 | 1篇 |
2019年 | 5篇 |
2018年 | 6篇 |
2017年 | 9篇 |
2016年 | 6篇 |
2015年 | 5篇 |
2014年 | 5篇 |
2013年 | 68篇 |
2012年 | 2篇 |
2011年 | 5篇 |
2010年 | 3篇 |
2009年 | 6篇 |
2008年 | 4篇 |
2007年 | 3篇 |
2006年 | 6篇 |
2005年 | 9篇 |
2004年 | 5篇 |
2003年 | 2篇 |
2002年 | 4篇 |
2000年 | 2篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1992年 | 6篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1987年 | 4篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1983年 | 2篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1975年 | 3篇 |
1973年 | 1篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1967年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有217条查询结果,搜索用时 15 毫秒
81.
In this article the problem of minimizing the mean absolute deviation (MAD) of job completion times about an unrestricted given common due date with tolerance in the n-job, single-machine scheduling environment is considered. We describe some optimality conditions and show that the unrestricted version of the MAD problem with an arbitrary due date tolerance is polynomial by proposing a polynomial-time algorithm for identifying an optimal schedule. © 1994 John Wiley & Sons, Inc. 相似文献
82.
Michael S. Curl 《Arms and Armour》2019,16(1):27-55
Despite the lance’s status and the amount of attention the couched lance has received in historiography, study of its martial art has been neglected. The various lance types and techniques used by western European cavalry have only recently begun to receive scholarly attention. Additionally, Medieval European lance use has too often been studied in isolation, without an adequate understanding of the idiosyncratic and asymmetrical dynamics of mounted combat. Although the charge with the couched lance was a valid tactic, it was only one of many. Light and heavy lances were used in one hand or two to trip, block, unhorse, and wrestle. These techniques were governed by the harsh laws of distance, speed, impact, iron, and asymmetry. By utilizing the surviving Fechtbücher and several Peninsular and Near Eastern sources, a brief foray into the diverse techniques of lance use and their purposes has been attempted here. 相似文献
83.
84.
Branch‐and‐price‐and‐cut for the manpower routing problem with synchronization constraints 下载免费PDF全文
In this article, we propose a branch‐and‐price‐and‐cut (BPC) algorithm to exactly solve the manpower routing problem with synchronization constraints (MRPSC). Compared with the classical vehicle routing problems (VRPs), the defining characteristic of the MRPSC is that multiple workers are required to work together and start at the same time to carry out a job, that is, the routes of the scheduling subjects are dependent. The incorporation of the synchronization constraints increases the difficulty of the MRPSC significantly and makes the existing VRP exact algorithm inapplicable. Although there are many types of valid inequalities for the VRP or its variants, so far we can only adapt the infeasible path elimination inequality and the weak clique inequality to handle the synchronization constraints in our BPC algorithm. The experimental results at the root node of the branch‐and‐bound tree show that the employed inequalities can effectively improve the lower bound of the problem. Compared with ILOG CPLEX, our BPC algorithm managed to find optimal solutions for more test instances within 1 hour. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 138–171, 2016 相似文献
85.
86.
Firing multiple artillery rounds from the same location has two main benefits: a high rate of fire at the enemy and improved accuracy as the shooter's aim adjusts to previous rounds. However, firing repeatedly from the same location carries significant risk that the enemy will detect the artillery's location. Therefore, the shooter may periodically move locations to avoid counter‐battery fire. This maneuver is known as the shoot‐and‐scoot tactic. This article analyzes the shoot‐and‐scoot tactic for a time‐critical mission using Markov models. We compute optimal move policies and develop heuristics for more complex and realistic settings. Spending a reasonable amount of time firing multiple shots from the same location is often preferable to moving immediately after firing an initial salvo. Moving frequently reduces risk to the artillery, but also limits the artillery's ability to inflict damage on the enemy. 相似文献
87.
The global financial turmoil of 2008 has resulted in the curtailment of military expenditure in most western countries. At a sub-regional-level reductions in the level of activity at a major military facility can have significant economic impact. In the light of this, the paper has two objectives: to analyse the impact of the decision to terminate naval shipbuilding at the United Kingdom’s Portsmouth Naval Base; and, for illustrative purposes, to examine the possible economic consequences of further contraction at the facility. In pursuit of these aims, it is necessary to establish the output, income and employment generated by the base using a bespoke input–output model. The methodology employed can, with appropriate adjustments, be utilised in other military or civilian contexts. 相似文献
88.
Michael Tkacik 《Defense & Security Analysis》2018,34(4):321-344
ABSTRACTThe slow moving conflict in the South China Sea has been characterized by some as “not worth the candle.” China claims the entirety of the South China Sea pursuant to a nine-dash line, the legal impact of which has been limited by international courts. At the same time, China has changed the reality of control over the South China Sea by building a number of fortified islands in the Spratly Islands and elsewhere. The US has either refused to stand up to China's behavior (Obama) or responded unevenly (Trump). This paper examines the impact of China's behaviour on local parties, US interests, and the liberal international system. 相似文献
89.
Competitive imperatives are causing manufacturing firms to consider multiple criteria when designing products. However, current methods to deal with multiple criteria in product design are ad hoc in nature. In this paper we present a systematic procedure to efficiently solve bicriteria product design optimization problems. We first present a modeling framework, the AND/OR tree, which permits a simplified representation of product design optimization problems. We then show how product design optimization problems on AND/OR trees can be framed as network design problems on a special graph—a directed series‐parallel graph. We develop an enumerative solution algorithm for the bicriteria problem that requires as a subroutine the solution of the parametric shortest path problem. Although this parametric problem is hard on general graphs, we show that it is polynomially solvable on the series‐parallel graph. As a result we develop an efficient solution algorithm for the product design optimization problem that does not require the use of complex and expensive linear/integer programming solvers. As a byproduct of the solution algorithm, sensitivity analysis for product design optimization is also efficiently performed under this framework. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 574–592, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10031 相似文献
90.
Clustering problems are often difficult to solve due to nonlinear cost functions and complicating constraints. Set partitioning formulations can help overcome these challenges, but at the cost of a very large number of variables. Therefore, techniques such as delayed column generation must be used to solve these large integer programs. The underlying pricing problem can suffer from the same challenges (non‐linear cost, complicating constraints) as the original problem, however, making a mathematical programming approach intractable. Motivated by a real‐world problem in printed circuit board (PCB) manufacturing, we develop a search‐based algorithm (Rank‐Cluster‐and‐Prune) as an alternative, present computational results for the PCB problem to demonstrate the tractability of our approach, and identify a broader class of clustering problems for which this approach can be used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献