標(biāo)題: Titlebook: Evaluating Mathematical Programming Techniques; Proceedings of a Con John M. Mulvey Conference proceedings 1982 Springer-Verlag Berlin Heid [打印本頁] 作者: TRACT 時間: 2025-3-21 18:39
書目名稱Evaluating Mathematical Programming Techniques影響因子(影響力)
作者: linguistics 時間: 2025-3-21 23:56
Test Problems for Computational Experiments -- Issues and TechniquesReal problems are viewed as realizations from a test population of interest, and random problems are treated as models for the population. Methodological advantages and difficulties inherent in the alternatives are highlighted, and methods for dealing with the limitations discussed.作者: 發(fā)誓放棄 時間: 2025-3-22 03:57 作者: 慌張 時間: 2025-3-22 08:07
The Definition and Generation of Geometrically Random Linear Constraint Setsusually imposed through some kind of rejection technique. Recent work of Van Dam and Telgen indicates that this type of generator tends to produce geometrically atypical polvtopes. We define and construct a generator that produces . random constraint sets; that is, their probability measure is invar作者: 刺激 時間: 2025-3-22 12:44 作者: cornucopia 時間: 2025-3-22 15:43 作者: cornucopia 時間: 2025-3-22 17:51
Evidence of Fundamental Difficulties in Nonlinear Optimization Code Comparisons. The common performance measures (number of function evaluations, standardized computer time, number of problems solved) are intuitively machine independent, which encourages such use. Unfortunately, the relative performance of optimization codes does depend on the computer and compiler used for te作者: 偏狂癥 時間: 2025-3-22 22:09
A Statistical Review of the Sandgren-Ragsdell Comparative Studymonstrate that there is statistical evidence that selected codes are superior to others on the basis of their relative solution times. A logarithmic transformation is used to produce a seminormal distribution of the solution times with a variance assumed to be equal for all of the algorithms. A pair作者: 稱贊 時間: 2025-3-23 02:15
A Methodological Approach to Testing of NLP-Softwarelems to be solved by this software; and (3) goals of testing..We present a methodological setup of testing nonlinear programming software which is based on prior knowledge. This leads to a discussion of the following topics: representativity of test problems, use of test problem generators, performa作者: Apogee 時間: 2025-3-23 07:39
A Computational Comparison of Five Heuristic Algorithms for the Euclidean Traveling Salesman Problemmposite algorithm consisting of a simple tour construction algorithm and a post-processor. The five tour construction procedures considered are all insertion algorithms which may be easily implemented. The post-processor used in the five composite algorithms is a modified 3-opt procedure that is sho作者: 執(zhí) 時間: 2025-3-23 13:25
Implementing an Algorithm: Performance Considerations and a Case Studyhms for solving multidimensional knapsack problems was implemented in three different FORTRAN programs. Starting from a straightforward program, we introduce increasingly sophisticated data structures to improve the virtual execution time of the programs. All programs were compiled with the enhanced作者: 規(guī)范就好 時間: 2025-3-23 16:09
Which Options Provide the Quickest Solutionsorithm will always eventually find a solution, the important question is which combination of options is likely to be “best”. A general statistical approach to answering this question is illustrated in the context of a new integer linear programming algorithm where “best” is quickest.作者: Anguish 時間: 2025-3-23 18:05
Comparative Computational Studies in Mathematical Programminge recent computational studies with differing viewpoints. The authors of these studies will make a brief presentation** outlining the methodology they used, their views on the good and bad points in the study, and their suggestions for future studies. Following these presentations members of the pan作者: Mingle 時間: 2025-3-24 00:46 作者: AGONY 時間: 2025-3-24 03:51
Comments on Evaluating Algorithms and Codes for Mathematical Programmingen and Ragsdell [5], and Schittkowski [7], and give some of our views on this subject. We suggest the papers by Gill and Murray [2] and Moré [4], and the book they are contained in (Fosdick [1]), as other important reading on this subject.作者: magenta 時間: 2025-3-24 08:34 作者: Foment 時間: 2025-3-24 14:36
In Pursuit of a Methodology for Testing Mathematical Programming SoftwareAlgorithms of the Mathematical Programming Society has developed guidelines which present minimum standards to which all papers reporting such efforts should conform. Although guidelines now exist, the development of sound methodologies for this testing is at the embryonic stage. This paper surveys 作者: 友好關(guān)系 時間: 2025-3-24 15:20 作者: ingenue 時間: 2025-3-24 21:09
https://doi.org/10.1007/978-1-349-06293-5Real problems are viewed as realizations from a test population of interest, and random problems are treated as models for the population. Methodological advantages and difficulties inherent in the alternatives are highlighted, and methods for dealing with the limitations discussed.作者: catagen 時間: 2025-3-24 23:39
Peter O. Christensen,Gerald A. Felthamoblem generators that can match the overall structure and parameter values of these problems. Of particular interest are management problems that can be modeled using a network structure. This paper discusses the design of a system for generating network-based mathematical programming test problems 作者: Commentary 時間: 2025-3-25 06:30
Introduction to Information in Marketsusually imposed through some kind of rejection technique. Recent work of Van Dam and Telgen indicates that this type of generator tends to produce geometrically atypical polvtopes. We define and construct a generator that produces . random constraint sets; that is, their probability measure is invar作者: Meager 時間: 2025-3-25 08:26 作者: pulse-pressure 時間: 2025-3-25 13:01 作者: 侵略主義 時間: 2025-3-25 18:48
What Is the Economics of Art and Culture?. The common performance measures (number of function evaluations, standardized computer time, number of problems solved) are intuitively machine independent, which encourages such use. Unfortunately, the relative performance of optimization codes does depend on the computer and compiler used for te作者: 設(shè)施 時間: 2025-3-25 21:42
Types and Causes of Child Labour,monstrate that there is statistical evidence that selected codes are superior to others on the basis of their relative solution times. A logarithmic transformation is used to produce a seminormal distribution of the solution times with a variance assumed to be equal for all of the algorithms. A pair作者: 侵害 時間: 2025-3-26 01:27
The CO2 Effect of Precious Woods,lems to be solved by this software; and (3) goals of testing..We present a methodological setup of testing nonlinear programming software which is based on prior knowledge. This leads to a discussion of the following topics: representativity of test problems, use of test problem generators, performa作者: integral 時間: 2025-3-26 07:40
https://doi.org/10.1007/978-3-319-78870-8mposite algorithm consisting of a simple tour construction algorithm and a post-processor. The five tour construction procedures considered are all insertion algorithms which may be easily implemented. The post-processor used in the five composite algorithms is a modified 3-opt procedure that is sho作者: 耕種 時間: 2025-3-26 10:19
M. J. Pearson,I. J. Bateman,G. A. Coddhms for solving multidimensional knapsack problems was implemented in three different FORTRAN programs. Starting from a straightforward program, we introduce increasingly sophisticated data structures to improve the virtual execution time of the programs. All programs were compiled with the enhanced作者: Intractable 時間: 2025-3-26 13:13
Mathematical Models of Cooperative Farmingorithm will always eventually find a solution, the important question is which combination of options is likely to be “best”. A general statistical approach to answering this question is illustrated in the context of a new integer linear programming algorithm where “best” is quickest.作者: 死貓他燒焦 時間: 2025-3-26 16:56 作者: 災(zāi)難 時間: 2025-3-26 21:42 作者: Vulnerary 時間: 2025-3-27 04:03 作者: 夜晚 時間: 2025-3-27 06:51
Happiness in the Digital World,of my closeness to the work of my former doctoral student, Eric Sandgren, it is difficult for me to be completely objective in evaluating his work. I will comment on his work in spite of this obvious bias.作者: 斜坡 時間: 2025-3-27 12:37
Robert K. Toutkoushian,Michael B. PaulsenAlgorithms of the Mathematical Programming Society has developed guidelines which present minimum standards to which all papers reporting such efforts should conform. Although guidelines now exist, the development of sound methodologies for this testing is at the embryonic stage. This paper surveys 作者: 樹上結(jié)蜜糖 時間: 2025-3-27 15:32
https://doi.org/10.1007/978-3-642-95406-1Evaluierung; Mathematical Programming; Programming; Test (EDV); optimization; strategy作者: 能得到 時間: 2025-3-27 19:09
https://doi.org/10.1007/978-1-349-06293-5Real problems are viewed as realizations from a test population of interest, and random problems are treated as models for the population. Methodological advantages and difficulties inherent in the alternatives are highlighted, and methods for dealing with the limitations discussed.作者: 偽造 時間: 2025-3-27 22:21
Mathematical Models of Cooperative Farmingorithm will always eventually find a solution, the important question is which combination of options is likely to be “best”. A general statistical approach to answering this question is illustrated in the context of a new integer linear programming algorithm where “best” is quickest.作者: 節(jié)約 時間: 2025-3-28 04:28
https://doi.org/10.1007/978-981-10-5233-0en and Ragsdell [5], and Schittkowski [7], and give some of our views on this subject. We suggest the papers by Gill and Murray [2] and Moré [4], and the book they are contained in (Fosdick [1]), as other important reading on this subject.作者: Bmd955 時間: 2025-3-28 06:52
Happiness in the Digital World,of my closeness to the work of my former doctoral student, Eric Sandgren, it is difficult for me to be completely objective in evaluating his work. I will comment on his work in spite of this obvious bias.作者: restrain 時間: 2025-3-28 13:41
Test Problems for Computational Experiments -- Issues and TechniquesReal problems are viewed as realizations from a test population of interest, and random problems are treated as models for the population. Methodological advantages and difficulties inherent in the alternatives are highlighted, and methods for dealing with the limitations discussed.作者: Mri485 時間: 2025-3-28 17:15 作者: Coronary 時間: 2025-3-28 19:38 作者: acrobat 時間: 2025-3-29 00:20 作者: strain 時間: 2025-3-29 04:37
Corruption In The Modern Arms Business: ,,In this paper we present a methodology for evaluating new integer programming algorithms -- an area of mathematical programming which is not yet well understood (see [Lin and Rardin, 1979]). We present our procedure not so much as a recommendation for others to follow but as a basis for discussion and further work.作者: Defiance 時間: 2025-3-29 09:25
Daniel S. Putler,Elizabeth FrazaoThe scope of these comments is too limited for extensive discussion concerning studies (1), (2) and (3). We shall restrict ourselves to comments concerning (1).作者: CREST 時間: 2025-3-29 12:26
An Integer Programming Test Problem GeneratorIn this paper we present a methodology for evaluating new integer programming algorithms -- an area of mathematical programming which is not yet well understood (see [Lin and Rardin, 1979]). We present our procedure not so much as a recommendation for others to follow but as a basis for discussion and further work.作者: Constitution 時間: 2025-3-29 16:59
Some Comments on Recent Computational Testing in Mathematical ProgrammingThe scope of these comments is too limited for extensive discussion concerning studies (1), (2) and (3). We shall restrict ourselves to comments concerning (1).作者: FADE 時間: 2025-3-29 20:09
978-3-540-11495-6Springer-Verlag Berlin Heidelberg 1982作者: condone 時間: 2025-3-30 00:45
Evaluating Mathematical Programming Techniques978-3-642-95406-1Series ISSN 0075-8442 Series E-ISSN 2196-9957 作者: jaunty 時間: 2025-3-30 04:15 作者: Hormones 時間: 2025-3-30 10:03 作者: BLANC 時間: 2025-3-30 13:09 作者: harpsichord 時間: 2025-3-30 17:55
M. J. Pearson,I. J. Bateman,G. A. Coddd by the compiler. Since all three programs are representations of the same algorithm, conclusions can be drawn as to the relative importance of the influence factors on program performance. As is also demonstrated, the potential performance of a representation of an abstract algorithm may be diffic作者: FOIL 時間: 2025-3-30 23:35
A Comparison of Real-World Linear Programs and Their Randomly Generated Analogsements are generated from uniform and normal distributions..The measures of difficulty include central processor time, iterations and bumps in the optimal basis. Several optimizers are used in the study. In general, the results show that the difficulty increases with the “degree of randomness” and d作者: 裹住 時間: 2025-3-31 01:11
Implementing an Algorithm: Performance Considerations and a Case Studyd by the compiler. Since all three programs are representations of the same algorithm, conclusions can be drawn as to the relative importance of the influence factors on program performance. As is also demonstrated, the potential performance of a representation of an abstract algorithm may be diffic作者: 笨拙處理 時間: 2025-3-31 06:40
The Growth of Mature Economies,952 and the implementation of the stepping-stone method on the National Bureau of Standards’ Eastern Automatic Computer (Hoffman [4]), it has only been recently recognized as a major discipline in its own right.作者: 千篇一律 時間: 2025-3-31 10:52 作者: frenzy 時間: 2025-3-31 15:09
William M. Henghold,Steve R. LeClairpecified characteristics which usually affect the success of algorithms and their related software. In particular, it is shown how test problems with given multiple stationary pointscan be constructed, allowing for programs with several local optima thus providing for more rigorous testing.作者: 和諧 時間: 2025-3-31 18:09
Information Trading Market Model, used, their views on the good and bad points in the study, and their suggestions for future studies. Following these presentations members of the panel, who have been selectedso as to cover a wide range of opinions on the subject, will comment on the points that have been made. The discussion will then be open to the general audience.作者: Obstruction 時間: 2025-3-31 23:20 作者: 歡騰 時間: 2025-4-1 04:55
Evidence of Fundamental Difficulties in Nonlinear Optimization Code Comparisonskload) when the tests are run. Numerical evidence of these difficulties is presented, based on tests of the same problem and algorithm decks on several different computers, with various compilers, problem sets, accuracy levels, and performance measures.作者: Overthrow 時間: 2025-4-1 09:00
A Methodological Approach to Testing of NLP-Softwarence measures, presentation of test results, and presentation of final conclusions..The concepts will be illustrated with a project which has been performed to evaluate a set of Newton-like methods for solving systems of nonlinear equations.作者: 拋射物 時間: 2025-4-1 11:22 作者: 組裝 時間: 2025-4-1 15:00 作者: 建筑師 時間: 2025-4-1 19:58 作者: arcane 時間: 2025-4-2 00:24
