全文获取类型
收费全文 | 452篇 |
免费 | 175篇 |
国内免费 | 30篇 |
出版年
2024年 | 4篇 |
2023年 | 5篇 |
2022年 | 17篇 |
2021年 | 17篇 |
2020年 | 8篇 |
2019年 | 8篇 |
2018年 | 7篇 |
2017年 | 42篇 |
2016年 | 45篇 |
2015年 | 28篇 |
2014年 | 35篇 |
2013年 | 43篇 |
2012年 | 49篇 |
2011年 | 37篇 |
2010年 | 37篇 |
2009年 | 29篇 |
2008年 | 24篇 |
2007年 | 30篇 |
2006年 | 28篇 |
2005年 | 27篇 |
2004年 | 23篇 |
2003年 | 17篇 |
2002年 | 7篇 |
2001年 | 8篇 |
2000年 | 13篇 |
1999年 | 11篇 |
1998年 | 17篇 |
1997年 | 12篇 |
1996年 | 7篇 |
1995年 | 7篇 |
1994年 | 4篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 4篇 |
排序方式: 共有657条查询结果,搜索用时 15 毫秒
51.
52.
53.
54.
This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
55.
应用蚁群算法(ACA)解决车辆巡回保障问题,建立了车辆巡回保障优化数学模型,对轨迹更新规则进行了重新设定,给出了算法的实现步骤。通过算例分析,将计算结果与遗传算法(GA)和粒子群算法(PSO)作了比较,对模型和算法的正确性、高效性和适用性进行了验证。实验结果表明,该算法可以快速、有效求得车辆巡回保障的优化解,得到车辆巡回保障过程中的较优方案。 相似文献
56.
57.
58.
59.
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 相似文献
60.