全文获取类型
收费全文 | 542篇 |
免费 | 224篇 |
国内免费 | 11篇 |
出版年
2023年 | 5篇 |
2022年 | 12篇 |
2021年 | 30篇 |
2020年 | 8篇 |
2019年 | 17篇 |
2018年 | 9篇 |
2017年 | 5篇 |
2016年 | 12篇 |
2015年 | 22篇 |
2014年 | 17篇 |
2013年 | 31篇 |
2012年 | 19篇 |
2011年 | 15篇 |
2010年 | 22篇 |
2009年 | 29篇 |
2008年 | 21篇 |
2007年 | 37篇 |
2006年 | 15篇 |
2005年 | 30篇 |
2004年 | 7篇 |
2003年 | 4篇 |
2002年 | 6篇 |
2001年 | 10篇 |
2000年 | 23篇 |
1999年 | 47篇 |
1998年 | 50篇 |
1997年 | 39篇 |
1996年 | 40篇 |
1995年 | 30篇 |
1994年 | 32篇 |
1993年 | 26篇 |
1992年 | 18篇 |
1991年 | 24篇 |
1990年 | 24篇 |
1989年 | 11篇 |
1988年 | 5篇 |
1987年 | 7篇 |
1986年 | 8篇 |
1985年 | 5篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1977年 | 1篇 |
排序方式: 共有777条查询结果,搜索用时 328 毫秒
81.
陈向东 《军队政工理论研究》2009,10(3)
中央军委颁发实施的<党代表任期制实施办法(试行)>,具有很强的思想性、规范性和可操作性,是推进军队党内民主建设的重大举措.要充分认清重大意义,提高贯彻落实<党代表任期制实施办法>的自觉性;准确把握内容实质,增强贯彻落实的针对性;建立健全保障措施,确保贯彻落实的实效性. 相似文献
82.
在武器装备采办中对竞争与单一来源的选择应分析竞争的可行性与合意性。引入竞争必须要满足一些基本的必要条件,只有这样才会使竞争具有可行性。引入竞争还要分析竞争的合意性,即竞争是否值得,而这种合意与否的判断是建立在竞争的成本一收益分析基础之上的。只有同时满足“竞争可行”与“竞争合意”两个条件,武器装备采办才适宜引入竞争,否则应保持单一来源。 相似文献
83.
84.
日本06式枪榴弹采用新型材料,大幅降低了弹的质量和体积,提高了杀伤效能;采取分离一飞行方式,大大减小了后坐能量,增大了射程;运用弹头捕阱系统,减少了烟尘、碎屑等污染物,保证枪榴弹实弹发射时的安全。其设计思想和战术性能在步兵轻武器领域达到世界领先水平。 相似文献
85.
We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
86.
87.
88.
Many manufacturers sell their products through retailers and share the revenue with those retailers. Given this phenomenon, we build a stylized model to investigate the role of revenue sharing schemes in supply chain coordination and product variety decisions. In our model, a monopolistic manufacturer serves two segments of consumers, which are distinguished by their willingness to pay for quality. In the scenario with exogenous revenue sharing ratios, when the potential gain from serving the low segment is substantial (e.g., the low‐segment consumers' willingness to pay is high enough or the low segment takes a large enough proportion of the market), the retailer is better off abandoning the revenue sharing scheme. Moreover, when the potential gain from serving the low (high) segment is substantial enough, the manufacturer finds it profitable to offer a single product. Furthermore, when revenue sharing ratios are endogenous, we divide our analysis into two cases, depending on the methods of cooperation. When revenue sharing ratios are negotiated at the very beginning, the decentralized supply chain causes further distortion. This suggests that the central premise of revenue sharing—the coordination of supply chains—may be undermined if supply chain parties meticulously bargain over it. 相似文献
89.
We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable. 相似文献
90.
In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献