全文获取类型
收费全文 | 677篇 |
免费 | 61篇 |
国内免费 | 8篇 |
专业分类
化学 | 35篇 |
力学 | 42篇 |
综合类 | 5篇 |
数学 | 331篇 |
物理学 | 131篇 |
无线电 | 202篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 8篇 |
2021年 | 11篇 |
2020年 | 14篇 |
2019年 | 15篇 |
2018年 | 12篇 |
2017年 | 19篇 |
2016年 | 29篇 |
2015年 | 23篇 |
2014年 | 49篇 |
2013年 | 30篇 |
2012年 | 38篇 |
2011年 | 33篇 |
2010年 | 32篇 |
2009年 | 56篇 |
2008年 | 30篇 |
2007年 | 46篇 |
2006年 | 31篇 |
2005年 | 37篇 |
2004年 | 21篇 |
2003年 | 20篇 |
2002年 | 24篇 |
2001年 | 22篇 |
2000年 | 20篇 |
1999年 | 15篇 |
1998年 | 15篇 |
1997年 | 11篇 |
1996年 | 5篇 |
1995年 | 11篇 |
1994年 | 10篇 |
1993年 | 5篇 |
1992年 | 6篇 |
1991年 | 7篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 4篇 |
1987年 | 7篇 |
1986年 | 3篇 |
1985年 | 5篇 |
1984年 | 3篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 3篇 |
排序方式: 共有746条查询结果,搜索用时 0 毫秒
41.
This paper deals with a class of multiple objective linear programs (MOLP) called lexicographic multiple objective linear programs (LMOLP). In this paper, by providing an efficient algorithm which employs the preceding computations as well, it is shown how we can solve the LMOLP problem if the priority of the objective functions is changed. In fact, the proposed algorithm is a kind of sensitivity analysis on the priority of the objective functions in the LMOLP problems. 相似文献
42.
园区综合能源系统(Park integrated energy system,PIES)是满足用户多种用能需求的一种重要途径,但由于内部分布式能源机组出力具有不确定性,且与负荷在时间维度上存在一定的不匹配性,限制了能源利用效率和经济效益的提升.因此,本文首先在构建耦合热电的PIES的基础上,构建了多类型需求响应模型;其... 相似文献
43.
A multi-objective lead time control problem in multi-stage assembly systems using genetic algorithms
Cahit Perkgoz Amir Azaron Hideki Katagiri Kosuke Kato Masatoshi Sakawa 《European Journal of Operational Research》2007
In this paper, we develop a multi-objective model to optimally control the lead time of a multi-stage assembly system, using genetic algorithms. The multi-stage assembly system is modelled as an open queueing network. It is assumed that the product order arrives according to a Poisson process. In each service station, there is either one or infinite number of servers (machines) with exponentially distributed processing time, in which the service rate (capacity) is controllable. The optimal service control is decided at the beginning of the time horizon. The transport times between the service stations are independent random variables with generalized Erlang distributions. The problem is formulated as a multi-objective optimal control problem that involves four conflicting objective functions. The objective functions are the total operating costs of the system per period (to be minimized), the average lead time (min), the variance of the lead time (min) and the probability that the manufacturing lead time does not exceed a certain threshold (max). Finally, we apply a genetic algorithm with double strings using continuous relaxation based on reference solution updating (GADSCRRSU) to solve this multi-objective problem, using goal attainment formulation. The results are also compared against the results of a discrete-time approximation technique to show the efficiency of the proposed genetic algorithm approach. 相似文献
44.
Multi-objective optimization using evolutionary algorithms identifies Pareto-optimal alternatives or their close approximation by means of a sequence of successive local improvement moves. While several successful applications to combinatorial optimization problems are known, studies of underlying problem structures are still scarce. 相似文献
45.
Amir Azaron Reza Tavakkoli-Moghaddam 《European Journal of Operational Research》2007,180(3):1186-1200
We develop a multi-objective model for the time–cost trade-off problem in a dynamic PERT network using an interactive approach. The activity durations are exponentially distributed random variables and the new projects are generated according to a renewal process and share the same facilities. Thus, these projects cannot be analyzed independently. This dynamic PERT network is represented as a network of queues, where the service times represent the durations of the corresponding activities and the arrival stream to each node follows a renewal process. At the first stage, we transform the dynamic PERT network into a proper stochastic network and then compute the project completion time distribution by constructing a continuous-time Markov chain. At the second stage, the time–cost trade-off problem is formulated as a multi-objective optimal control problem that involves four conflicting objective functions. Then, the STEM method is used to solve a discrete-time approximation of the original problem. Finally, the proposed methodology is extended to the generalized Erlang activity durations. 相似文献
46.
Rui Shen Zhiqing Meng Chuangyin Dang Min Jiang 《Numerical Functional Analysis & Optimization》2017,38(11):1473-1489
In this paper, an algorithm of barrier objective penalty function for inequality constrained optimization is studied and a conception–the stability of barrier objective penalty function is presented. It is proved that an approximate optimal solution may be obtained by solving a barrier objective penalty function for inequality constrained optimization problem when the barrier objective penalty function is stable. Under some conditions, the stability of barrier objective penalty function is proved for convex programming. Specially, the logarithmic barrier function of convex programming is stable. Based on the barrier objective penalty function, an algorithm is developed for finding an approximate optimal solution to an inequality constrained optimization problem and its convergence is also proved under some conditions. Finally, numerical experiments show that the barrier objective penalty function algorithm has better convergence than the classical barrier function algorithm. 相似文献
47.
Global Optimality Conditions in Maximizing a Convex Quadratic Function under Convex Quadratic Constraints 总被引:2,自引:0,他引:2
Jean-Baptiste Hiriart-Urruty 《Journal of Global Optimization》2001,21(4):443-453
For the problem of maximizing a convex quadratic function under convex quadratic constraints, we derive conditions characterizing a globally optimal solution. The method consists in exploiting the global optimality conditions, expressed in terms of -subdifferentials of convex functions and -normal directions, to convex sets. By specializing the problem of maximizing a convex function over a convex set, we find explicit conditions for optimality. 相似文献
48.
基于供应链风险和供应链绩效的模糊性和供应商选择问题的动态性,本文考虑供应链风险和供应链绩效作为模糊变量,讨论如何给生产商一个满意的动态多目标供应商选择方案,确定供应链风险和总成本最小,以及供应链绩效最大。然后对该问题提出了一个动态多目标多产品供应商选择模型,该模型是首次同时考虑供应商选择,订单分配,供应链风险和供应链绩效的一个模糊动态非线性多目标规划模型。为了去模糊化和求解该模型,给出了一个风险和绩效的模糊评估法。最后给出一个数值算例验证了该模型的可行性,为决策者选择供应商提供了理论依据。 相似文献
49.
In this paper an algorithm is developed to generate all nondominated extreme points and edges of the set of objective values of a multiple objective linear program. The approach uses simplex tableaux but avoids generating unnecessary extreme points or bases of extreme points. The procedure is based on, and improves, an algorithm Dauer and Liu developed for this problem. Essential to this approach is the work of Gal and Kruse on the neighborhood problem of determining all extreme points of a convex polytope that are adjacent to a given (degenerate) extreme point of the set. The algorithm will incorporate Gal's degeneracy graph approach to the neighborhood problem with Dauer's objective space analysis of multiple objective linear programs. 相似文献
50.
本文讨论半马氏环境连续时间马氏决策过程中的平均准则.首先讨论了半马氏报酬过程中的逼近问题,进而讨论平均目标函数逼近问题。 相似文献