QQ客服 官方微博 反馈留言

	Inverse Max + Sum spanning tree problem by modifying the sum-cost vector under weighted l∞Norm (EI收录SCI收录)
	Guan, Xiucui[1,2]; Pardalos, Panos M.[2]; Zuo, Xia[3]
刊名	Journal of Global Optimization
	2015
卷号	61页码:165-182
关键词	Inverse max?+?sum spanning tree problem Inverse optimization problem $$l_\infty $$l∞ norm Linear fractional combinatorial optimization Discrete type Newton method
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2211966
专题	华南理工大学
作者单位	1.[1] Department of Mathematics, Southeast University, Nanjing 2.210096, China 3.[2] Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, Gainesville 4.FL, United States 5.[3] Jiandong College of Vocational Technology, Changzhou 6.213022, China
推荐引用方式 GB/T 7714	Guan, Xiucui[1,2],Pardalos, Panos M.[2],Zuo, Xia[3]. Inverse Max + Sum spanning tree problem by modifying the sum-cost vector under weighted l∞Norm (EI收录SCI收录)[J]. Journal of Global Optimization,2015,61:165-182.
APA	Guan, Xiucui[1,2],Pardalos, Panos M.[2],&Zuo, Xia[3].(2015).Inverse Max + Sum spanning tree problem by modifying the sum-cost vector under weighted l∞Norm (EI收录SCI收录).Journal of Global Optimization,61,165-182.
MLA	Guan, Xiucui[1,2],et al."Inverse Max + Sum spanning tree problem by modifying the sum-cost vector under weighted l∞Norm (EI收录SCI收录)".Journal of Global Optimization 61(2015):165-182.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。