全文获取类型
收费全文 | 231篇 |
免费 | 54篇 |
国内免费 | 16篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 7篇 |
2021年 | 2篇 |
2020年 | 4篇 |
2019年 | 3篇 |
2018年 | 6篇 |
2017年 | 15篇 |
2016年 | 17篇 |
2015年 | 6篇 |
2014年 | 18篇 |
2013年 | 25篇 |
2012年 | 22篇 |
2011年 | 22篇 |
2010年 | 16篇 |
2009年 | 26篇 |
2008年 | 22篇 |
2007年 | 20篇 |
2006年 | 12篇 |
2005年 | 11篇 |
2004年 | 8篇 |
2003年 | 4篇 |
2002年 | 6篇 |
2001年 | 8篇 |
2000年 | 4篇 |
1999年 | 3篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1993年 | 3篇 |
1990年 | 1篇 |
排序方式: 共有301条查询结果,搜索用时 15 毫秒
21.
郭文永 《中国人民武装警察部队学院学报》2014,(7):94-96
阐述了边消警文献信息资源保障体系建设的内涵和建设原则,从资源体系建设、服务体系建设、网络平台建设和保障体系建设等四方面对边消警文献信息资源保障体系建设的内容进行了探讨. 相似文献
22.
23.
田小利 《武警工程学院学报》2012,(4):1-3
实现武警工程大学的转型发展,一是要有准确的目标定位,充分认识大学地位作用的独特性、人才培养的层次性、科研与教学的并重性;二是要确立先进的办学思想,突出武警特色,坚持内涵发展,追求忠诚卓越;三是要有科学的建设举措,以深化改革推动转型,以搞好“合训”促进转型,以狠抓管理保证转型。 相似文献
24.
为了更好适应战时弹药需求的不确定性,必须做好对战时应急保障系统的管理工作,应急弹药储备库的选址问题就是应急保障系统的关键环节.首先依据战时弹药需求特点,从库存策略的角度出发,引入安全库存概念;其次,建立了以建设成本和运输总距离为目标函数的战时应急弹药储备库选址模型;最后,运用Matlab对模型进行了仿真,验证了该模型的有效性. 相似文献
25.
26.
Having a robustly designed supply chain network is one of the most effective ways to hedge against network disruptions because contingency plans in the event of a disruption are often significantly limited. In this article, we study the facility reliability problem: how to design a reliable supply chain network in the presence of random facility disruptions with the option of hardening selected facilities. We consider a facility location problem incorporating two types of facilities, one that is unreliable and another that is reliable (which is not subject to disruption, but is more expensive). We formulate this as a mixed integer programming model and develop a Lagrangian Relaxation‐based solution algorithm. We derive structural properties of the problem and show that for some values of the disruption probability, the problem reduces to the classical uncapacitated fixed charge location problem. In addition, we show that the proposed solution algorithm is not only capable of solving large‐scale problems, but is also computationally effective. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
27.
We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
28.
29.
30.