標(biāo)題: Titlebook: Contributions to Operations Research; Proceedings of the C Klaus Neumann,Diethard Pallaschke Conference proceedings 1985 Springer-Verlag Be [打印本頁(yè)] 作者: Helmet 時(shí)間: 2025-3-21 18:59
書(shū)目名稱(chēng)Contributions to Operations Research影響因子(影響力)
書(shū)目名稱(chēng)Contributions to Operations Research影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Contributions to Operations Research網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Contributions to Operations Research網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Contributions to Operations Research被引頻次
書(shū)目名稱(chēng)Contributions to Operations Research被引頻次學(xué)科排名
書(shū)目名稱(chēng)Contributions to Operations Research年度引用
書(shū)目名稱(chēng)Contributions to Operations Research年度引用學(xué)科排名
書(shū)目名稱(chēng)Contributions to Operations Research讀者反饋
書(shū)目名稱(chēng)Contributions to Operations Research讀者反饋學(xué)科排名
作者: 敘述 時(shí)間: 2025-3-21 23:55 作者: indignant 時(shí)間: 2025-3-22 01:06 作者: 非實(shí)體 時(shí)間: 2025-3-22 07:52
Selection of Solutions by Algorithms,ngst possible solutions. If we replace a problem by a sequence of approximating problems, whose solutions can be interpreted as solutions of variational inequalities (optimization problems, equations, saddle- and equilibrium point problems), then the solutions we obtain, are the solutions of a two s作者: 滲透 時(shí)間: 2025-3-22 10:01 作者: minion 時(shí)間: 2025-3-22 14:21
Aspects of Optimization in Automobile Insurance,l in the sense of Bayesian estimators — are compared with the bonus-malus-classes of motor insurance in the FRG of today. The critical point in this approach is the knowledge of the structure function; this is exemplified by the german automobile insurance and its actual problems. Results without us作者: minion 時(shí)間: 2025-3-22 17:41 作者: 藕床生厭倦 時(shí)間: 2025-3-22 23:19 作者: saphenous-vein 時(shí)間: 2025-3-23 04:50
A Closed Network Model for I/O Subsystems,s to model the I/O subsystem as an M|G|1 queue, thus neglecting the CPU influence on the arrival stream. The second way is to use the central server model, treating the nonexponen-tially distributed I/O service times as exponentially distributed..Here we try to combine the benefits of both methods. 作者: CLAP 時(shí)間: 2025-3-23 08:46 作者: Tartar 時(shí)間: 2025-3-23 13:16
Visualization of Periodic TilingsAn overview of recent results on the problem of stability of linear time-varying discrete-time and continuous-time systems is given. Particular attention is devoted to the relations between stability of a continuous-time system and its (appropriately defined) discretization.作者: HERTZ 時(shí)間: 2025-3-23 15:16
Improved Bounds for the Sn/n Problem,A famous problem of optimal stopping is the “S./n problem”:作者: 手勢(shì) 時(shí)間: 2025-3-23 19:13 作者: harbinger 時(shí)間: 2025-3-24 01:48
https://doi.org/10.1007/978-3-642-59063-4nts that remain after solving the linear programming relaxation of some types of assignment problems..For the generalized assignment problem and time table problems we will give these bounds explicitly..Moreover, we will give bounds for the required capacity to ensure easy solutions.作者: 混亂生活 時(shí)間: 2025-3-24 04:59
https://doi.org/10.1007/978-3-642-59063-4ralizations of the Lagrange concept and numerous papers were published concerning this subject. Besides such investigations, since a couple of years a wide class of nonconvex optimization problems has been considered by DEUMLICH and ELSTER using the concept of generalized conjugate functions. Starti作者: 撫慰 時(shí)間: 2025-3-24 09:37
https://doi.org/10.1007/978-3-642-59063-4re m is a non-negative integer..For m = 1 an extensive literature about reliability problems on graphs is available, for m > 1 this paper gives bounds for the distribution function (and for the expectation, variance, etc. if necessary) of an intuitively appealing reliability measure of the graph in 作者: Assemble 時(shí)間: 2025-3-24 12:21
https://doi.org/10.1007/978-3-642-59114-3ngst possible solutions. If we replace a problem by a sequence of approximating problems, whose solutions can be interpreted as solutions of variational inequalities (optimization problems, equations, saddle- and equilibrium point problems), then the solutions we obtain, are the solutions of a two s作者: 火光在搖曳 時(shí)間: 2025-3-24 18:54 作者: 歪曲道理 時(shí)間: 2025-3-24 19:33
https://doi.org/10.1007/978-3-642-59140-2l in the sense of Bayesian estimators — are compared with the bonus-malus-classes of motor insurance in the FRG of today. The critical point in this approach is the knowledge of the structure function; this is exemplified by the german automobile insurance and its actual problems. Results without us作者: 刺耳的聲音 時(shí)間: 2025-3-25 02:23
https://doi.org/10.1007/978-3-642-59153-2 that, figuratively speaking, different walks emanating from a deterministic node do not meet anywhere in an OR network results in a certain tree structure: If we shrink all strong components of the network to one node each, then any partial network whose activities are carried out during a single p作者: 陶器 時(shí)間: 2025-3-25 05:22 作者: 寬敞 時(shí)間: 2025-3-25 08:28 作者: 描繪 時(shí)間: 2025-3-25 13:47 作者: 妨礙議事 時(shí)間: 2025-3-25 18:19 作者: entrance 時(shí)間: 2025-3-25 22:51
On using the linear programming relaxation of assignment type mixed integer problems,nts that remain after solving the linear programming relaxation of some types of assignment problems..For the generalized assignment problem and time table problems we will give these bounds explicitly..Moreover, we will give bounds for the required capacity to ensure easy solutions.作者: Nibble 時(shí)間: 2025-3-26 01:44
Lecture Notes in Economics and Mathematical Systemshttp://image.papertrans.cn/c/image/237198.jpg作者: 半導(dǎo)體 時(shí)間: 2025-3-26 05:44 作者: ADJ 時(shí)間: 2025-3-26 09:30
0075-8442 Overview: 978-3-540-15205-7978-3-642-46534-5Series ISSN 0075-8442 Series E-ISSN 2196-9957 作者: Cantankerous 時(shí)間: 2025-3-26 15:14
https://doi.org/10.1007/978-3-642-59063-4nts that remain after solving the linear programming relaxation of some types of assignment problems..For the generalized assignment problem and time table problems we will give these bounds explicitly..Moreover, we will give bounds for the required capacity to ensure easy solutions.作者: Bureaucracy 時(shí)間: 2025-3-26 17:37 作者: cringe 時(shí)間: 2025-3-27 00:17 作者: 割讓 時(shí)間: 2025-3-27 03:07
Contributions to Duality Theory of Certain Nonconvex Optimization Problems,ient duality theorems can be proved. It turns out that the theory of Φ -conjugate functions performs a remarkable contribution to the treatment of nonconvex optimization problems. Contributions to the finite dimensional case are given in /2/, /3/, /4/, /15/, /16/.作者: 內(nèi)行 時(shí)間: 2025-3-27 06:57 作者: MODE 時(shí)間: 2025-3-27 13:14
https://doi.org/10.1007/978-3-642-59140-2ast aspect of optimization deals with optimal bounds for the “bonus-hunger” which can be computed by means of dynamic-programming. For the special case of an exponential distribution for the amount of claims, the solution of this optimization is given by the solution of some Bernoulli differential equations.作者: expdient 時(shí)間: 2025-3-27 16:57 作者: biopsy 時(shí)間: 2025-3-27 18:54
Multistate Reliability Problems for GSP-Digraphs,terms of properly chosen subgraphs based on a suitable two vertex connectivity notation..A successive determination of lower and upper bounding distribution functions (and of bounds of the moments, if necessary) of the reliability measure is possible allowing improvements due to the choice of proper subgraph systems.作者: 護(hù)航艦 時(shí)間: 2025-3-27 22:23
A Closed Network Model for I/O Subsystems,We use a closed network model and analyze this by using an adjusted mean-value scheme. In this scheme service times depend on the number of clients in system. We make use of the residual lifetime dis-tribution of the client in disk service. Some experiments show that the model yields accurate results.作者: Intruder 時(shí)間: 2025-3-28 03:41
Selection of Solutions by Algorithms,al inequalities (optimization problems, equations, saddle- and equilibrium point problems), then the solutions we obtain, are the solutions of a two stage variational inequality. The inherent difficulty consists in finding the appropriate variational inequality. The numerical behaviour of the method depends on this “second stage inequality”.作者: AMPLE 時(shí)間: 2025-3-28 07:28 作者: 挫敗 時(shí)間: 2025-3-28 13:52
Optimal Stopping and Leavable Gambling Models with the Average Return Criterion,re than one continue action is available. The result of the paper also yields a sufficient condition for the existence of a stationary optimal policy in a leavable gambling house with a compact action space.作者: addition 時(shí)間: 2025-3-28 16:42
https://doi.org/10.1007/978-3-642-59063-4terms of properly chosen subgraphs based on a suitable two vertex connectivity notation..A successive determination of lower and upper bounding distribution functions (and of bounds of the moments, if necessary) of the reliability measure is possible allowing improvements due to the choice of proper subgraph systems.作者: 熱烈的歡迎 時(shí)間: 2025-3-28 20:54 作者: 分發(fā) 時(shí)間: 2025-3-28 23:15 作者: covert 時(shí)間: 2025-3-29 04:21
https://doi.org/10.1007/978-3-642-59140-2g strategies, the identification of interesting subclasses of strategies, results on the optimality, stability and monotonicity behaviour and, finally, insights into the special nature of exponential models, for which hints to some basic open questions are also included.作者: BLANK 時(shí)間: 2025-3-29 07:55
Exploring Plane Hyperbolic Geometryre than one continue action is available. The result of the paper also yields a sufficient condition for the existence of a stationary optimal policy in a leavable gambling house with a compact action space.作者: Bmd955 時(shí)間: 2025-3-29 14:58
ing problem, history of presenting problem, and social history..The mental status examination..Consideration of neuropsychological factors in interviewing..Specific disorders including depressive disorders, bip978-1-4939-9127-3
