全文获取类型
收费全文 | 449篇 |
免费 | 10篇 |
出版年
2020年 | 6篇 |
2019年 | 11篇 |
2018年 | 12篇 |
2017年 | 12篇 |
2016年 | 12篇 |
2015年 | 11篇 |
2013年 | 117篇 |
2011年 | 4篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2007年 | 3篇 |
2006年 | 5篇 |
2005年 | 7篇 |
2004年 | 7篇 |
2003年 | 4篇 |
2001年 | 3篇 |
2000年 | 4篇 |
1999年 | 6篇 |
1998年 | 6篇 |
1997年 | 6篇 |
1996年 | 12篇 |
1995年 | 6篇 |
1994年 | 10篇 |
1993年 | 6篇 |
1992年 | 8篇 |
1991年 | 15篇 |
1990年 | 5篇 |
1989年 | 7篇 |
1988年 | 6篇 |
1987年 | 8篇 |
1986年 | 13篇 |
1985年 | 13篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1975年 | 3篇 |
1974年 | 5篇 |
1973年 | 3篇 |
1972年 | 9篇 |
1971年 | 6篇 |
1970年 | 8篇 |
1969年 | 4篇 |
1968年 | 6篇 |
1967年 | 5篇 |
1966年 | 4篇 |
排序方式: 共有459条查询结果,搜索用时 31 毫秒
121.
A procedure for obtaining a facilities scatter diagram within a rectangular boundary is developed using a multifacility location model. This method gives favorable computational results and has the advantage over other scatter diagram methods of being able to accommodate fixed facility locations. Examples illustrate how this method can be used by a designer/analyst either as a one-step algorithm or iteratively to build a layout. 相似文献
122.
Richard E. Chatwin 《海军后勤学研究》1996,43(5):603-612
Consider a multi-period multi-fare class airline overbooking problem that relates to a single-leg flight. Passengers may cancel their reservations at any time, including being no-shows at flight-time. Canceling passengers receive a refund that depends on their fare class, e.g., supersaver, coach, etc. At flight-time, the airline bumps passengers in excess of flight capacity and pays a penalty for so doing. A continuous state-space dynamic programming model is developed in which the state is the numbers of reservations currently on hand in each fare class. In each period, reservation requests occur in only one fare class and the fraction of reservations canceling in each class is independent of the number of reservations therein. A booking-limit policy is optimal, i.e., in each period the airline accepts reservation requests up to a booking limit if the number of initial reservations in the fare class is less than the booking limit, and declines reservation requests otherwise. The booking limits for each class depend on the numbers of reservations in the other classes. When there are two fare classes the optimal booking limits in each class decrease with the number of reservations in the other class. © 1996 John Wiley & Sons, Inc. 相似文献
123.
This article examines the problem of simultaneously assigning a common due date to a set of independent jobs and scheduling them on identical parallel machines in such a way that the costs associated with the due date and with the earliness or tardiness of the jobs are minimized. We establish that, for certain values of the due-date cost, an optimal schedule for this problem is also optimal for an early/tardy scheduling problem studied by Emmons. We discuss the solution properties for the two problems, and show that both problems are NP-hard even for two machines. We further show that these problems become strongly NP-hard if the number of machines is allowed to be arbitrary. We provide a dynamic programming solution for the problems, the complexity of which indicates that the problems can be solved in pseudopolynomial time as long as the number of machines remains fixed. Finally, we present the results of a limited computational study. © 1994 John Wiley & Sons, Inc. 相似文献
124.
The purpose of this research is to investigate simulation algorithms for nonhomogeneous Poisson processes with proportional intensities. Two algorithmic approaches are studied: inversion and thinning. Motivated by industrial practices, the covariate vector involved in the simulation is permitted to change after every event (or observation). The algorithms are extended to permit the simulation of general nonhomogeneous Poisson processes with possible discontinuities both in baseline intensity and covariate vector. This latter extension can be used to facilitate a wide range of failure situations that can arise with repairable systems. © 1994 John Wiley & Sons, Inc. 相似文献
125.
In this article we address the problem of scheduling a single project network with both precedence and resource constraints through the use of a local search technique. We choose a solution definition which guarantees precedence feasibility, allowing the procedure to focus on overcoming resource infeasibility. We use the 110-problem data set of Patterson to test our procedure. Our results indicate a significant improvement over the best heuristic results reported to date for these problems (Bell and Han [1]). Two major advantages of the local search algorithm are its ability to handle arbitrary objective functions and constraints and its effectiveness over a wide range of problem sizes. We present a problem example with an objective function and resource constraints which include nonlinear and non-continuous components, which are easily considered by the procedure. The results of our algorithm are significantly better than random solutions to the problem. © 1993 John Wiley & Sons, Inc. 相似文献
126.
We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance. 相似文献
127.
The reformulation‐linearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of “product factors” of the discrete variables with problem constraints to form polynomial restrictions, which are subsequently linearized. For special problem forms, the structure of these linearized constraints tends to suggest that certain classes may be more beneficial than others. We examine the usefulness of subsets of constraints for a family of 0–1 quadratic multidimensional knapsack programs and perform extensive computational tests on a classical special case known as the 0–1 quadratic knapsack problem. We consider RLT forms both with and without these inequalities, and their comparisons with linearizations derived from published methods. Interestingly, the computational results depend in part upon the commercial software used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
128.
Ana E. Juncos 《Contemporary Security Policy》2018,39(4):559-574
With the failure of liberal peace strategies in the Global South, resilience has recently become the risk management strategy par excellence in peacebuilding. Since it is not possible to predict when the next crisis will take place, peacebuilders must invest in bottom-up adaptive capacities to cope with external shocks. This article moves away from governmentality accounts of resilience which are overtly deterministic and depoliticizing. Instead, it posits that the uncertainty, ambiguity, and complexity associated with resilience mean that we should expect opportunities for contestation and institutional agency. This argument will be illustrated by drawing upon the European Union’s adoption of the resilience approach in its peacebuilding and security policies. The article argues that while uncertainty, ambiguity, and complexity constitute the ontological conditions that underpin the rise of resilience in peacebuilding, they are also likely to lead to its potential demise. 相似文献
129.
John E. Angus 《海军后勤学研究》1987,34(6):845-851
The confidence coefficient of a two-sided confidence interval for the binomial parameter p is the infimum of the coverage probability of the interval as p ranges between 0 and 1. The confidence coefficients for five different approximate confidence intervals are computed and compared to the confidence coefficient for the two-sided Clopper-Pearson confidence interval. Pratt's approximation method [10] yields virtually the same confidence coefficients as the Clopper-Pearson interval, and is easily computed without resorting to interative methods. 相似文献
130.