版权说明 操作指南
首页 > 成果 > 详情

The programming of Olympian' transporting player routes

认领
导出
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Mei, Suo*;Wu, Shixun;Zhao, Dongfang
通讯作者:
Mei, Suo
作者机构:
[Mei, Suo; Zhao, Dongfang; Wu, Shixun] Huazhong Normal Univ, Inst Math & Stat, Wuhan 430079, Peoples R China.
通讯机构:
[Mei, Suo] H
Huazhong Normal Univ, Inst Math & Stat, Wuhan 430079, Peoples R China.
语种:
英文
关键词:
Greedy Algorithms;Pareto optimal solution;algorithms time complexity;mixed integer programming
期刊:
PROCEEDINGS OF FIRST INTERNATIONAL CONFERENCE OF MODELLING AND SIMULATION, VOL II: MATHEMATICAL MODELLING
年:
2008
页码:
359-362
机构署名:
本校为第一且通讯机构
院系归属:
数学与统计学学院
摘要:
Our paper mainly discusses the order of Beijing Olympic Games arrange bus to transport Olympian to every gym, in order to spend time as short as possible to finish a circle for next time transporting. First of all, our paper based on Matlab, using Greedy Algorithms figure out this problem and get the problem's Pareto optimal solution. Next, we set up a mixed integer programming model in Lingo as another scheme for the optimal solution. In the end, we compare the two models with algorithms time co...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com