.png){kind=icon}
返回
Relax-and-fix decomposition technique for solving large scale grid-based location problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2012.07.006.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Many problems in business, engineering, defence, resource exploitation, and even the medical sciences with location aspects can be expressed as grid-based location problems (GBLPs), modeled as integer linear programming problems. Such problems are often very computationally complex to solve. We develop a relax-and-fix-based decomposition approach to solve large-scale GBLPs, which we demonstrate will significantly reduce solution runtimes while not severely impacting optimality. We also introduce problem-specific logical restrictions, constraints that reduce the feasible region and the resulting branch-and-bound tree with minimal reductions in optimality. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Linear programming
Location analysis
Integer programming
Decomposition techniques
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
分享收藏Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants放松和修正启发式方法，以解决小型软饮料厂的一阶段一机批量调度模型
OAAI
OAAI分享收藏Solving large-scale maximum expected covering location problems by genetic algorithms: A comparative study用遗传算法求解大规模最大期望覆盖选址问题的比较研究
PREAI
分享收藏
查看更多内容