全文获取类型
收费全文 | 190篇 |
免费 | 9篇 |
出版年
2021年 | 1篇 |
2019年 | 4篇 |
2018年 | 5篇 |
2017年 | 8篇 |
2016年 | 5篇 |
2015年 | 5篇 |
2014年 | 5篇 |
2013年 | 68篇 |
2012年 | 2篇 |
2011年 | 5篇 |
2010年 | 3篇 |
2009年 | 4篇 |
2008年 | 4篇 |
2007年 | 2篇 |
2006年 | 5篇 |
2005年 | 7篇 |
2004年 | 4篇 |
2003年 | 2篇 |
2002年 | 3篇 |
2000年 | 2篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 4篇 |
1993年 | 2篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1983年 | 2篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1977年 | 1篇 |
1975年 | 3篇 |
1973年 | 1篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1969年 | 2篇 |
1967年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有199条查询结果,搜索用时 15 毫秒
21.
Having a robustly designed supply chain network is one of the most effective ways to hedge against network disruptions because contingency plans in the event of a disruption are often significantly limited. In this article, we study the facility reliability problem: how to design a reliable supply chain network in the presence of random facility disruptions with the option of hardening selected facilities. We consider a facility location problem incorporating two types of facilities, one that is unreliable and another that is reliable (which is not subject to disruption, but is more expensive). We formulate this as a mixed integer programming model and develop a Lagrangian Relaxation‐based solution algorithm. We derive structural properties of the problem and show that for some values of the disruption probability, the problem reduces to the classical uncapacitated fixed charge location problem. In addition, we show that the proposed solution algorithm is not only capable of solving large‐scale problems, but is also computationally effective. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
22.
23.
A modified generalized programming procedure is presented for solving concave programming problems with equality constraints. The procedure constructs convenient linear approximations of the gradient of the dual and finds points where the approximating functions vanish. In the quadratic programming case, the procedure is finitely convergent. Global convergence is established for the non-quadratic case. Illustrative numerical examples are included. 相似文献
24.
25.
We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is required if a machine switches over from one job to another. Each order is released at time zero and has a positive weight. Preemptions are not allowed. The completion time of an order is the time at which all jobs of that order have been completed. The objective is to minimize the total weighted completion time of the orders. The problem is NP‐hard for any fixed number (≥2) of machines. Because of this, we focus our attention on two classes of heuristics, which we refer to as sequential two‐phase heuristics and dynamic two‐phase heuristics. We perform a worst case analysis as well as an empirical analysis of nine heuristics. Our analyses enable us to rank these heuristics according to their effectiveness, taking solution quality as well as running time into account. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
26.
The Federal Aviation Administration (FAA) and the airline community within the United States have adopted a new paradigm for air traffic flow management, called Collaborative Decision Making (CDM). A principal goal of CDM is shared decision‐making responsibility between the FAA and airlines, so as to increase airline control over decisions that involve economic tradeoffs. So far, CDM has primarily led to enhancements in the implementation of Ground Delay Programs, by changing procedures for allocating slots to airlines and exchanging slots between airlines. In this paper, we discuss how these procedures may be formalized through appropriately defined optimization models. In addition, we describe how inter‐airline slot exchanges may be viewed as a bartering process, in which each “round” of bartering requires the solution of an optimization problem. We compare the resulting optimization problem with the current procedure for exchanging slots and discuss possibilities for increased decision‐making capabilities by the airlines. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
27.
George Michael 《The Nonproliferation Review》2013,20(1):143-147
Ron Rosenbaum, How the End Begins: The Road to a Nuclear World War III. Simon & Schuster, 2011. 305 pages, $28. 相似文献
28.
The efforts of President Barack Obama and his administration to restore the United States as a driving force of multilateral arms control and nonproliferation negotiations are commendable, yet the lack of progress on such issues over the last eight years has ensured that U.S. policy has not kept pace with changes in the geostrategic environment and the evolving security agenda. Meanwhile, an alternative agenda has been articulated by non-Western countries. This article focuses on the arms control perspectives of Non-Aligned Movement states and others that have begun to embrace the idea of “disarmament as humanitarian action.” It explores this idea in the context of recent initiatives and argues that if the Obama administration wants to make progress on its arms control and nonproliferation priorities, it should consider a multifaceted approach that incorporates this emerging alternative agenda. 相似文献
29.
Michael Beenstock 《Defence and Peace Economics》2013,24(3):171-222
The literature on economic aspects of defence in Israel is critically reviewed by subject: measuring the defence burden, the determinants of defence spending, the effects of defence spending on the economy, and the military‐industrial complex. An overview of the Israeli economy is provided, and some new econometric findings on the determinants of defence spending are presented. The paper concludes by addressing policy issues in the context of Israel's jubilee. 相似文献
30.