QQ客服 官方微博 反馈留言

	The K-connection location problem in a plane
	Simin Huang ; Batta, R. ; Klamroth, K. ; Nagi, R.
	2010-05-10 ; 2010-05-10
关键词	Theoretical or Mathematical/ facilities layout facility location/ K-connection location problem facility location polyhedral gauges heuristic algorithms shortest path flow connection links pairs/ C1290 Applications of systems theory E1540 Systems theory applications
中文摘要	This paper determines the optimal location of K connections in the plane, where a connection links pairs of existing facilities. Both uncapacitated and capacitated versions of the problem are considered. Discretization results for general polyhedral gauges and other properties are established. Two heuristic algorithms are developed for each case using the concept of a shortest path flow set coupled with a sequential location and allocation approach. Computational results show that the algorithms are efficient and accurate.
语种	英语 ; 英语
出版者	Kluwer Academic Publishers ; Netherlands
内容类型	期刊论文
源URL	[http://hdl.handle.net/123456789/23657]
专题	清华大学
推荐引用方式 GB/T 7714	Simin Huang,Batta, R.,Klamroth, K.,et al. The K-connection location problem in a plane[J],2010, 2010.
APA	Simin Huang,Batta, R.,Klamroth, K.,&Nagi, R..(2010).The K-connection location problem in a plane..
MLA	Simin Huang,et al."The K-connection location problem in a plane".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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