全文获取类型
收费全文 | 867篇 |
免费 | 21篇 |
出版年
2021年 | 13篇 |
2019年 | 28篇 |
2018年 | 22篇 |
2017年 | 20篇 |
2016年 | 21篇 |
2015年 | 19篇 |
2014年 | 14篇 |
2013年 | 190篇 |
2011年 | 8篇 |
2009年 | 12篇 |
2008年 | 11篇 |
2007年 | 9篇 |
2006年 | 10篇 |
2005年 | 19篇 |
2004年 | 17篇 |
2003年 | 12篇 |
2002年 | 9篇 |
2000年 | 9篇 |
1999年 | 8篇 |
1998年 | 11篇 |
1997年 | 18篇 |
1996年 | 16篇 |
1995年 | 9篇 |
1994年 | 19篇 |
1993年 | 7篇 |
1992年 | 11篇 |
1991年 | 26篇 |
1989年 | 15篇 |
1988年 | 12篇 |
1987年 | 23篇 |
1986年 | 15篇 |
1985年 | 19篇 |
1984年 | 11篇 |
1983年 | 10篇 |
1982年 | 10篇 |
1980年 | 11篇 |
1979年 | 14篇 |
1978年 | 10篇 |
1977年 | 14篇 |
1976年 | 12篇 |
1975年 | 8篇 |
1974年 | 13篇 |
1973年 | 15篇 |
1972年 | 15篇 |
1971年 | 11篇 |
1970年 | 14篇 |
1969年 | 11篇 |
1968年 | 9篇 |
1967年 | 10篇 |
1966年 | 7篇 |
排序方式: 共有888条查询结果,搜索用时 15 毫秒
871.
Diagnostic clinics are among healthcare facilities that suffer from long waiting times which can worsen medical outcomes and increase patient no-shows. Reducing waiting times without significant capital investments is a challenging task. We tackle this challenge by proposing a new appointment scheduling policy that does not require significant investments for diagnostic clinics. The clinic in our study serves outpatients, inpatients, and emergency patients. Emergency patients must be seen on arrival, and inpatients must be given next day appointments. Outpatients, however, can be given later appointments. The proposed policy takes advantage of this by allowing the postponement of the acceptance of appointment requests from outpatients. The appointment scheduling process is modeled as a two-stage stochastic programming problem where a portion of the clinic capacity is allocated to inpatients and emergency patients in the first stage. In the second stage, outpatients are scheduled based on their priority classes. After a detailed analysis of the solutions obtained from the two-stage stochastic model, we develop a simple, non-anticipative policy for patient scheduling. We evaluate the performance of this proposed, easy-to-implement policy in a simulation study which shows significant improvements in outpatient indirect waiting times. 相似文献
872.
We study new models of scheduled maintenance management for modular systems, consisting of multiple components with respective cycle limits. The cycle limit of each component specifies the time interval in which this component must be repaired or replaced. The goal is to compute a feasible maintenance schedule that minimizes the cost associated with component maintenance. Applications of these models arise in Air Force aircraft maintenance as well as in other arenas with required preventive maintenance. The typical cost structures that arise in practical settings are submodular, which make the resulting models computationally challenging. We develop two efficient and operationally tenable approximation algorithms. We prove constant factor worst‐case guarantees for both algorithms, and present computational experiments showing that these algorithms perform within a few percent of optimality on operationally relevant instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 472–488, 2014 相似文献
873.
874.
875.
Jonathan M. Powell 《African Security Review》2014,23(4):329-338
This paper investigates civil conflict as a product of the survival strategies of African leaders. Specifically, the paper offers a theory of risk substitution that predicts coup-fearing leaders will undermine the military effectiveness of the state when making an effort to extend their own tenure. While ‘coup-proofing’ practices have often been noted as contributors to political survival, considerably less attention has been paid to the influence of these strategies on other forms of conflict. Utilising data from a number of cross-national datasets, the analyses show that having a higher number of ‘coup-proofing’ counterweights significantly worsens a state's civil conflict prospects. A brief consideration of multiple episodes of conflict further suggests that in addition to coup-proofing undermining the counterinsurgency capacity of the state, some leaders are simply indifferent to – or can even potentially benefit from – the existence of an insurgency. 相似文献
876.
We consider a class of facility location problems with a time dimension, which requires assigning every customer to a supply facility in each of a finite number of periods. Each facility must meet all assigned customer demand in every period at a minimum cost via its production and inventory decisions. We provide exact branch‐and‐price algorithms for this class of problems and several important variants. The corresponding pricing problem takes the form of an interesting class of production planning and order selection problems. This problem class requires selecting a set of orders that maximizes profit, defined as the revenue from selected orders minus production‐planning‐related costs incurred in fulfilling the selected orders. We provide polynomial‐time dynamic programming algorithms for this class of pricing problems, as well as for generalizations thereof. Computational testing indicates the advantage of our branch‐and‐price algorithm over various approaches that use commercial software packages. These tests also highlight the significant cost savings possible from integrating location with production and inventory decisions and demonstrate that the problem is rather insensitive to forecast errors associated with the demand streams. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
877.
We consider a manufacturer (i.e., a capacitated supplier) that produces to stock and has two classes of customers. The primary customer places orders at regular intervals of time for a random quantity, while the secondary customers request a single item at random times. At a predetermined time the manufacturer receives advance demand information regarding the order size of the primary customer. If the manufacturer is not able to fill the primary customer's demand, there is a penalty. On the other hand, serving the secondary customers results in additional profit; however, the manufacturer can refuse to serve the secondary customers in order to reserve inventory for the primary customer. We characterize the manufacturer's optimal production and stock reservation policies that maximize the manufacturer's discounted profit and the average profit per unit time. We show that these policies are threshold‐type policies, and these thresholds are monotone with respect to the primary customer's order size. Using a numerical study we provide insights into how the value of information is affected by the relative demand size of the primary and secondary customers. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
878.
Designing Code Division Multiple Access networks includes determining optimal locations of radio towers and assigning customer markets to the towers. In this paper, we describe a deterministic model for tower location and a stochastic model to optimize revenue given a set of constructed towers. We integrate these models in a stochastic integer programming problem with simple recourse that optimizes the location of towers under demand uncertainty. We develop algorithms using Benders' reformulation, and we provide computational results. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
879.
880.
GORDON JE 《Military review》1949,28(12):27; passim