首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   426篇
  免费   217篇
  国内免费   53篇
  2024年   4篇
  2023年   9篇
  2022年   12篇
  2021年   10篇
  2020年   18篇
  2019年   19篇
  2018年   11篇
  2017年   38篇
  2016年   49篇
  2015年   27篇
  2014年   52篇
  2013年   29篇
  2012年   50篇
  2011年   44篇
  2010年   30篇
  2009年   46篇
  2008年   27篇
  2007年   27篇
  2006年   50篇
  2005年   29篇
  2004年   20篇
  2003年   14篇
  2002年   14篇
  2001年   10篇
  2000年   6篇
  1999年   10篇
  1998年   7篇
  1997年   1篇
  1996年   4篇
  1995年   5篇
  1994年   4篇
  1993年   4篇
  1992年   3篇
  1991年   4篇
  1990年   4篇
  1989年   5篇
排序方式: 共有696条查询结果,搜索用时 203 毫秒
691.
Express package carrier networks have large numbers of heavily‐interconnected and tightly‐constrained resources, making the planning process difficult. A decision made in one area of the network can impact virtually any other area as well. Mathematical programming therefore seems like a logical approach to solving such problems, taking into account all of these interactions. The tight time windows and nonlinear cost functions of these systems, however, often make traditional approaches such as multicommodity flow formulations intractable. This is due to both the large number of constraints and the weakness of the linear programming (LP) relaxations arising in these formulations. To overcome these obstacles, we propose a model in which variables represent combinations of loads and their corresponding routings, rather than assigning individual loads to individual arcs in the network. In doing so, we incorporate much of the problem complexity implicitly within the variable definition, rather than explicitly within the constraints. This approach enables us to linearize the cost structure, strengthen the LP relaxation of the formulation, and drastically reduce the number of constraints. In addition, it greatly facilitates the inclusion of other stages of the (typically decomposed) planning process. We show how the use of templates, in place of traditional delayed column generation, allows us to identify promising candidate variables, ensuring high‐quality solutions in reasonable run times while also enabling the inclusion of additional operational considerations that would be difficult if not impossible to capture in a traditional approach. Computational results are presented using data from a major international package carrier. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
692.
693.
The optimization framework for optimal sensor placement for underwater threat detection has been developed. It considers single‐period and multiperiod detection models, each of which includes two components: detection algorithm and optimization problem for sensor placement. The detection algorithms for single‐period and multiperiod models are based on likelihood ratio and sequential testing, respectively. For the both models, the optimization problems use the principle of superadditive coverage, which is closely related to energy‐based and information‐based approaches. An algorithm for quasi‐regular sensor placement approximating solutions to the optimization problems has been developed based on corresponding continuous relaxations and a criterion for its applicability has been obtained. Numerical experiments have demonstrated that the algorithm consistently outperforms existing optimization techniques for optimal sensor placement.© 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
694.
基于约束满足的多目标对地观测卫星成像调度   总被引:1,自引:0,他引:1       下载免费PDF全文
EOS(对地观测卫星)成像调度需要根据用户提出的成像任务需求确定卫星成像序列,是一个复杂的组合优化问题。考虑到成像侧视约束条件,建立EOS成像调度的多目标有向无环约束图模型。在此模型的基础上提出了基于SPEA2(strength pareto evolutionary algorithm 2)的多目标成像调度算法,采用约束控制技术设计遗传算子处理成像约束。经过三个实际的多目标成像调度问题测试,表明该算法可以有效地解决EOS成像调度问题。  相似文献   
695.
在直连式超燃冲压发动机试验系统上,通过调节超燃冲压发动机燃烧室壁面扩张角和燃料喷注位置,对燃烧室构型优化进行了试验研究。为了提高试验效率,燃烧室形面调节采用正交试验设计方法进行组织,每个形面进行5种喷注位置的试验,每次试验通过文氏管调节3个当量比的燃料流量。利用试验数据构造燃烧室性能关于构型参数的响应面模型,可用于燃烧室构型优化。通过两次渐进优化获得了性能更优的燃烧室构型,并根据试验数据分析了各构型参数对燃烧室性能的影响,结果表明:优化构型燃烧室的推力增益比基准构型增大了10.4%;燃烧室性能受各构型参数的强烈耦合影响。  相似文献   
696.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号