找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 44820|回復(fù): 65
樓主
發(fā)表于 2025-3-21 18:39:16 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Evaluating Mathematical Programming Techniques
副標(biāo)題Proceedings of a Con
編輯John M. Mulvey
視頻videohttp://file.papertrans.cn/318/317226/317226.mp4
叢書名稱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
關(guān)鍵詞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影響因子(影響力)學(xué)科排名




書目名稱Evaluating Mathematical Programming Techniques網(wǎng)絡(luò)公開度




書目名稱Evaluating Mathematical Programming Techniques網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Evaluating Mathematical Programming Techniques被引頻次




書目名稱Evaluating Mathematical Programming Techniques被引頻次學(xué)科排名




書目名稱Evaluating Mathematical Programming Techniques年度引用




書目名稱Evaluating Mathematical Programming Techniques年度引用學(xué)科排名




書目名稱Evaluating Mathematical Programming Techniques讀者反饋




書目名稱Evaluating Mathematical Programming Techniques讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 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.
板凳
發(fā)表于 2025-3-22 03:57:42 | 只看該作者
地板
發(fā)表于 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
5#
發(fā)表于 2025-3-22 12:44:09 | 只看該作者
6#
發(fā)表于 2025-3-22 15:43:57 | 只看該作者
7#
發(fā)表于 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
8#
發(fā)表于 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
9#
發(fā)表于 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
10#
發(fā)表于 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
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-13 21:43
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
榕江县| 郯城县| 安新县| 收藏| 咸阳市| 宝坻区| 瓮安县| 湖北省| 肥城市| 原平市| 景东| 琼中| 东港市| 商河县| 大庆市| 岑溪市| 当雄县| 云南省| 普宁市| 菏泽市| 南昌县| 民县| 淮阳县| 海宁市| 突泉县| 吐鲁番市| 昭苏县| 和林格尔县| 抚远县| 乡宁县| 镇远县| 将乐县| 海淀区| 板桥市| 平阴县| 南澳县| 宁陵县| 繁峙县| 柳林县| 宽甸| 桦南县|