LP EXTREME-POINTS AND CUTS FOR THE FIXED-CHARGE NETWORK DESIGN PROBLEM

被引：9

|

作者：

BALAKRISHNAN, A

机构：

来源：

MATHEMATICAL PROGRAMMING | 1987年 / 39卷 / 03期

关键词：

D O I：

10.1007/BF02592077

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：263 / 284

页数：22

相关论文

共 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] New models of the generalized fixed-charge network design problem
Pop, Petrica C.
Sitar, Corina Pop
CARPATHIAN JOURNAL OF MATHEMATICS, 2012, 28 (01) : 143 - 150
[4] EXTREME-POINTS FOR POSITIVE FORMS ON LP
DRURY, SW
LINEAR ALGEBRA AND ITS APPLICATIONS, 1987, 97 : 219 - 228
[5] 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
[6] 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):
[7] 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
[8] STRONGLY EXTREME-POINTS IN LP(MU, X)
SMITH, MA
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS, 1986, 16 (01) : 1 - 5
[9] 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
[10] MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem
Katayama, Naoto
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2020, 37 (03)

← 1 2 3 4 5 →