全文获取类型
| 收费全文 | 559篇 |
| 免费 | 10篇 |
| 国内免费 | 8篇 |
专业分类
| 577篇 |
出版年
| 2025年 | 2篇 |
| 2024年 | 2篇 |
| 2023年 | 17篇 |
| 2022年 | 9篇 |
| 2021年 | 7篇 |
| 2020年 | 14篇 |
| 2019年 | 8篇 |
| 2018年 | 10篇 |
| 2017年 | 26篇 |
| 2016年 | 34篇 |
| 2015年 | 17篇 |
| 2014年 | 34篇 |
| 2013年 | 29篇 |
| 2012年 | 32篇 |
| 2011年 | 28篇 |
| 2010年 | 23篇 |
| 2009年 | 42篇 |
| 2008年 | 26篇 |
| 2007年 | 35篇 |
| 2006年 | 33篇 |
| 2005年 | 32篇 |
| 2004年 | 26篇 |
| 2003年 | 10篇 |
| 2002年 | 9篇 |
| 2001年 | 12篇 |
| 2000年 | 9篇 |
| 1999年 | 8篇 |
| 1998年 | 6篇 |
| 1997年 | 6篇 |
| 1996年 | 4篇 |
| 1995年 | 6篇 |
| 1994年 | 3篇 |
| 1993年 | 3篇 |
| 1992年 | 6篇 |
| 1991年 | 4篇 |
| 1990年 | 3篇 |
| 1989年 | 2篇 |
排序方式： 共有577条查询结果，搜索用时 15 毫秒
131.
132.
基于区间数TOPSIS法优选空军战役作战计划 总被引：1，自引：0，他引：1
针对战役作战计划优选中的不确定性,运用区间分析和TOPSIS(Technique for Order Preference by Similarity to Ideal Solution)法探索空军战役作战计划优选问题.通过引进区间数乘法运算,将区间数多指标决策问题转变为指标为区间数的多指标决策问题,进而给出区间数多指标决策问题的TOPSIS法,对空军战役作战计划进行排序选优.与传统方法相比较,该方法较好地解决了评价指标为不确定值时的多指标决策问题. 相似文献
133.
134.
In this article, we introduce the capacitated warehouse location model with risk pooling (CLMRP), which captures the interdependence between capacity issues and the inventory management at the warehouses. The CLMRP models a logistics system in which a single plant ships one type of product to a set of retailers, each with an uncertain demand. Warehouses serve as the direct intermediary between the plant and the retailers for the shipment of the product and also retain safety stock to provide appropriate service levels to the retailers. The CLMRP minimizes the sum of the fixed facility location, transportation, and inventory carrying costs. The model simultaneously determines warehouse locations, shipment sizes from the plant to the warehouses, the working inventory, and safety stock levels at the warehouses and the assignment of retailers to the warehouses. The costs at each warehouse exhibit initially economies of scale and then an exponential increase due to the capacity limitations. We show that this problem can be formulated as a nonlinear integer program in which the objective function is neither concave nor convex. A Lagrangian relaxation solution algorithm is proposed. The Lagrangian subproblem is also a nonlinear integer program. An efficient algorithm is developed for the linear relaxation of this subproblem. The Lagrangian relaxation algorithm provides near‐optimal solutions with reasonable computational requirements for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
135.
Ryusuke Hohzaki 《海军后勤学研究》2009,56(3):264-278
Search theory originates from the military research efforts of WWII. Most researchers of that period modeled their search games in noncooperative games, where players are enemies or compete against each other. In this article, we deal with a cooperative search game, where multiple searchers behave cooperatively. First we describe several search problems and discuss the possibility of a coalition or cooperation among searchers. For the cooperative search game, we define a function named quasi‐characteristic function, which gives us a criterion similar to the so‐called characteristic function in the general coalition game with transferable utility. The search operation includes a kind of randomness with respect to whether the searchers can detect a target and get the value of the target. We also propose a methodology to divide the obtained target value among members of the coalition taking account of the randomness. As a concrete problem of the cooperative search game, we take the so‐called search allocation game, where searchers distribute their searching resources to detect a target in a cooperative way and the target moves in a search space to evade the searchers. Lastly, we discuss the core of the cooperative search allocation game. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
136.
We consider the decision‐making problem of dynamically scheduling the production of a single make‐to stock (MTS) product in connection with the product's concurrent sales in a spot market and a long‐term supply channel. The spot market is run by a business to business (B2B) online exchange, whereas the long‐term channel is established by a structured contract. The product's price in the spot market is exogenous, evolves as a continuous time Markov chain, and affects demand, which arrives sequentially as a Markov‐modulated Poisson process (MMPP). The manufacturer is obliged to fulfill demand in the long‐term channel, but is able to rein in sales in the spot market. This is a significant strategic decision for a manufacturer in entering a favorable contract. The profitability of the contract must be evaluated by optimal performance. The current problem, therefore, arises as a prerequisite to exploring contracting strategies. We reveal that the optimal strategy of coordinating production and sales is structured by the spot price dependent on the base stock and sell‐down thresholds. Moreover, we can exploit the structural properties of the optimal strategy to conceive an efficient algorithm. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
137.
We consider the optimal control of a production inventory‐system with a single product and two customer classes where items are produced one unit at a time. Upon arrival, customer orders can be fulfilled from existing inventory, if there is any, backordered, or rejected. The two classes are differentiated by their backorder and lost sales costs. At each decision epoch, we must determine whether or not to produce an item and if so, whether to use this item to increase inventory or to reduce backlog. At each decision epoch, we must also determine whether or not to satisfy demand from a particular class (should one arise), backorder it, or reject it. In doing so, we must balance inventory holding costs against the costs of backordering and lost sales. We formulate the problem as a Markov decision process and use it to characterize the structure of the optimal policy. We show that the optimal policy can be described by three state‐dependent thresholds: a production base‐stock level and two order‐admission levels, one for each class. The production base‐stock level determines when production takes place and how to allocate items that are produced. This base‐stock level also determines when orders from the class with the lower shortage costs (Class 2) are backordered and not fulfilled from inventory. The order‐admission levels determine when orders should be rejected. We show that the threshold levels are monotonic (either nonincreasing or nondecreasing) in the backorder level of Class 2. We also characterize analytically the sensitivity of these thresholds to the various cost parameters. Using numerical results, we compare the performance of the optimal policy against several heuristics and show that those that do not allow for the possibility of both backordering and rejecting orders can perform poorly.© 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010 相似文献
138.
目前,不协调决策表的分布约简、最大分布约简和分配约简算法复杂度较高,不适合处理大数据集。在分析已有算法基础上,分析了基于相对可区分度的属性重要性度量的性质,解决了正域度量属性重要性的缺陷。针对不协调决策表,给出了多种简化协调决策表的定义,从而大大缩减了约简的实例数。以相对可区分度为启发函数构造了一种高效完备的不协调决策表约简算法。理论分析和实验结果表明,该约简算法解决了现有算法在复杂度和属性重要性度量上的缺陷,适合处理不协调的大数据集。 相似文献
139.
针对高动态环境下驾驶辅助系统（ADAS）的轨迹规划问题,提出基于车辆稳态动力学特性的动态轨迹规划算法。该算法首先在交通车轨迹预估基础上建立搜索空间,接着利用车辆稳态动力学模型作为轨迹发生器,在搜索空间中对轨迹发生器产生的轨迹进行评价,最后根据驾驶意图和优化条件选择最优轨迹。文章采用基于最优加速度预瞄理论的轨迹跟踪算法,建立了七自由度车辆动力学模型,并在Simulink环境下搭建仿真平台,进行超车仿真实验。实验结果表明,本文提出的算法可行、有效。 相似文献
140.
维修资源是实施装备维修工作的物质基础和重要保证,无论是平时训练还是战时抢修,维修资源都占据着十分重要的地位,不仅影响着装备的寿命周期费用(Life Cycle Costs,LCC),还直接影响着装备的战备完好率以及部队战斗力的保持和恢复。应用更加科学高效的方法确定保障资源,是维修决策面临的重要问题之一。据此,着眼于部队装备维修保障现状需求,将维修任务分配与保障资源需求紧密结合,提出了保障资源确定分析流程,并对分析过程中的关键技术进行了相应的研究,建立了典型的维修决策模型,优化了保障资源配置。最后开发了计算机辅助决策分析系统,为维修资源的优化配置起到了很好的辅助决策作用。 相似文献