全文获取类型
收费全文 | 330篇 |
免费 | 117篇 |
国内免费 | 32篇 |
出版年
2024年 | 4篇 |
2023年 | 4篇 |
2022年 | 12篇 |
2021年 | 12篇 |
2020年 | 14篇 |
2019年 | 13篇 |
2018年 | 14篇 |
2017年 | 21篇 |
2016年 | 31篇 |
2015年 | 22篇 |
2014年 | 30篇 |
2013年 | 44篇 |
2012年 | 28篇 |
2011年 | 27篇 |
2010年 | 25篇 |
2009年 | 27篇 |
2008年 | 21篇 |
2007年 | 20篇 |
2006年 | 20篇 |
2005年 | 20篇 |
2004年 | 22篇 |
2003年 | 4篇 |
2002年 | 7篇 |
2001年 | 7篇 |
2000年 | 1篇 |
1999年 | 7篇 |
1998年 | 5篇 |
1997年 | 3篇 |
1996年 | 3篇 |
1994年 | 2篇 |
1992年 | 3篇 |
1990年 | 4篇 |
1989年 | 2篇 |
排序方式: 共有479条查询结果,搜索用时 812 毫秒
121.
122.
We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
123.
针对新一代敏捷卫星对地观测任务规划问题,考虑了直拍直传、立体成像、多条带拼接等复杂任务需求和观测、数据下传、对日定向等九种卫星动作,在任务规划的同时进行卫星动作规划。设计并实现了前瞻启发式构造算法,算法满足卫星存储、能量等复杂约束,在前瞻过程中每次决定当前任务是否安排。采用基于专家知识的多种启发式规则决定任务安排与安排卫星动作序列。仿真实例及实际工程应用表明,算法可以在很短的时间内给出较好的结果,证明了本文方法对于敏捷卫星任务规划问题的适用性。 相似文献
124.
Harold P. Benson 《海军后勤学研究》2006,53(4):309-317
The purpose of this article is to present an algorithm for globally maximizing the ratio of two convex functions f and g over a convex set X. To our knowledge, this is the first algorithm to be proposed for globally solving this problem. The algorithm uses a branch and bound search to guarantee that a global optimal solution is found. While it does not require the functions f and g to be differentiable, it does require that subgradients of g can be calculated efficiently. The main computational effort of the algorithm involves solving a sequence of subproblems that can be solved by convex programming methods. When X is polyhedral, these subproblems can be solved by linear programming procedures. Because of these properties, the algorithm offers a potentially attractive means for globally maximizing ratios of convex functions over convex sets. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
125.
任务规划系统研究综述 总被引:4,自引:0,他引:4
任务规划系统作为举世瞩目的高科技技术,已经引起了广泛的关注和应用.目前世界上一些主要国家都在研制任务规划系统,且进展很快.为了更好地推进我国学者对于任务规划系统的研究,对任务规划系统的研究进行了全面综述.主要内容包括任务规划系统的发展、应用、主要实现方法及未来发展方向.在应用中,综述了任务规划系统在战场态势评估、无人飞行器、机器人领域的应用.在主要实现方法中,主要描述了数学规划、D*优化算法、Agent方法和遗传算法四种方法.最后给出了任务规划系统未来发展方向:现代技术的融合、发展战略级任务规划系统及未来社会任务规划系统预研. 相似文献
126.
In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametric transformation of the objective function serves as an efficient method for calculating global minima of these nonconvex minimization problems if the number of linear fractional terms in the objective function is less than four or five. It will be shown that the Charnes–Cooper transformation plays an essential role in solving these problems. Also a simple bounding technique using linear multiplicative programming techniques has remarkable effects on structured problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 583–596, 1999 相似文献
127.
Zhi-Long Chen 《海军后勤学研究》1998,45(3):279-295
We consider the parallel replacement problem in which machine investment costs exhibit economy of scale which is modeled through associating both fixed and variable costs with machine investment costs. Both finite- and infinite-horizon cases are investigated. Under the three assumptions made in the literature on the problem parameters, we show that the finite-horizon problem with time-varying parameters is equivalent to a shortest path problem and hence can be solved very efficiently, and give a very simple and fast algorithm for the infinite-horizon problem with time-invariant parameters. For the general finite-horizon problem without any assumption on the problem parameters, we formulate it as a zero-one integer program and propose an algorithm for solving it exactly based on Benders' decomposition. Computational results show that this solution algorithm is efficient, i.e., it is capable of solving large scale problems within a reasonable cpu time, and robust, i.e., the number of iterations needed to solve a problem does not increase quickly with the problem size. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 279–295, 1998 相似文献
128.
受社会型生物群体行为启发,群体智能得到日益广泛的关注,机器人集群作为群体智能的重要承载者得到了大量研发和广泛应用.机器人集群路径规划技术作为一项核心关键技术也得到快速发展.为此全面深入地调研了机器人集群路径规划的技术发展现状,创新性地归纳了适用于不同集群规模、可扩展性要求、通信需求以及算法要求的集群规划基础计算架构,包... 相似文献
129.
屯兵设营,规划先行。营区规划是部队发展所面临的重要问题,随着“节约型社会”建设步伐的加快,部队营区规划的节约化也成为一个热门话题。从实证分析的角度,结合笔者多年的相关实践经验,指出了如今营区规划工作中存在的误区,对如何节约营区规划造价进行了探讨,并提出相应途径。从为部队推广可行性强的政策策略为出发点进行论述,容易为广大部队营房干部掌握,对部队营区规划工作具有一定的指导意义。 相似文献
130.