全文获取类型
收费全文 | 80篇 |
免费 | 46篇 |
国内免费 | 1篇 |
出版年
2022年 | 1篇 |
2021年 | 2篇 |
2020年 | 8篇 |
2019年 | 5篇 |
2018年 | 3篇 |
2017年 | 1篇 |
2016年 | 7篇 |
2015年 | 2篇 |
2014年 | 5篇 |
2013年 | 3篇 |
2012年 | 4篇 |
2011年 | 11篇 |
2010年 | 7篇 |
2009年 | 2篇 |
2008年 | 7篇 |
2007年 | 6篇 |
2006年 | 8篇 |
2005年 | 6篇 |
2004年 | 8篇 |
2003年 | 2篇 |
2002年 | 4篇 |
2001年 | 3篇 |
2000年 | 2篇 |
1999年 | 2篇 |
1998年 | 7篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 4篇 |
1993年 | 2篇 |
1990年 | 1篇 |
排序方式: 共有127条查询结果,搜索用时 15 毫秒
101.
Mustapha Bouhtou Alexander Grigoriev Stan van Hoesel Anton F. van der Kraaij Frits C.R. Spieksma Marc Uetz 《海军后勤学研究》2007,54(4):411-420
We consider a pricing problem in directed, uncapacitated networks. Tariffs must be defined by an operator, the leader, for a subset of m arcs, the tariff arcs. Costs of all other arcs in the network are assumed to be given. There are n clients, the followers, and after the tariffs have been determined, the clients route their demands independent of each other on paths with minimal total cost. The problem is to find tariffs that maximize the operator's revenue. Motivated by applications in telecommunication networks, we consider a restricted version of this problem, assuming that each client utilizes at most one of the operator's tariff arcs. The problem is equivalent to pricing bridges that clients can use in order to cross a river. We prove that this problem is APX‐hard. Moreover, we analyze the effect of uniform pricing, proving that it yields both an m approximation and a (1 + lnD)‐approximation. Here, D is upper bounded by the total demand of all clients. In addition, we consider the problem under the additional restriction that the operator must not reject any of the clients. We prove that this problem does not admit approximation algorithms with any reasonable performance guarantee, unless P = NP, and we prove the existence of an n‐approximation algorithm. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
102.
We study new models of scheduled maintenance management for modular systems, consisting of multiple components with respective cycle limits. The cycle limit of each component specifies the time interval in which this component must be repaired or replaced. The goal is to compute a feasible maintenance schedule that minimizes the cost associated with component maintenance. Applications of these models arise in Air Force aircraft maintenance as well as in other arenas with required preventive maintenance. The typical cost structures that arise in practical settings are submodular, which make the resulting models computationally challenging. We develop two efficient and operationally tenable approximation algorithms. We prove constant factor worst‐case guarantees for both algorithms, and present computational experiments showing that these algorithms perform within a few percent of optimality on operationally relevant instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 472–488, 2014 相似文献
103.
This article introduces the twin robots scheduling problem (TRSP), in which two robots positioned at the opposite ends of a rail are required to deliver items to positions along the rail, and the objective is to minimize the makespan. A proof of ‐hardness of the TRSP is presented, along with exact and heuristic algorithms. Computational results on challenging instances are provided.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 119–130, 2014 相似文献
104.
针对优化中收敛速度和优化解全局性的问题,提出了一种联合优化方法:构造原问题的近似模型,使用全局优化方法对近似函数进行优化,得到优化点作为初值,再使用局部优化方法对原问题进行优化.为了获得对原问题更好的近似,改进了径向基插值方法,以优化误差的方法来选择参数.利用临近空间机翼模型的优化对算法进行了测试,结果表明,优化参数的... 相似文献
105.
Accelerated degradation testing (ADT) is usually conducted under deterministic stresses such as constant‐stress, step‐stress, and cyclic‐stress. Based on ADT data, an ADT model is developed to predict reliability under normal (field) operating conditions. In engineering applications, the “standard” approach for reliability prediction assumes that the normal operating conditions are deterministic or simply uses the mean values of the stresses while ignoring their variability. Such an approach may lead to significant prediction errors. In this paper, we extend an ADT model obtained from constant‐stress ADT experiments to predict field reliability by considering the stress variations. A case study is provided to demonstrate the proposed statistical inference procedure. The accuracy of the procedure is verified by simulation using various distributions of field stresses. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006. 相似文献
106.
对计算等离子体的光辐射不透明度所涉及到的一些物理问题进行了介绍与讨论 ,重点放在束缚 -束缚谱线跃迁与束缚 -自由吸收及自电离共振引起的谱线展宽等物理过程。由于束缚 -束缚谱线吸收中涉及到谱线的各种增宽机制 ,我们对此也进行了讨论。在此基础上系统介绍了使用细致谱项模型计算等离子体的不透明度的理论研究现状 ,并结合涉及到的实验研究结果 ,对理论结果进行了检验。特别是结合我们最近的研究进展 ,着重讨论了得到的一系列结果 相似文献
107.
王正明 《国防科技大学学报》1994,16(3):122-127
通过对正交多项式的构造和逼近准则的研究,得到了一类数据处理问题的一种较理想的逼近准则和算法。理论分析和模拟计算表明,用本文方法处理这类问题有较高的拟合精度并容易计算。 相似文献
108.
一类高次多项式系统极限环讨论及其应用 总被引:2,自引:0,他引:2
封汉颍 《军械工程学院学报》1994,(3)
本文讨论了一类高次多项式系统极限环的存在唯一性,分析了系统的分枝,解决了系统的极限环的个数和分布问题,应用所得的结果,推广并改进了前人的结果。 相似文献
109.
本文讨论了矩阵A满足f(A)=0时一次矩阵多项式aB+bI可逆的条件,并给出了来(aA+bI)-1的一般方法。 相似文献
110.
This paper addresses a two‐machine open shop scheduling problem, in which the machines are not continuously available for processing. The processing of an operation affected by a non‐availability interval can be interrupted and resumed later. The objective is to minimize the makespan. We present two polynomial‐time approximation schemes, one of which handles the problem with one non‐availability interval on each machine and the other for the problem with several non‐availability intervals on one of the machines. Problems with a more general structure of the non‐availability intervals are not approximable in polynomial time within a constant factor, unless . © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献