首页 | 本学科首页   官方微博 | 高级检索  
     检索      

A Heuristic Method for Some NP-hard Robust Combinatorial Optimization Problems
作者姓名:YANG Xiao\|guang\ \ \ ZHU Qing\ .Laboratory of Management  Decision and Information Systems Institute of Systems Science  Academia Sinica  Beijing  China .
作者单位:YANG Xiao\|guang\ 1\ \ ZHU Qing\ 2 1.Laboratory of Management,Decision and Information Systems Institute of Systems Science,Academia Sinica,Beijing 100080,China 2.Department of Mathematics,Anhui University,Hefei 230039,China
基金项目:Research is supported by the National 863 Program ( No.863- 306- Z T
摘    要:1 IntroductionGenerally,anoptimizationproblemcanbewrittenasthefollowingform(P)  zp=minx∈Xf(x),(1)WhereXisthesetoffeasiblesolutions,andf(x)istheobjectivefunction.Butintherealworld,duetotheuncertaintyofthefuture,theinputdataoftheobjectivefunctionf(x)d…


A Heuristic Method for Some NP\|hard Robust Combinatorial Optimization Problems
YANG Xiao\|guang\ \ \ ZHU Qing\ .Laboratory of Management,Decision and Information Systems Institute of Systems Science,Academia Sinica,Beijing ,China ..A Heuristic Method for Some NP-hard Robust Combinatorial Optimization Problems[J].Journal of Systems Science and Systems Engineering,1999(3).
Authors:YANG Xiao\|guang\ \ \ ZHU Qing\ Laboratory of Management  Decision and Information Systems Institute of Systems Science  Academia Sinica  Beijing  China
Institution:YANG Xiao\|guang\ 1\ \ ZHU Qing\ 2 1.Laboratory of Management,Decision and Information Systems Institute of Systems Science,Academia Sinica,Beijing 100080,China 2.Department of Mathematics,Anhui University,Hefei 230039,China
Abstract:
Keywords:robust combinatorial optimization  NP\|hard  heuristic method  implementation
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号