找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Evaluating Mathematical Programming Techniques; Proceedings of a Con John M. Mulvey Conference proceedings 1982 Springer-Verlag Berlin Heid

[复制链接]
查看: 44762|回复: 65
发表于 2025-3-21 18:39:16 | 显示全部楼层 |阅读模式
书目名称Evaluating Mathematical Programming Techniques
副标题Proceedings of a Con
编辑John M. Mulvey
视频video
丛书名称Lecture Notes in Economics and Mathematical Systems
图书封面Titlebook: Evaluating Mathematical Programming Techniques; Proceedings of a Con John M. Mulvey Conference proceedings 1982 Springer-Verlag Berlin Heid
出版日期Conference proceedings 1982
关键词Evaluierung; Mathematical Programming; Programming; Test (EDV); optimization; strategy
版次1
doihttps://doi.org/10.1007/978-3-642-95406-1
isbn_softcover978-3-540-11495-6
isbn_ebook978-3-642-95406-1Series ISSN 0075-8442 Series E-ISSN 2196-9957
issn_series 0075-8442
copyrightSpringer-Verlag Berlin Heidelberg 1982
The information of publication is updating

书目名称Evaluating Mathematical Programming Techniques影响因子(影响力)




书目名称Evaluating Mathematical Programming Techniques影响因子(影响力)学科排名




书目名称Evaluating Mathematical Programming Techniques网络公开度




书目名称Evaluating Mathematical Programming Techniques网络公开度学科排名




书目名称Evaluating Mathematical Programming Techniques被引频次




书目名称Evaluating Mathematical Programming Techniques被引频次学科排名




书目名称Evaluating Mathematical Programming Techniques年度引用




书目名称Evaluating Mathematical Programming Techniques年度引用学科排名




书目名称Evaluating Mathematical Programming Techniques读者反馈




书目名称Evaluating Mathematical Programming Techniques读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:56:20 | 显示全部楼层
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.
发表于 2025-3-22 03:57:42 | 显示全部楼层
发表于 2025-3-22 08:07:35 | 显示全部楼层
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:09 | 显示全部楼层
发表于 2025-3-22 15:43:57 | 显示全部楼层
发表于 2025-3-22 17:51:08 | 显示全部楼层
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: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:52 | 显示全部楼层
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
发表于 2025-3-23 07:39:41 | 显示全部楼层
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
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-2 11:30
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表