全文获取类型
收费全文 | 224篇 |
免费 | 9篇 |
出版年
2019年 | 7篇 |
2018年 | 8篇 |
2017年 | 5篇 |
2016年 | 10篇 |
2015年 | 6篇 |
2014年 | 5篇 |
2013年 | 50篇 |
2012年 | 2篇 |
2011年 | 4篇 |
2009年 | 5篇 |
2008年 | 3篇 |
2006年 | 3篇 |
2005年 | 4篇 |
2004年 | 5篇 |
2003年 | 6篇 |
2002年 | 4篇 |
2001年 | 2篇 |
2000年 | 5篇 |
1997年 | 3篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1994年 | 2篇 |
1993年 | 4篇 |
1992年 | 2篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 4篇 |
1988年 | 8篇 |
1987年 | 4篇 |
1986年 | 6篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1974年 | 6篇 |
1973年 | 2篇 |
1972年 | 4篇 |
1971年 | 4篇 |
1970年 | 3篇 |
1969年 | 4篇 |
1968年 | 3篇 |
1966年 | 1篇 |
1948年 | 1篇 |
排序方式: 共有233条查询结果,搜索用时 15 毫秒
81.
Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear‐time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial‐time, dynamic programming algorithm to find the optimal solution. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
82.
We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect b‐matching problem. In general, we may use a polynomial‐time greedy heuristic similar to the one for the classical weighted set covering problem studied by D.S. Johnson [Approximation algorithms for combinatorial problems, J Comput Syst Sci 9 (1974), 256–278], L. Lovasz [On the ratio of optimal integral and fractional covers, Discrete Math 13 (1975), 383–390], and V. Chvatal [A greedy heuristic for the set‐covering problem, Math Oper Res 4(3) (1979), 233–235] to get an approximate solution for the problem. We find a worst‐case bound for the heuristic similar to that for the classical problem. In addition, we introduce a general type of probability distribution for the population of the problem instances and prove that the greedy heuristic is asymptotically optimal for instances drawn from such a distribution. We also conduct computational studies to compare solutions resulting from running the heuristic and from running the commercial integer programming solver CPLEX on problem instances drawn from a more specific type of distribution. The results clearly exemplify benefits of using the greedy heuristic when problem instances are large. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
83.
This study addresses the design of a three‐stage production/distribution system where the first stage includes the set of established retailers and the second and third stages include the sets of potential distribution centers (DCs) and potential capacitated suppliers, respectively. In this problem, in addition to the fixed location/operating costs associated with locating DCs and suppliers, we consider the coordinated inventory replenishment decisions at the located DCs and retailers along with the appropriate inventory costs explicitly. In particular, we account for the replenishment and holding costs at the retailers and selected DCs, and the fixed plus distance‐based transportation costs between the selected plants and their assigned DCs, and between the selected DCs and their respective retailers, explicitly. The resulting formulation is a challenging mixed‐integer nonlinear programming model for which we propose efficient heuristic solution approaches. Our computational results demonstrate the performance of the heuristic approaches as well as the value of integrated decision‐making by verifying that significant cost savings are realizable when the inventory decisions and costs are incorporated in the production distribution system design. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 172–195, 2012 相似文献
84.
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 相似文献
85.
In this article, we study the stochastic version of the so-called bottleneck assignment problem. Our primary objective is to maximize the probability that the bottleneck value satisfies a specified target. Under general stochastic assumptions, we show that the solution in this case is easily obtained by solving a linear assignment problem. We next examine the situation where the target is to be minimized, given that the probability of satisfying the target exceeds a specified threshold. Finally, we address extensions to the original problem where a second objective is also considered. 相似文献
86.
Mathematical models are proposed for studying the impact of miscalibration upon operational effectiveness. Methodology for assessing the system effectiveness and an approach for optimizing the effectiveness of a calibration program are examined. The theory application is discussed and the results of some specific and convenient models are presented. 相似文献
87.
MacGregor and Harris (J Quality Technol 25 (1993) 106–118) proposed the exponentially weighted mean squared deviation (EWMS) and the exponentially weighted moving variance (EWMV) charts as ways of monitoring process variability. These two charts are particularly useful for individual observations where no estimate of variability is available from replicates. However, the control charts derived by using the approximate distributions of the EWMS and EWMV statistics are difficult to interpret in terms of the average run length (ARL). Furthermore, both control charting schemes are biased procedures. In this article, we propose two new control charts by applying a normal approximation to the distributions of the logarithms of the weighted sum of chi squared random variables, which are respectively functions of the EWMS and EWMV statistics. These new control charts are easy to interpret in terms of the ARL. On the basis of the simulation studies, we demonstrate that the proposed charts are superior to the EWMS and EWMV charts and they both are nearly unbiased for the commonly used smoothing constants. We also compare the performance of the proposed charts with that of the change point (CP) CUSUM chart of Acosta‐Mejia (1995). The design of the proposed control charts is discussed. An example is also given to illustrate the applicability of the proposed control charts. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
88.
Despite the burgeoning literature on Russia’s renewed power politics, little attention has been paid to the fact that US reactions towards Russia’s military interventions were all but coherent. The USA has chosen weak measures in Georgia in 2008 (shaming) compared to its assertive response in Ukraine in 2014 (sanctions, hard deterrence). This article assesses the explanatory power of neorealist, liberal and constructivist theories for the variation in US reactions towards Russian interventions in Georgia and Ukraine. Our argument is that the constructivist perspective explains the cases best as it highlights the power and communality of normative assessments. The Ukraine crisis was perceived by the USA as a violation of core international norms, especially the non-use of force and the principle of territorial integrity. Relevant international norm carriers shared this assessment of the conflict. In contrast, the perception of the Georgian war centred on the issue of democracy promotion. While democracy is an important aim of US foreign policy, it does not summon the same normative importance as general principles of international law. Furthermore, the perception of the Georgian war remained contested among Western allies, which decreased the communality of the normative assessment. 相似文献
89.
Joseph Olusegun Adebayo 《African Security Review》2016,25(3):303-315
Given that most Africans view political aspirants in terms of their ethnic and religious lineage rather than political ideology, and since most Africans rely on the media for information, there is a tendency to fall prey to biased and insensitive reportage, capable of inciting violence elicited by the prejudiced information often presented as news, features, commentaries, documentaries, etc. This article hypothesises that with appropriate training on conflict-sensitive reportage, journalists can foster peaceful and nonviolent elections through their reportage. The article recommends the adoption of an alternative method of news reportage using the peace-journalism model. The model, developed by Jake Lynch and Annabel McGoldrick, encourages journalists to report social issues in ways that create opportunities for a society to consider and value nonviolent responses toward conflict by using the insights from conflict analysis and transformation to update concepts of balance, fairness and accuracy in reporting. It also provides a new route map that traces the connections between journalists, their sources, the stories they cover and the consequences of their reportage. In addition, it builds awareness of nonviolence and brings creativity into the practical job of everyday editing and reporting. This article holds theoretical significance in that it explicitly identifies conditions that encourage journalists to apply conflict sensitivity to their reportage, thereby promoting societal peace, particularly during elections. 相似文献
90.
A numerical approach is presented for determining the waiting time distribution in a transient bulk-arrival, bulk-service queue. Vehicle departures from the queue are governed by a general dispatch strategy that includes holding with a variable release function and vehicle cancellations. The waiting time distribution of a customer (in a group) arriving at a given point in time is calculated by simulating the process in discrete time and determining at each step the probability the customer has left the system. The dispatch strategies require knowing the total length of the queue as well as the position a customer holds in the queue. An exact approach is compared to an accurate approximation which is 50 to 100 times faster. Comparisons are made with other approaches in the context of steady-state systems. 相似文献