標(biāo)題: Titlebook: Mathematical Programming at Oberwolfach; H. K?nig,B. Korte,K. Ritter Book 1981Latest edition Springer-Verlag Berlin Heidelberg 1981 Mathem [打印本頁] 作者: MAXIM 時(shí)間: 2025-3-21 16:50
書目名稱Mathematical Programming at Oberwolfach影響因子(影響力)
書目名稱Mathematical Programming at Oberwolfach影響因子(影響力)學(xué)科排名
書目名稱Mathematical Programming at Oberwolfach網(wǎng)絡(luò)公開度
書目名稱Mathematical Programming at Oberwolfach網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Mathematical Programming at Oberwolfach被引頻次
書目名稱Mathematical Programming at Oberwolfach被引頻次學(xué)科排名
書目名稱Mathematical Programming at Oberwolfach年度引用
書目名稱Mathematical Programming at Oberwolfach年度引用學(xué)科排名
書目名稱Mathematical Programming at Oberwolfach讀者反饋
書目名稱Mathematical Programming at Oberwolfach讀者反饋學(xué)科排名
作者: Interdict 時(shí)間: 2025-3-21 21:42 作者: HEPA-filter 時(shí)間: 2025-3-22 03:16
Minimal cost flows in regular matroids,The first algorithms starts with an arbitrary maximal matroid flow and reduces its costs by finding . in .. The second builds up a min cost matroid flow by starting with the zero flow and performing augmentations along .. The last algorithm works in regular matroids with special structures. By a seq作者: Thyroid-Gland 時(shí)間: 2025-3-22 05:52 作者: 惡意 時(shí)間: 2025-3-22 11:44 作者: Bronchial-Tubes 時(shí)間: 2025-3-22 16:44
On the structure of the monotone asymmetric travelling salesman polytope II: Hypotraceable facets,an circuits of the complete digraph of order .. It is shown in this paper that certain hypotraceable digraphs. ., i.e. digraphs which do not contain a hamiltonian path but . does for all .?., defines facets . for .for all .. Since hypotraceable digraphs constitute a very complicated class of digraph作者: jet-lag 時(shí)間: 2025-3-22 17:13 作者: INERT 時(shí)間: 2025-3-22 23:06 作者: 隱語 時(shí)間: 2025-3-23 04:37
First and second order sufficient optimality conditions in mathematical programming and optimal conex cones. The sufficient conditions are formulated by means of two norms and, thereby, are applicable to optimal control problems with state constraints where the definiteness conditions can only hold in a weaker norm than that in which the functions involved are differentiable. The second order suf作者: COMMA 時(shí)間: 2025-3-23 08:07 作者: 合乎習(xí)俗 時(shí)間: 2025-3-23 12:24 作者: eustachian-tube 時(shí)間: 2025-3-23 16:32
A resource decomposition algorithm for general mathematical programs,gorithm, can be developed for general mathematical programs. As an example of this algorithm we obtain an algorithm for bilinear programs. In addition we examine a question of importance for postoptimality analysis, that of finding an optimal dual solution to the original problem from the solution o作者: 過剩 時(shí)間: 2025-3-23 21:38 作者: faddish 時(shí)間: 2025-3-24 02:12 作者: nutrients 時(shí)間: 2025-3-24 05:09 作者: Resection 時(shí)間: 2025-3-24 07:54 作者: 小口啜飲 時(shí)間: 2025-3-24 12:29 作者: 蛙鳴聲 時(shí)間: 2025-3-24 18:28
Peter Gács,Laszlo Lovászollective superspin glass state resulting from such interaction is discussed, using a collection of experimental results. Superspin glasses display qualitatively similar dynamical magnetic properties as canonical spin glasses, including ageing, memory and rejuvenation phenomena. In the Introduction,作者: CLIFF 時(shí)間: 2025-3-24 20:39 作者: LEVY 時(shí)間: 2025-3-25 02:22
Lagrangean functions and affine minorants,rturb the criterion function by a linear term, and to take the limit of this perturbed lagrangean as the norm of this term goes to zero..We also review the recent literature on this topic of the “l(fā)imiting lagrangean”.作者: Optimum 時(shí)間: 2025-3-25 04:28 作者: 自傳 時(shí)間: 2025-3-25 09:12 作者: 變化 時(shí)間: 2025-3-25 15:39 作者: 凝結(jié)劑 時(shí)間: 2025-3-25 18:00 作者: 娘娘腔 時(shí)間: 2025-3-25 20:52
Algorithmic versus axiomatic definitions of matroids,nd calculations of the complexity of matroid properties with respect to various “oracles”. Of particular interest is the fact that matroids can be also axiomatically defined by a girth function and that the GIRTH oracle is significantly stronger than the more standard oracles.作者: 破布 時(shí)間: 2025-3-26 01:27
,On conditions warranting Φ-subdifferentiability,e a neighbourhood . of .., a neighbourhood . of .. and a constant .>0 such that for .?..The investigations of γ-paraconvexity were stimulated by investigations of H?lder and Lipschitz differentiability of Lagrangians considered by Dolecki and Kurcyusz in [8].作者: GOAT 時(shí)間: 2025-3-26 06:47
Linear programming by an effective method using triangular matrices, constraint becomes inactive, the computational effort in solving the triangular systems corresponds to that of the matrix-updating in the projection method, whereas in all other cases the effort is reduced. This reduction can be very high. Cycling of the method is excluded by a very simple rule.作者: Credence 時(shí)間: 2025-3-26 11:51
Secant approximation methods for convex optimization,bounds on the optimal value are derived from the piecewise-linear approximations. Convergence to the optimal value of the given problem is established under mild hypotheses. The method has been successfully tested on a variety of problems, including a water supply problem with more than 900 variables and 600 constraints.作者: 一罵死割除 時(shí)間: 2025-3-26 13:13 作者: Eeg332 時(shí)間: 2025-3-26 19:52 作者: Lacunar-Stroke 時(shí)間: 2025-3-26 23:17
Mathematical Programming at Oberwolfach978-3-642-00806-1Series ISSN 0303-3929 Series E-ISSN 2364-8201 作者: 谷物 時(shí)間: 2025-3-27 03:16
0303-3929 Overview: 978-3-642-00806-1Series ISSN 0303-3929 Series E-ISSN 2364-8201 作者: Ophthalmologist 時(shí)間: 2025-3-27 06:07 作者: 圍巾 時(shí)間: 2025-3-27 11:07
,Khachiyan’s algorithm for linear programming,L.G. Khachiyan’s algorithm to check the solvability of a system of linear inequalities with integral coefficients is described. The running time of the algorithm is polynomial in the number of digits of the coefficients. It can be applied to solve linear programs in polynomial time.作者: Ophthalmologist 時(shí)間: 2025-3-27 15:32 作者: conifer 時(shí)間: 2025-3-27 18:33 作者: 反叛者 時(shí)間: 2025-3-27 23:24
Some continuity properties of polyhedral multifunctions,A multifunction is . if its graph is the union of finitely many polyhedral convex sets. This paper points out some fairly strong continuity properties that such multifunctions satisfy, and it shows how these may be applied to such areas as linear complementarity and parametric programming.作者: Recessive 時(shí)間: 2025-3-28 05:59
A resource decomposition algorithm for general mathematical programs,gorithm, can be developed for general mathematical programs. As an example of this algorithm we obtain an algorithm for bilinear programs. In addition we examine a question of importance for postoptimality analysis, that of finding an optimal dual solution to the original problem from the solution of the decomposed problem.作者: Gorilla 時(shí)間: 2025-3-28 09:06
https://doi.org/10.1007/BFb0120916Mathematica; optimization; programming作者: 里程碑 時(shí)間: 2025-3-28 14:11 作者: 佛刊 時(shí)間: 2025-3-28 18:18 作者: STENT 時(shí)間: 2025-3-28 22:30
Jürgen Br?uningering contributed volume highlights future perspectives and areas of emerging research, and will be of great interest to advanced undergraduates, as well as researchers in academia and industry.978-3-030-60475-2978-3-030-60473-8Series ISSN 0933-033X Series E-ISSN 2196-2812 作者: 戲法 時(shí)間: 2025-3-29 00:12
Rainer E. Burkard,Horst Hamacherrystals can be obtained. Mesostructures of hexagonally ordered columns, labyrinths and void structures can result from assisted self-assembling, induced by the application of an external magnetic field. In highly ordered superlattices, individual NPs act as “artificial atoms” and occupy the lattice 作者: 殘忍 時(shí)間: 2025-3-29 06:38 作者: 一再困擾 時(shí)間: 2025-3-29 08:59 作者: conservative 時(shí)間: 2025-3-29 13:54 作者: 小鹿 時(shí)間: 2025-3-29 16:03
On self-transformable combinatorial problems,phic graphs. In an independent section we show that the efficiency of man machine interaction in computing a Boolean function . is strongly limited by the network complexity of .. Any complex Boolean function . can be computed efficiently only if the human problem solver supplies as much information作者: 宣誓書 時(shí)間: 2025-3-29 22:53
Active database rules with transaction-conscious stable-model semantics,nt semantics of active rules, and (ii) the various systems developed so far have ad-hoc operational semantics that are widely different from each other. This situation contributes to the difficulty of predicting the run-time behavior of sets of rules: thus, ensuring the termination of a given set of作者: AMPLE 時(shí)間: 2025-3-30 01:10 作者: Control-Group 時(shí)間: 2025-3-30 05:15
A Comprehensive Survey on Application Layer Protocols in the Internet of Things,tensive IoT-based services. The basic idea is to deliver a new set of applications where smart devices collaborate without any human interference. The variability and visibility of IoT based services lead to the development of the full spectrum of protocols. With the exponential growth of applicatio作者: cultivated 時(shí)間: 2025-3-30 09:14
Role of Botanicals in Pest Management in Horticultural Crops, China berry, pongamia, essential oils, garlic, custard apple, cassava, and pagoda tree are important botanicals in India used for pest control. Neem-based pesticides are one of the most important botanical pesticides used widely in India for pest management. Botanical pesticides can play a very im作者: CHIDE 時(shí)間: 2025-3-30 12:50 作者: CONE 時(shí)間: 2025-3-30 17:07 作者: Conflict 時(shí)間: 2025-3-30 23:35 作者: Functional 時(shí)間: 2025-3-31 02:13 作者: MOCK 時(shí)間: 2025-3-31 08:58 作者: Conspiracy 時(shí)間: 2025-3-31 12:32 作者: 宣稱 時(shí)間: 2025-3-31 14:30 作者: patriarch 時(shí)間: 2025-3-31 20:01 作者: Creditee 時(shí)間: 2025-3-31 22:12 作者: 使習(xí)慣于 時(shí)間: 2025-4-1 01:52
uer Wirtschaftsr?ume und Kapitalm?rkte verbreiten sich auch unterschiedliche Krisentendenzen. Dies gilt besonders für die aktuelle politische und ?konomische Situation, die im Herbst 2008 als Finanzmarktkrise begann und inzwischen zu einer allgemeinen Wirtschaftskrise geworden ist. Christian Ludwig
