New models of the generalized fixed-charge network design problem

被引：0
|
作者：
Pop, Petrica C. [1 ]
Sitar, Corina Pop [2 ]
机构：
[1] N Univ Baia Mare, Dept Math & Comp Sci, Baia Mare 430122, Romania
[2] Acad Romana, Iasi Branch, Bucharest, Romania
来源：
CARPATHIAN JOURNAL OF MATHEMATICS | 2012年 / 28卷 / 01期
关键词：
Network design; generalized fixed-charge network design problem; integer programming; TRAVELING SALESMAN PROBLEM; SPANNING TREE PROBLEM;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We consider in this paper the generalized fixed-charge network design (GFCND) problem in which we are interested to find the cheapest backbone network connecting exactly one hub from each of the given clusters. The GFCND problem belongs to the class of generalized combinatorial optimization problems. We describe two mixed integer programming formulations of the GFCND problem. Based on one of the new proposed formulations, we solve the GFCND problem to optimality using CPLEX for problems with up to 30 clusters and 200 nodes. Computational results are reported and compared with those from the literature.
引用
收藏
页码：143 / 150
页数：8
相关论文
共 50 条
12345