全文获取类型
收费全文 | 163篇 |
免费 | 8篇 |
国内免费 | 5篇 |
专业分类
管理学 | 98篇 |
丛书文集 | 6篇 |
理论方法论 | 1篇 |
综合类 | 67篇 |
统计学 | 4篇 |
出版年
2024年 | 1篇 |
2022年 | 7篇 |
2021年 | 3篇 |
2019年 | 3篇 |
2018年 | 3篇 |
2017年 | 2篇 |
2016年 | 4篇 |
2015年 | 10篇 |
2014年 | 7篇 |
2013年 | 12篇 |
2012年 | 10篇 |
2011年 | 8篇 |
2010年 | 8篇 |
2009年 | 14篇 |
2008年 | 16篇 |
2007年 | 13篇 |
2006年 | 15篇 |
2005年 | 15篇 |
2004年 | 4篇 |
2003年 | 6篇 |
2002年 | 4篇 |
2001年 | 1篇 |
2000年 | 4篇 |
1998年 | 1篇 |
1997年 | 2篇 |
1992年 | 1篇 |
1991年 | 2篇 |
排序方式: 共有176条查询结果,搜索用时 187 毫秒
91.
提出了一种在多出口链路的校园网环境下,通过整合路由器和防火墙功能,利用基于目的地址的地址转换技术以及基于源地址的策略路由,优化了校园网出口路由策略方案。该方案充分发挥了相关设备的性能,提高了网络访问速度,而且也便于网络管理工作。 相似文献
92.
为了在设备有限的网络技术实验室中,进行网络互联和Internet的实验,本文介绍了网络技术仿真实验的构建和实现,如何用计算机仿真路由路,并阐述了路由的配置方法;如何在网络实验室中仿真Inter- net中的DNS,真正实现基于Internet的理解与开发. 相似文献
93.
管理文化是管理者在一定理念支持下所遵循的价值准则和采取的行为方式,体现管理主体的意志和方略,具有"生态"和"力量"两层含义。从生态学理论分析,构建大学管理文化需要分析文化赖以存在的生态环境、生态结构及生态功能,确立现代大学的生态管理理念,形成生态的组织结构与制度,提高管理质量与运行效率,从而引领大学各行为主体的生态人文精神及价值取向,促进大学内部的和谐和大学文化的生态发展。 相似文献
94.
《随机性模型》2013,29(1):39-60
This paper shows that the aggregation and decomposition result known as Norton's theorem for queueing networks can be extended to a general class of batch routing queueing networks with product-form solution that allows for multiple components to simultaneously release and receive (batches of) customers. 相似文献
95.
In the offshore petroleum industry, employees are transported to and from the offshore installations by helicopter, which represents a major risk. This paper analyzes how to improve transportation safety by solving the helicopter routing problem with a risk objective expressed in terms of expected number of fatalities. A mathematical model is proposed and a tabu search heuristic is applied to this problem. Three routing policies are considered: a direct routing policy, a Hamiltonian routing policy, and a general routing policy. Extensive computational experiments are conducted on instances derived from real data in order to assess and compare these policies under a travel time, a passenger risk and a combined passenger and pilot risk objective. Several management insights can be derived from this study. In particular, our results show that passenger transportation risk can be reduced by increasing travel time at the expense of pilot risk. This can be achieved through a reduction of the average number of passengers onboard by applying either a Hamiltonian or a general routing policy. Our methodology can also be used to derive an equitable distribution of risk between passengers and pilots, considering that pilots fly much more frequently than passengers. 相似文献
96.
97.
直接配送策略下随机需求库存-路径问题(Stochastic Demand Inventory Routing Problem with Direct Deliveries, SDIRPDD)由于其需求的不确定性、决策的长期性以及其最优策略形式对求解其他库存-路径问题(IRP)的参考价值,使得对SDIPRDD问题的研究成为物流、供应链优化领域研究的一个热点。文章首先证明了无约束SDIRPDD的最优平稳策略为(s,S)形式,并通过分析车辆数约束对客户单阶段期望成本函数的影响,给出了存在车辆数和客户库存容量约束时SDIRPDD问题的最优平稳策略形式,进而提出了一种求解有约束SDIRPDD问题最优平稳策略的近似算法。最后,通过数值算例验证了算法的有效性并分析了结果的现实意义。 相似文献
98.
This paper presents a two-phased train-set routing algorithm to cover a weekly train timetable with minimal working days of a minimal number of train-sets. First, relax maintenance requirements and obtain minimum cost routes by solving the polynomial relaxation. Then, maintenance-feasible routes are generated from the crossovers of the minimum cost routes. This pragmatic approach seems particularly effective for the high-speed railway systems, where the railway topology is relatively simple with few end stations while the trains are frequent. Applied to the current weekly timetable of the Korea high-speed railway, we could find an optimal feasible routing, which is an 8.8% improvement over the current routing generated by a set partitioning approach based on a path generation scheme. 相似文献
99.
Saman Eskandarzadeh Reza Tavakkoli-Moghaddam Amir Azaron 《Journal of Combinatorial Optimization》2009,17(2):214-234
In this paper, we propose an exact method for solving a special integer program associated with the classical capacitated
arc routing problems (CARPs) called split demand arc routing problems (SDARP). This method is developed in the context of
monotropic programming theory and bases a promising foundation for developing specialized algorithms in order to solve general
integer programming problems. In particular, the proposed algorithm generalizes the relaxation algorithm developed by Tseng
and Bertsekas (Math. Oper. Res. 12(4):569–596, 1987) for solving linear programming problems. This method can also be viewed as an alternative for the subgradient method for
solving Lagrangian relaxed problems. Computational experiments show its high potential in terms of efficiency and goodness
of solutions on standard test problems. 相似文献
100.
基于动态扫描和蚂蚁算法的物流配送网络优化研究 总被引:4,自引:0,他引:4
本文在对动态扫描和蚂蚁算法研究的基础上,针对蚂蚁算法在求解大规模物流配送问题中存在的不足,利用动态扫描方法在区域选择方面的实用性和蚂蚁算法在局部优化方面的优点,提出综合两种方法的混合算法,并进行了实验计算.计算结果表明,混合算法获得了较满意的效果. 相似文献