返回
Algorithms for a multi-level network optimization problem
DOI:10.1016/S0377-2217(98)00306-3.png)
摘要
En 中文
In this paper we work on a multi-level network optimization problem that integrates into the same model important aspects of: (i) discrete facility location, (ii) topological network design, and (iii) network dimensioning. Potential applications for the model are discussed, stressing its growing importance. The multi-level network optimization problem treated is defined and a mathematical programming formulation is presented. We make use of a branch-and-bound algorithm based on Lagrangean relaxation lower bounds to introduce some new powerful auxiliary algorithms to exactly solve the problem. We conduct a set of computational experiments that indicate the quality of the proposed approach. (C) 1999 Elsevier Science B.V. All rights reserved.
Keyword:
branch-and-bound
network programming
location
topological network design
network flows
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Adsorption of Cu(II), Pb(II), and Cd(II) Ions from Acidic Aqueous Solutions by Diethylenetriaminepentaacetic Acid-Modified Magnetic Graphene Oxide二乙烯三胺五乙酸改性的磁性氧化石墨烯对酸性水溶液中Cu(II),Pb(II) 和Cd(II) 离子的吸附

