.png){kind=icon}
返回
LAGRANGEAN HEURISTICS FOR LOCATION-PROBLEMS
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(93)90118-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we present a framework for developing Lagrangean heuristics (heuristics based upon Lagrangean relaxation and subgradient optimisation) with respect to location problems. Computational results are given for four different location problems: p-median, uncapacitated warehouse location, capacitated warehouse location and capacitated warehouse location with single source constraints. These results indicate that the framework presented in this paper is robust, i.e. it gives good quality solutions for each of these different location problems.
Keyword:
LAGRANGEAN HEURISTIC
LOCATION
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
分享收藏分享收藏
查看更多内容