全文获取类型
| 收费全文 | 725篇 |
| 免费 | 27篇 |
| 国内免费 | 3篇 |
专业分类
| 755篇 |
出版年
| 2025年 | 6篇 |
| 2024年 | 5篇 |
| 2023年 | 15篇 |
| 2022年 | 9篇 |
| 2021年 | 8篇 |
| 2020年 | 26篇 |
| 2019年 | 18篇 |
| 2018年 | 18篇 |
| 2017年 | 36篇 |
| 2016年 | 35篇 |
| 2015年 | 30篇 |
| 2014年 | 40篇 |
| 2013年 | 33篇 |
| 2012年 | 37篇 |
| 2011年 | 33篇 |
| 2010年 | 36篇 |
| 2009年 | 43篇 |
| 2008年 | 35篇 |
| 2007年 | 30篇 |
| 2006年 | 40篇 |
| 2005年 | 31篇 |
| 2004年 | 30篇 |
| 2003年 | 19篇 |
| 2002年 | 17篇 |
| 2001年 | 19篇 |
| 2000年 | 19篇 |
| 1999年 | 17篇 |
| 1998年 | 11篇 |
| 1997年 | 14篇 |
| 1996年 | 7篇 |
| 1995年 | 6篇 |
| 1994年 | 9篇 |
| 1993年 | 8篇 |
| 1992年 | 7篇 |
| 1991年 | 4篇 |
| 1990年 | 2篇 |
| 1989年 | 2篇 |
排序方式： 共有755条查询结果，搜索用时 0 毫秒
541.
We study a multi‐stage dynamic assignment interdiction (DAI) game in which two agents, a user and an attacker, compete in the underlying bipartite assignment graph. The user wishes to assign a set of tasks at the minimum cost, and the attacker seeks to interdict a subset of arcs to maximize the user's objective. The user assigns exactly one task per stage, and the assignment costs and interdiction impacts vary across stages. Before any stage commences in the game, the attacker can interdict arcs subject to a cardinality constraint. An interdicted arc can still be used by the user, but at an increased assignment cost. The goal is to find an optimal sequence of assignments, coupled with the attacker's optimal interdiction strategy. We prove that this problem is strongly NP‐hard, even when the attacker can interdict only one arc. We propose an exact exponential‐state dynamic‐programming algorithm for this problem as well as lower and upper bounds on the optimal objective function value. Our bounds are based on classical interdiction and robust optimization models, and on variations of the DAI game. We examine the efficiency of our algorithms and the quality of our bounds on a set of randomly generated instances. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 373–387, 2017 相似文献
542.
543.
Models for integrated production and demand planning decisions can serve to improve a producer's ability to effectively match demand requirements with production capabilities. In contexts with price‐sensitive demands, economies of scale in production, and multiple capacity options, such integrated planning problems can quickly become complex. To address these complexities, this paper provides profit‐maximizing production planning models for determining optimal demand and internal production capacity levels under price‐sensitive deterministic demands, with subcontracting and overtime options. The models determine a producer's optimal price, production, inventory, subcontracting, overtime, and internal capacity levels, while accounting for production economies of scale and capacity costs through concave cost functions. We use polyhedral properties and dynamic programming techniques to provide polynomial‐time solution approaches for obtaining an optimal solution for this class of problems when the internal capacity level is time‐invariant. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
544.
提出了一种基于差分GPS技术的舰载雷达动态标校方法,给出了根据大地坐标计算目标真值的算法;设计了一种舰载搜索雷达与跟踪雷达之间同步测量和适用于海上活动平台多传感器之间动态标校的数据处理方法。海上实践表明,这种方法具有精度高、实时性强的特点。 相似文献
545.
联合作战的远程火力战法动态分析方法 总被引：2，自引：0，他引：2
用定量动态分析方法开发远程火力战法是联合作战规划中必须解决的重要问题。借助仿真和博弈分析的混合方法,在对博弈效用函数计算的基础上,构建基于识别真目标、假目标以及火力命中目标概率的二人非零和(TPNZS)非合作博弈模型来开发远程火力战法动态分析方法,对两个典型的联合作战远程火力打击战法性能的初步动态分析表明:战场势态的动态变化直接影响定量规划最优战法的结果。 相似文献
546.
547.
Recent years have seen a strong trend toward outsourcing warranty repair services to outside vendors. In this article we consider the problem of dynamically routing warranty repairs to service vendors when warranties have priority levels. Each time an item under warranty fails, it is sent to one of the vendors for repair. Items covered by higher priority warranty receive higher priority in repair service. The manufacturer pays a fixed fee per repair and incurs a linear holding cost while an item is undergoing or waiting for repair. The objective is to minimize the manufacturer's long‐run average cost. Because of the complexity of the problem, it is very unlikely that there exist tractable ways to find the optimal routing strategies. Therefore, we propose five heuristic routing procedures that are applicable to real‐life problems. We evaluate the heuristics using simulation. The simulation results show that the index‐based “generalized join the shortest queue” policy, which applies a single policy improvement step to an initial state‐independent policy, performs the best among all five heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
548.
Motivated by the flow of products in the iron and steel industry, we study an identical and parallel machine scheduling problem with batch deliveries, where jobs finished on the parallel machines are delivered to customers in batches. Each delivery batch has a capacity and incurs a cost. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost. This problem is an extension of the problem considered by Hall and Potts, Ann Oper Res 135 (2005) 41–64, who studied a two‐machine problem with an unbounded number of transporters and unbounded delivery capacity. We first provide a dynamic programming algorithm to solve a special case with a given job assignment to the machines. A heuristic algorithm is then presented for the general problem, and its worst‐case performance ratio is analyzed. The computational results show that the heuristic algorithm can generate near‐optimal solutions. Finally, we offer a fully polynomial‐time approximation scheme for a fixed number of machines. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 492–502, 2016 相似文献
549.
This article is concerned with the determination of pricing strategies for a firm that in each period of a finite horizon receives replenishment quantities of a single product which it sells in two markets, for example, a long‐distance market and an on‐site market. The key difference between the two markets is that the long‐distance market provides for a one period delay in demand fulfillment. In contrast, on‐site orders must be filled immediately as the customer is at the physical on‐site location. We model the demands in consecutive periods as independent random variables and their distributions depend on the item's price in accordance with two general stochastic demand functions: additive or multiplicative. The firm uses a single pool of inventory to fulfill demands from both markets. We investigate properties of the structure of the dynamic pricing strategy that maximizes the total expected discounted profit over the finite time horizon, under fixed or controlled replenishment conditions. Further, we provide conditions under which one market may be the preferred outlet to sale over the other. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 531–549, 2015 相似文献
550.
英语句型教学的几种操练方法 总被引：1，自引：0，他引：1
廖利华 《兵团教育学院学报》2001,11(1):47-49
教学方法的提出要考虑教学目的和基本教学原则 ,同时也要考虑语言习惯形成的规律和特点。作者认为要熟练掌握一种句型 ,达到运用自如、不假思索的程度 ,必须由浅入深进行机械操练、意义操练和交际操练 相似文献