全文获取类型
收费全文 | 569篇 |
免费 | 22篇 |
国内免费 | 1篇 |
出版年
2021年 | 7篇 |
2019年 | 12篇 |
2018年 | 8篇 |
2017年 | 12篇 |
2016年 | 12篇 |
2015年 | 10篇 |
2014年 | 7篇 |
2013年 | 113篇 |
2012年 | 6篇 |
2011年 | 8篇 |
2010年 | 6篇 |
2009年 | 9篇 |
2008年 | 7篇 |
2007年 | 6篇 |
2006年 | 9篇 |
2005年 | 9篇 |
2004年 | 9篇 |
2003年 | 7篇 |
2000年 | 6篇 |
1999年 | 6篇 |
1997年 | 7篇 |
1996年 | 14篇 |
1995年 | 5篇 |
1994年 | 12篇 |
1993年 | 12篇 |
1992年 | 11篇 |
1991年 | 17篇 |
1989年 | 10篇 |
1988年 | 8篇 |
1987年 | 10篇 |
1986年 | 14篇 |
1985年 | 19篇 |
1984年 | 8篇 |
1983年 | 7篇 |
1982年 | 6篇 |
1981年 | 5篇 |
1980年 | 10篇 |
1979年 | 10篇 |
1978年 | 11篇 |
1977年 | 6篇 |
1976年 | 11篇 |
1975年 | 11篇 |
1974年 | 9篇 |
1973年 | 10篇 |
1972年 | 13篇 |
1971年 | 9篇 |
1970年 | 12篇 |
1969年 | 6篇 |
1968年 | 9篇 |
1967年 | 7篇 |
排序方式: 共有592条查询结果,搜索用时 31 毫秒
461.
John E. Mitchell 《海军后勤学研究》2003,50(7):683-701
The National Football League (NFL) in the United States expanded to 32 teams in 2002 with the addition of a team in Houston. At that point, the league was realigned into eight divisions, each containing four teams. We describe a branch‐and‐cut algorithm for minimizing the sum of intradivisional travel distances. We consider first the case where any team can be assigned to any division. We also consider imposing restrictions, such as aligning the AFC (American Football Conference) and the NFC (National Football Conference) separately or maintaining traditional rivalries. We show that the alignment chosen by the NFL does not minimize the sum of intradivisional travel distances, but that it is close to optimal for an alignment that aligns the NFC and AFC separately and imposes some additional restrictions. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 683–701, 2003. 相似文献
462.
Ana E. Juncos 《Contemporary Security Policy》2018,39(1):95-118
ABSTRACTAttempts to explain the failure to reform the security sectors in post-conflict countries have often resorted to two sets of explanatory factors: international and local factors. This article seeks to move from that unhelpful dichotomy to an explanation linking both factors. Drawing on a Foucauldian approach and the concept of “counter-conduct,” it examines the rationality and practices of European Union (EU) governmentality and how governing technologies are resisted and reversed by local elites involved in security sector reform (SSR). Instead of understanding power and resistance as binary opposites, this article argues that counter-conduct can be conceived as implicated in the very relations of power that it seeks to resist. To tease out these relations, the article analyzes the EU's efforts in SSR in Bosnia and Herzegovina, where it identifies four forms of counter-conduct: upholding European standards, using the local ownership trap, simulating reforms, and lowering the bar. 相似文献
463.
A method previously devised for the solution of the p-center problem on a network has now been extended to solve the analogous minimax location-allocation problem in continuous space. The essence of the method is that we choose a subset of the n points to be served and consider the circles based on one, two, or three points. Using a set-covering algorithm we find a set of p such circles which cover the points in the relaxed problem (the one with m < n points). If this is possible, we check whether the n original points are covered by the solution; if so, we have a feasible solution to the problem. We now delete the largest circle with radius rp (which is currently an upper limit to the optimal solution) and try to find a better feasible solution. If we have a feasible solution to the relaxed problem which is not feasible to the original, we augment the relaxed problem by adding a point, preferably the one which is farthest from its nearest center. If we have a feasible solution to the original problem and we delete the largest circle and find that the relaxed problem cannot be covered by p circles, we conclude that the latest feasible solution to the original problem is optimal. An example of the solution of a problem with ten demand points and two and three service points is given in some detail. Computational data for problems of 30 demand points and 1–30 service points, and 100, 200, and 300 demand points and 1–3 service points are reported. 相似文献
464.
In this article, we define a scheduling/packing problem called the Job Splitting Problem, motivated by the practices in the printing industry. There are n types of items to be produced on an m‐slot machine. A particular assignment of the types to the slots is called a “run” configuration and requires a setup cost. Once a run begins, the production continues according to that configuration and the “length” of the run represents the quantity produced in each slot during that run. For each unit of production in excess of demand, there is a waste cost. Our goal is to construct a production plan, i.e., a set of runs, such that the total setup and waste cost is minimized. We show that the problem is strongly NP‐hard and propose two integer programming formulations, several preprocessing steps, and two heuristics. We also provide a worst‐case bound for one of the heuristics. Extensive tests on real‐world and randomly generated instances show that the heuristics are both fast and effective, finding near‐optimal solutions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
465.
466.
467.
468.
火灾预防和火灾扑救不仅仅是消防部门自身的职责,必须依靠社会综合力量,政府是处置各类突发事件的强势者。从北京沧达农工商公司草垛火灾谈起,对政府职责、单位消防安全责任、社会应急机制等存在的问题做了进一步阐述。 相似文献
469.
Recent years have seen a strong trend toward outsourcing warranty repair services to outside vendors. In this article we consider the problem of dynamically routing warranty repairs to service vendors when warranties have priority levels. Each time an item under warranty fails, it is sent to one of the vendors for repair. Items covered by higher priority warranty receive higher priority in repair service. The manufacturer pays a fixed fee per repair and incurs a linear holding cost while an item is undergoing or waiting for repair. The objective is to minimize the manufacturer's long‐run average cost. Because of the complexity of the problem, it is very unlikely that there exist tractable ways to find the optimal routing strategies. Therefore, we propose five heuristic routing procedures that are applicable to real‐life problems. We evaluate the heuristics using simulation. The simulation results show that the index‐based “generalized join the shortest queue” policy, which applies a single policy improvement step to an initial state‐independent policy, performs the best among all five heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
470.
We study how changes to the composition and employment of the US Navy combat logistic force (CLF) influence our ability to supply our navy worldwide. The CLF consists of about 30 special transport ships that carry ship and aircraft fuel, ordnance, dry stores, and food, and deliver these to client combatant ships underway, making it possible for our naval forces to operate at sea for extended periods. We have modeled CLF operations to evaluate a number of transforming initiatives that simplify its operation while supporting an even larger number of client ships for a greater variety of missions. Our input is an employment schedule for navy battle groups of ships operating worldwide, extending over a planning horizon of 90–180 days. We show how we use optimization to advise how to sustain these ships. We have used this model to evaluate new CLF ship designs, advise what number of ships in a new ship class would be needed, test concepts for forward at‐sea logistics bases in lieu of conventional ports, demonstrate the effects of changes to operating policy, and generally try to show whether and how the CLF can support planned naval operations. Published 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008 相似文献