標(biāo)題: Titlebook: Mathematical Programming at Oberwolfach II; Bernhard Korte,Klaus Ritter Book 1984Latest edition Springer-Verlag Berlin Heidelberg 1984 Mat [打印本頁] 作者: 鳴叫大步走 時間: 2025-3-21 19:31
書目名稱Mathematical Programming at Oberwolfach II影響因子(影響力)
書目名稱Mathematical Programming at Oberwolfach II影響因子(影響力)學(xué)科排名
書目名稱Mathematical Programming at Oberwolfach II網(wǎng)絡(luò)公開度
書目名稱Mathematical Programming at Oberwolfach II網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Mathematical Programming at Oberwolfach II被引頻次
書目名稱Mathematical Programming at Oberwolfach II被引頻次學(xué)科排名
書目名稱Mathematical Programming at Oberwolfach II年度引用
書目名稱Mathematical Programming at Oberwolfach II年度引用學(xué)科排名
書目名稱Mathematical Programming at Oberwolfach II讀者反饋
書目名稱Mathematical Programming at Oberwolfach II讀者反饋學(xué)科排名
作者: 移植 時間: 2025-3-21 21:11 作者: 形容詞詞尾 時間: 2025-3-22 00:59 作者: 和諧 時間: 2025-3-22 06:52
P. V. Kamesam,R. R. Meyer2], [BJL1], [BJL2], [J], [BV1], [BV2], [Ra7], [Ra2], for the linear case, and [M.R.1], [M.R2], [MR3], [E3] for the non linear case), and with a new theory of . ([Ra1], [Ra2], [Ra4], [Ra7], [RS1], [MR1], [E1], [E2] [E3], [E4], [EMMR1], [EMMR2], [MR4]). Using this description it is in particular possi作者: 松果 時間: 2025-3-22 12:13
O. L. Mangasarian2], [BJL1], [BJL2], [J], [BV1], [BV2], [Ra7], [Ra2], for the linear case, and [M.R.1], [M.R2], [MR3], [E3] for the non linear case), and with a new theory of . ([Ra1], [Ra2], [Ra4], [Ra7], [RS1], [MR1], [E1], [E2] [E3], [E4], [EMMR1], [EMMR2], [MR4]). Using this description it is in particular possi作者: VEST 時間: 2025-3-22 15:11 作者: 疲勞 時間: 2025-3-22 17:38 作者: Certainty 時間: 2025-3-22 21:47 作者: 值得贊賞 時間: 2025-3-23 03:27 作者: 性冷淡 時間: 2025-3-23 07:19 作者: Etymology 時間: 2025-3-23 09:59 作者: 冷淡一切 時間: 2025-3-23 14:55 作者: febrile 時間: 2025-3-23 22:00
,Node-weighted graphs having the K?nig-Egerváry property, equation .=0. In case (.) is a .-KEG, both algorithms provide a minimum weight transversal..Some of our results generalize previous results obtained in the unweighted case by Deming, Gavril and Sterboul..A companion paper will analyze applications of the weighted K?nig-Egerváry property to quadratic 0–1 optimization.作者: 產(chǎn)生 時間: 2025-3-23 23:42 作者: ROOF 時間: 2025-3-24 02:41
Multipoint methods for separable nonlinear networks,t grids than for fixed grids, the numerical results presented show overall computing times are less for implicit grids. A lower bounding technique based on the error of approximation is also developed. This technique is highly useful if Lagrangian relaxations are difficult to solve.作者: 無王時期, 時間: 2025-3-24 09:26 作者: BAN 時間: 2025-3-24 14:21
Covering directed and odd cuts,mber of .-odd components of .. Moreover, if . is bipartite, there is an optimal partition arising from a partition of the two parts. Secondly some orientation problems of undirected graphs are discussed. The results also emphasize the analogy between strong connectivity and parity conditions.作者: HEPA-filter 時間: 2025-3-24 18:35 作者: cunning 時間: 2025-3-24 20:52 作者: Eeg332 時間: 2025-3-25 00:21 作者: 精致 時間: 2025-3-25 07:18 作者: JIBE 時間: 2025-3-25 09:45 作者: white-matter 時間: 2025-3-25 15:00 作者: GRIPE 時間: 2025-3-25 18:10 作者: dithiolethione 時間: 2025-3-25 22:32
Stephen M. Robinsonr the output of the system can be made to follow a preassigned trajectory over a specific interval of time, are now well known (see Hirschorn [4] and the references therein or the recent paper by Grasse [3]). In these studies, nonlinear systems are either defined by a state-space representation or b作者: choleretic 時間: 2025-3-26 00:23
J. B. Rosen, [Be1], [Sin1]). One problem with the classical theory is the difficulty of explicit calculations : from the birth of our subject (late 19th century) until to very recent work ([Kat4], [KP], [B.B.H], [B.H], [Ra5], [Ra8], [DM]) the only explicit computations we know are for Airy equation [Kap], and 作者: wall-stress 時間: 2025-3-26 07:24
Karel Zimmermann, [Be1], [Sin1]). One problem with the classical theory is the difficulty of explicit calculations : from the birth of our subject (late 19th century) until to very recent work ([Kat4], [KP], [B.B.H], [B.H], [Ra5], [Ra8], [DM]) the only explicit computations we know are for Airy equation [Kap], and 作者: Exclaim 時間: 2025-3-26 11:38 作者: 愚蠢人 時間: 2025-3-26 12:37
Uncapacitated lot-sizing: The convex hull of solutions,ormulation of this problem leads to a very large duality gap. Here the convex hull of the solutions of the economic lot-sizing model is given. In addition, an alternative formulation as a simple plant location problem is examined, and here too the convex hull of solutions is obtained.作者: 存在主義 時間: 2025-3-26 17:37
,Node-weighted graphs having the K?nig-Egerváry property,ing λ such that the weight of . is equal to the value of λ; the usual K?nig-Egerváry graphs correspond to .=(1, 1, …, 1)..Several characterizations and two polynomial recognition algorithms for .-KEGs are presented. Algorithm 1 either recognizes (.) as being a .-KEG, or else exhibits an ‘obstruction作者: 擔(dān)心 時間: 2025-3-26 22:22
Inaccuracy in quasi-Newton methods: Local improvement theorems,re only inaccurate .-values are available. Our analysis is for the case where the relative error in . is less than one. We obtain theorems specifying local rates of improvement and limiting accuracies depending on the nearness to Newton’s method of the basic algorithm, the accuracy of its implementa作者: 詞根詞綴法 時間: 2025-3-27 02:28
Orientation of matrices,ix. In this paper we describe a finite algorithm to make this transformation, based on the results of Camion. Our main result is that when . is a totally unimodular matrix this transformation can be made by a polynomial algorithm.作者: COLON 時間: 2025-3-27 07:03
Covering directed and odd cuts,n directed cuts and Seymour’s theorem on odd cuts. Here we strengthen these results (incidently providing a simple proof of Seymour’s theorem). For example, the minimum cardinality of a .-join in a graph .=(.) is proved to equal the maximum of Σ..(..)/2 over all partitions of . where ..(.) is the nu作者: epinephrine 時間: 2025-3-27 11:47 作者: 骯臟 時間: 2025-3-27 17:02
Inner estimates for the generalized gradient of the optimal value function in nonlinear programmingertain assumptions there exists an optimal solution of the reference problem whose Lagrange multiplier set intersects the generalized gradient of . at .. We investigate such relationships in more detail and prove that this generalized gradient must meet any compact multiplier set (which is relevant 作者: 冒煙 時間: 2025-3-27 18:02 作者: 培養(yǎng) 時間: 2025-3-28 01:37
Modelling with integer variables,xtend earlier ones due to R.R. Meyer. We provide representations whose linear relaxations have an efficient formulation, while retaining maximum accuracy to the problem modelled. Under mild hypotheses, these properties are retained as integer variables are set to values in nodes of branch-and-bound 作者: Germinate 時間: 2025-3-28 02:25
Multipoint methods for separable nonlinear networks, grid’ approximations of 2, 4, and 6 segments per variable and ‘implicit grid’ strategies that generate segments as needed, but store at most a 2-segment approximation at any time. It is shown that the implicit grid methods are linearly convergent, and this predicted behavior is confirmed by highly 作者: Misgiving 時間: 2025-3-28 09:57
Normal solutions of linear programs, positive multiples of the gradient of the objective function. This projection turns out to be the normal solution obtained by projecting the origin on the optimal solution set. By seeking the solution with least 2-norm which minimizes the l-norm infeasibility measure of a system of linear inequalit作者: 體貼 時間: 2025-3-28 10:44 作者: 可轉(zhuǎn)變 時間: 2025-3-28 17:42
Performance of approximate algorithms for global minimization,earing only linearly (in addition to the nonlinear variables) are considered. The analysis is based on finding an ?-approximate solution, in the sense that the function value found is known to be no more than εΔψ. greater than the global minimum, where εΔψ. is a known scale factor and the tolerance 作者: Emmenagogue 時間: 2025-3-28 21:35 作者: Veneer 時間: 2025-3-28 23:43
https://doi.org/10.1007/BFb0121003Mathematica; optimization; programming作者: modest 時間: 2025-3-29 04:16 作者: 慢慢沖刷 時間: 2025-3-29 10:01 作者: 變化 時間: 2025-3-29 13:14 作者: NAUT 時間: 2025-3-29 18:12
Mathematical Programming at Oberwolfach II978-3-642-00915-0Series ISSN 0303-3929 Series E-ISSN 2364-8201 作者: surrogate 時間: 2025-3-29 23:29 作者: 樹木中 時間: 2025-3-30 02:37
Mathematical Programming Studieshttp://image.papertrans.cn/m/image/626554.jpg作者: Eosinophils 時間: 2025-3-30 04:41 作者: 共同時代 時間: 2025-3-30 11:06
Orientation of matrices,ix. In this paper we describe a finite algorithm to make this transformation, based on the results of Camion. Our main result is that when . is a totally unimodular matrix this transformation can be made by a polynomial algorithm.作者: 皺痕 時間: 2025-3-30 16:15 作者: 休息 時間: 2025-3-30 17:23 作者: 蝕刻 時間: 2025-3-30 23:28
https://doi.org/10.1007/978-1-4939-7431-3Cancer biomarkers; Drug development; Pharmaceuticals; Personalized medicine; Precision medicine; Therapeu作者: 虛構(gòu)的東西 時間: 2025-3-31 01:07
Krise der objektiven Vernunftodischen., hier wiederum vor allem hinsichtlich von Webers Begriffen der ?Rationalit?t‘, der ?objektiven M?glichkeit‘ und des ?Idealtypus‘ N?he und Distanz der beiden Protagonisten aufgezeigt. Die N?he von Lukács kann nach diesen Arbeiten in seiner offenkundigen Beeinflussung durch die mit den genan
