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 条

[1] The generalized fixed-charge network design problem
Thomadsen, Tommy
Stidsen, Thomas
COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (04) : 997 - 1007
[2] An Efficient Matheuristic for the Multicommodity Fixed-Charge Network Design Problem
Gendron, Bernard
Hanafi, Said
Todosijevic, Raca
IFAC PAPERSONLINE, 2016, 49 (12): : 117 - 120
[3] A local branching heuristic for the capacitated fixed-charge network design problem
Rodriguez-Martin, Inmaculada
Salazar-Gonzalez, Juan Jose
COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (03) : 575 - 581
[4] A dual ascent approach to the fixed-charge capacitated network design problem
Institute for Systems Research, University of Maryland, College Park, MD 20742, United States
不详
不详
Eur J Oper Res, 3 (476-490):
[5] A dual ascent approach to the fixed-charge capacitated network design problem
Herrmann, JW
Ioannou, G
Minis, I
Proth, JM
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 95 (03) : 476 - 490
[6] New partial aggregations for multicommodity network flow problems: An application to the fixed-charge network design problem
Kazemi, Ahmad
Le Bodic, Pierre
Ernst, Andreas T.
Krishnamoorthy, Mohan
COMPUTERS & OPERATIONS RESEARCH, 2021, 136
[7] LP EXTREME-POINTS AND CUTS FOR THE FIXED-CHARGE NETWORK DESIGN PROBLEM
BALAKRISHNAN, A
MATHEMATICAL PROGRAMMING, 1987, 39 (03) : 263 - 284
[8] Benders-and-cut algorithm for fixed-charge capacitated network design problem
Sridhar, V
Park, JS
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 125 (03) : 622 - 632
[9] MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem
Katayama, Naoto
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2020, 37 (03)
[10] FRACTIONAL FIXED-CHARGE PROBLEM
ALMOGY, Y
LEVIN, O
NAVAL RESEARCH LOGISTICS QUARTERLY, 1971, 18 (03): : 307 - &

← 1 2 3 4 5 →