全文获取类型
收费全文 | 544篇 |
免费 | 102篇 |
国内免费 | 15篇 |
出版年
2023年 | 2篇 |
2022年 | 3篇 |
2021年 | 4篇 |
2020年 | 8篇 |
2019年 | 6篇 |
2018年 | 1篇 |
2017年 | 16篇 |
2016年 | 20篇 |
2015年 | 20篇 |
2014年 | 37篇 |
2013年 | 37篇 |
2012年 | 28篇 |
2011年 | 37篇 |
2010年 | 57篇 |
2009年 | 57篇 |
2008年 | 41篇 |
2007年 | 23篇 |
2006年 | 30篇 |
2005年 | 23篇 |
2004年 | 39篇 |
2003年 | 21篇 |
2002年 | 9篇 |
2001年 | 15篇 |
2000年 | 14篇 |
1999年 | 13篇 |
1998年 | 22篇 |
1997年 | 17篇 |
1996年 | 14篇 |
1995年 | 8篇 |
1994年 | 9篇 |
1993年 | 6篇 |
1992年 | 4篇 |
1991年 | 7篇 |
1990年 | 10篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有661条查询结果,搜索用时 15 毫秒
51.
52.
深化以任职教育为主体的教学方法改革,是顺应当前武警部队职能任务多样化的必然要求。任职教育适应岗位任职能力的需要必须注重加强军事专业课教学方法的改革与探索。“贴近纳新”把贴近职能需要纳入教学理念、贴近任职实际纳入组教模式、贴近岗位实用纳入课题施教为着眼点,旨在适应任职教育岗位任职能力培养的需要。 相似文献
53.
Yoshinori Suzuki 《海军后勤学研究》2008,55(8):737-746
Fuel optimizers are decision models (software products) that are increasingly recognized as effective fuel management tools by U.S. truckload carriers. Using the latest price data of every truck stop, these models calculate the optimal fueling schedule for each route that indicates: (i) which truck stop(s) to use, and (ii) how much fuel to buy at the chosen truck stop(s) to minimize the refueling cost. In the current form, however, these models minimize only the fuel cost, and ignore or underestimate other costs that are affected by the models' decision variables. On the basis of the interviews with carrier managers, truck drivers, and fuel‐optimizer vendors, this article proposes a comprehensive model of motor‐carrier fuel optimization that considers all of the costs that are affected by the model's decision variables. Simulation results imply that the proposed model not only attains lower vehicle operating costs than the commercial fuel optimizers, but also gives solutions that are more desirable from the drivers' viewpoint. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
54.
55.
Martijn van Ee 《海军后勤学研究》2020,67(2):147-158
We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability pi: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete. 相似文献
56.
In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017 相似文献
57.
The nucleolus solution for cooperative games in characteristic function form is usually computed numerically by solving a sequence of linear programing (LP) problems, or by solving a single, but very large‐scale, LP problem. This article proposes an algebraic method to compute the nucleolus solution analytically (i.e., in closed‐form) for a three‐player cooperative game in characteristic function form. We first consider cooperative games with empty core and derive a formula to compute the nucleolus solution. Next, we examine cooperative games with nonempty core and calculate the nucleolus solution analytically for five possible cases arising from the relationship among the value functions of different coalitions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
58.
The “gold‐mining” decision problem is concerned with the efficient utilization of a delicate mining equipment working in a number of different mines. Richard Bellman was the first to consider this type of a problem. The solution found by Bellman for the finite‐horizon, continuous‐time version of the problem with two mines is not overly realistic since he assumed that fractional parts of the same mining equipment could be used in different mines and this fraction could change instantaneously. In this paper, we provide some extensions to this model in order to produce more operational and realistic solutions. Our first model is concerned with developing an operational policy where the equipment may be switched from one mine to the other at most once during a finite horizon. In the next extension we incorporate a cost component in the objective function and assume that the horizon length is not fixed but it is the second decision variable. Structural properties of the optimal solutions are obtained using nonlinear programming. Each model and its solution is illustrated with a numerical example. The models developed here may have potential applications in other areas including production of items requiring the same machine or choosing a sequence of activities requiring the same resource. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 186–203, 2002; DOI 10.1002/nav.10008 相似文献
59.
唐国忠 《中国人民武装警察部队学院学报》2008,24(4):36-38
对外墙保温体系的分类和火灾危险性进行了阐述,并且结合国外的有关经验提出外墙保温体系的防火设计方案。 相似文献
60.
We study a periodic-review assemble-to-order (ATO) system with multiple components and multiple products, in which the inventory replenishment for each component follows an independent base-stock policy and stochastic product demands are satisfied according to a First-Come-First-Served rule. We assume that the replenishment for various component suffers from lead time uncertainty. However, the decision maker has the so-called advance supply information (ASI) associated with the lead times and thus can take advantage of the information for system optimization. We propose a multistage stochastic integer program that incorporates ASI to address the joint optimization of inventory replenishment and component allocation. The optimal base-stock policy for the inventory replenishment is determined using the sample average approximation algorithm. Also, we provide a modified order-based component allocation (MOBCA) heuristic for the component allocation. We additionally consider a special case of the variable lead times where the resulting two-stage stochastic programming model can be characterized as a single-scenario case of the proposed multistage model. We carry out extensive computational studies to quantify the benefits of integrating ASI into joint optimization and to explore the possibility of employing the two-stage model as a relatively efficient approximation scheme for the multistage model. 相似文献