全文获取类型
收费全文 | 612篇 |
免费 | 178篇 |
国内免费 | 69篇 |
出版年
2024年 | 2篇 |
2023年 | 5篇 |
2022年 | 11篇 |
2021年 | 4篇 |
2020年 | 4篇 |
2019年 | 12篇 |
2018年 | 10篇 |
2017年 | 30篇 |
2016年 | 54篇 |
2015年 | 22篇 |
2014年 | 42篇 |
2013年 | 54篇 |
2012年 | 78篇 |
2011年 | 73篇 |
2010年 | 47篇 |
2009年 | 58篇 |
2008年 | 37篇 |
2007年 | 50篇 |
2006年 | 48篇 |
2005年 | 35篇 |
2004年 | 31篇 |
2003年 | 24篇 |
2002年 | 23篇 |
2001年 | 20篇 |
2000年 | 13篇 |
1999年 | 9篇 |
1998年 | 7篇 |
1997年 | 11篇 |
1996年 | 7篇 |
1995年 | 6篇 |
1994年 | 3篇 |
1993年 | 10篇 |
1992年 | 3篇 |
1991年 | 9篇 |
1990年 | 3篇 |
1989年 | 4篇 |
排序方式: 共有859条查询结果,搜索用时 15 毫秒
71.
72.
73.
74.
75.
76.
波形分集是多输入多输出(MIMO)雷达的主要特征之一,设计性能良好正交波形集是实现MIMO雷达的关键技术。介绍了噪声MIMO雷达的基本原理,分析了利用混沌序列设计正交波形的可行性,提出了基于混沌序列的MIMO雷达正交波形集设计方法,给出了基于两种典型混沌序列设计二相编码正交波形的设计结果,分析了波形集相关性能,计算机仿真表明,该方法在算法效率和波形多样性方面优于传统的遗传算法。 相似文献
77.
78.
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 相似文献
79.
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 相似文献
80.