標(biāo)題: Titlebook: Mathematiacl Programming Essays in Honor of George B. Dantzig Part II; Richard W. Cottle Book 1985Latest edition Springer-Verlag Berlin He [打印本頁] 作者: Flexibility 時(shí)間: 2025-3-21 19:47
書目名稱Mathematiacl Programming Essays in Honor of George B. Dantzig Part II影響因子(影響力)
書目名稱Mathematiacl Programming Essays in Honor of George B. Dantzig Part II影響因子(影響力)學(xué)科排名
書目名稱Mathematiacl Programming Essays in Honor of George B. Dantzig Part II網(wǎng)絡(luò)公開度
書目名稱Mathematiacl Programming Essays in Honor of George B. Dantzig Part II網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Mathematiacl Programming Essays in Honor of George B. Dantzig Part II被引頻次
書目名稱Mathematiacl Programming Essays in Honor of George B. Dantzig Part II被引頻次學(xué)科排名
書目名稱Mathematiacl Programming Essays in Honor of George B. Dantzig Part II年度引用
書目名稱Mathematiacl Programming Essays in Honor of George B. Dantzig Part II年度引用學(xué)科排名
書目名稱Mathematiacl Programming Essays in Honor of George B. Dantzig Part II讀者反饋
書目名稱Mathematiacl Programming Essays in Honor of George B. Dantzig Part II讀者反饋學(xué)科排名
作者: 容易懂得 時(shí)間: 2025-3-21 22:27
Linear complementarity problems solvable by a polynomially bounded pivoting algorithm,roblem defined by an . by .-matrix in no more than . pivots. The condition is then shown to be satisfied by a .-matrix which has a hidden . transpose and thus in particular, by an .-matrix with positive diagonals as well as by a strictly diagonally dominant matrix. The same condition is also shown t作者: antipsychotic 時(shí)間: 2025-3-22 01:10 作者: Metamorphosis 時(shí)間: 2025-3-22 04:59 作者: 簡略 時(shí)間: 2025-3-22 09:52 作者: Feedback 時(shí)間: 2025-3-22 12:55
Minimizing a unimodal function of two integer variables, its value (not its gradient), and that only at integer-valued points in its domain. Its minimum over the integers is required. We present an algorithm, which seems reasonably efficient, for solving this problem in the case of two variables. The algorithm can be extended to handle a quadratic functi作者: UNT 時(shí)間: 2025-3-22 19:14
Existence and characterization of minima of concave functions on unbounded convex sets,t if the closure of the collection of extreme points is bounded and the function is lower semicontinuous thereon, the function attains its minimum on the set at an extreme point if and only if the function is bounded below on each half-line in the set. It is shown in this paper that this is so if an作者: DUCE 時(shí)間: 2025-3-22 22:58 作者: 閑蕩 時(shí)間: 2025-3-23 02:33
On the principle of monotone likelihood and log-linear models,ints and if certain functions of the sample-points take identical values. The Principle of Monotone Likelihood is satisfied for activity-equivalent samples if the sample with lower values of certain cost functions has greater likelihood than the sample with higher values of the cost functions. It is作者: Chronic 時(shí)間: 2025-3-23 08:46 作者: Palpate 時(shí)間: 2025-3-23 12:43
Forest iteration method for stochastic transportation problem, economic applications. In this paper we present a new algorithm to solve this problem. Instead of discretizing the distribution functions of the stochastic demands, we explore the problem’s network aspects and propose a forest iteration method to solve it. This method iterates from one base forest 作者: 高歌 時(shí)間: 2025-3-23 15:08
Critical path planning under uncertainty, is a linear function of the investment (up to some maximum) in that job and a random variable that is independent of the investment. It is desired to find the minimum investment required as a function of expected project completion time. The problem is solved by a cutting plane technique in which t作者: 排出 時(shí)間: 2025-3-23 19:42
ormation, highly useful for better understanding peoples’ feelings and emotions. Making sense of this huge amount of data, would provide invaluable benefits to companies, organizations and governments alike, by better understanding what the public thinks about their services and products. However, a作者: 敵手 時(shí)間: 2025-3-23 22:37 作者: 騎師 時(shí)間: 2025-3-24 04:37
J. S. Pang,R. ChandrasekaranIt involves two species, one being the host, the other the guest species which can be atoms, molecules or even solvation complexes. Intercalation reactions combining different guest species with different host materials have intensively been investigated in the last decades because of their fundamen作者: 食草 時(shí)間: 2025-3-24 09:18 作者: 中止 時(shí)間: 2025-3-24 12:16 作者: 啪心兒跳動(dòng) 時(shí)間: 2025-3-24 16:50
R. Rouhani,L. Lasdon,W. Lebow,A. D. Warenlace while the system is undergoing interactions with its ., which generally consists of a solvent or a solid. The situation is therefore quite distinct from the case where activated barrier crossing proceeds essentially as a . over a reactive barrier. The latter situation is often modeled accuratel作者: 抱怨 時(shí)間: 2025-3-24 22:38
Alan J. Hoffman,Philip Wolfelace while the system is undergoing interactions with its ., which generally consists of a solvent or a solid. The situation is therefore quite distinct from the case where activated barrier crossing proceeds essentially as a . over a reactive barrier. The latter situation is often modeled accuratel作者: facilitate 時(shí)間: 2025-3-25 00:19
Arthur F. Veinott many studies showed that while children master the prerequisites to compute SIs, they are not as proficient as adults in computing them (a.o., Papafragou and Musolino .; Napoleon and Bishop .). Other studies (i.e., Meroni and Gualmini .), on the other hand, showed that even four-year-old children c作者: FRAX-tool 時(shí)間: 2025-3-25 07:18 作者: VEST 時(shí)間: 2025-3-25 10:29
Sven Erlandertions. In Spanish, the synthetic future has been claimed to have evolved away from indicating chronology, towards expressing speaker-internal evidentiality and, sometimes, concession; whereas in French, these interpretations of future tense are greatly restricted, and chronological ones predominate.作者: 不適 時(shí)間: 2025-3-25 12:28 作者: 厭食癥 時(shí)間: 2025-3-25 15:48
Liqun Qiarian and near-native late L2-German. Both studies focus on studying pronominal subjects in a pro-drop-L1/non-pro-drop but expletive- and topic-drop-L2 constellation. Phenomena at the syntax-discourse interface have been claimed problematic in similar cases, namely for attrited L1 Italian-L2 English作者: 粘連 時(shí)間: 2025-3-25 21:39 作者: Sinus-Rhythm 時(shí)間: 2025-3-26 01:38
Linear complementarity problems solvable by a polynomially bounded pivoting algorithm,o be sufficient for Lemke’s almost complementary algorithm to compute a solution to a linear complementarity problem defined by an . by . nondegenerate matrix in at most .+1 pivots. Finally, a polynomial testing procedure for the condition is described.作者: Mast-Cell 時(shí)間: 2025-3-26 06:50 作者: milligram 時(shí)間: 2025-3-26 10:30 作者: 華而不實(shí) 時(shí)間: 2025-3-26 12:58
Forest iteration method for stochastic transportation problem,triple to another base forest triple with strictly decreasing objective values. Therefore, it converges in finitely many steps. The nonlinear work in each step consists of solving a small number of one-dimensional monotone equations.作者: 不合 時(shí)間: 2025-3-26 20:09
Simple computable bounds for solutions of linear complementarity problems and linear programs,are not optimal provides a simple numerical bound for some or all components of all primal-dual solution vectors. In addition we show that the existence of such numerical bounds is not only sufficient but is also necessary for the boundedness of solution vector components for both the linear complementarity problem and the dual linear programs.作者: Cantankerous 時(shí)間: 2025-3-26 21:17
On the quadratic programming algorithm of Goldfarb and Idnani,he author has provided for general use [8] a Fortran subroutine that applies the faster implementation. This subroutine is compared with two widely available quadratic programming subroutines that employ feasible point methods, namely QPSOL [4] and VEO2A作者: Junction 時(shí)間: 2025-3-27 04:53
Critical path planning under uncertainty, find the minimum investment required as a function of expected project completion time. The problem is solved by a cutting plane technique in which the investment allocations yield feasibility cuts. Because of the special structure of this problem, these cuts can be generated by solving a sequence of longest path problems in an acyclic network.作者: Mendacious 時(shí)間: 2025-3-27 07:05
A generalized Benders decomposition approach to reactive source planning in power systems,.Noting successful experience in other location problems with Benders decomposition algorithm, the Generalized Benders method is applied. Even though the convexity assumptions needed to guarantee success may not be satisfied, the procedure performs well. Results are presented for systems of small, medium, and large dimensions.作者: 流行 時(shí)間: 2025-3-27 13:12
Existence and characterization of minima of concave functions on unbounded convex sets,n at infinity in every extreme direction is linear in the directions, it is shown that the function attains its minimum on the set if and only if a pair of linear functions attains its lexicographic minimum on the set.作者: 使顯得不重要 時(shí)間: 2025-3-27 14:43
On the principle of monotone likelihood and log-linear models,ntial and normal distributions, Maxwell-Boltzmann’s distribution for the speeds of the molecules of an ideal gas, the Maxwell-Boltzmann energy distribution law, the gravity model in transportation planning.作者: SSRIS 時(shí)間: 2025-3-27 19:50
Springer-Verlag Berlin Heidelberg 1985作者: neolith 時(shí)間: 2025-3-27 22:56
Mathematiacl Programming Essays in Honor of George B. Dantzig Part II978-3-642-00921-1Series ISSN 0303-3929 Series E-ISSN 2364-8201 作者: Iniquitous 時(shí)間: 2025-3-28 04:54 作者: 殺子女者 時(shí)間: 2025-3-28 06:33
Minimizing a unimodal function of two integer variables, its value (not its gradient), and that only at integer-valued points in its domain. Its minimum over the integers is required. We present an algorithm, which seems reasonably efficient, for solving this problem in the case of two variables. The algorithm can be extended to handle a quadratic function of three variables.作者: 驚惶 時(shí)間: 2025-3-28 14:19
Using deep cuts in an ellipsoid algorithm for nonlinear programming,ut hyperplanes are used to generate the next ellipsoid from the current one. Efficiency and robustness are compared when the variants are used to solve convex and nonconvex problems. Statistics on the frequency and the depth of the various cuts are also reported.作者: 受人支配 時(shí)間: 2025-3-28 18:09
Mathematical Programming Studieshttp://image.papertrans.cn/m/image/626547.jpg作者: mettlesome 時(shí)間: 2025-3-28 18:45 作者: FLAT 時(shí)間: 2025-3-29 00:27
ic social media analysis approach, TweetOntoSense, which uses ontologies to model complex feeling such as happiness, affection, surprise, anger or sadness. By storing the results as structured data, the possibilities offered by the semantic web technologies can be fully exploited.作者: laceration 時(shí)間: 2025-3-29 05:45
O. L. Mangasarianorporate future communication technologies that could enhance its quality. In this paper we present several platform independent models to overcome this problem by decreasing the level of cohesion between communication technologies and software for ubiquitous computing. As a case study, and to show 作者: 鋪?zhàn)?nbsp; 時(shí)間: 2025-3-29 10:00
J. S. Pang,R. Chandrasekaranals highly anisotropic and in extreme cases two-dimensional. There is a large number of known layered chalcogenides sharing the same or similar crystal structure but composed of different elements. Thus a large variety of properties exist making these materials interesting from the theoretical point作者: crease 時(shí)間: 2025-3-29 15:10
E. M. L. Beale,O. S. Brookerundertaken by Guth (Discrete Comput Geom 53(2):428–444, 2015, [.]). The present paper presents a different and simpler derivation, with better bounds than those in Guth, and without the restrictive assumptions made there. Our result has a potential for applications to other incidence problems in hig作者: 厚臉皮 時(shí)間: 2025-3-29 16:31
M. J. D. Powelltions from additive combinatorics. As part of a recent surge of algebraic techniques in combinatorial geometry, a number of quantitative and qualitative steps have been made within this framework. Nevertheless, many tantalizing open questions remain.作者: Extemporize 時(shí)間: 2025-3-29 22:11
R. Rouhani,L. Lasdon,W. Lebow,A. D. Warensing from the surrounding solvent, unless, of course, the infinitely many bath degrees of freedom are part of the many-dimensional configuration space. The effects induced by the coupling to the environment, or more specifically: (i) the role of recrossing of reactive trajectories, as well as (ii) t
