Solving to optimality the uncapacitated fixed-charge network flow problem

被引：0
|
作者：
Cruz, F.R.B. [1 ]
Smith, J.MacGregor [1 ]
Mateus, G.R. [1 ]
机构：
[1] Pontificia Universidade Catolica de, Minas Gerais, MG, Brazil
来源：
Computers and Operations Research | 1998年 / 25卷 / 01期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：67 / 81
相关论文
共 50 条
  • [31] A fast and simple branching algorithm for solving small scale fixed-charge transportation problem
    Kowalski, Krzysztof
    Lev, Benjamin
    Shen, Wenjing
    Tu, Yan
    OPERATIONS RESEARCH PERSPECTIVES, 2014, 1 (01) : 1 - 5
  • [32] Solving the two-stage fixed-charge transportation problem with a hybrid genetic algorithm
    Pop, Petrica C.
    Sabo, Cosmin
    Biesinger, Benjamin
    Hu, Bin
    Raid, Guenther R.
    CARPATHIAN JOURNAL OF MATHEMATICS, 2017, 33 (03) : 365 - 371
  • [33] The Fixed-Charge Shortest-Path Problem
    Engineer, Faramroze G.
    Nemhauser, George L.
    Savelsbergh, Martin W. P.
    Song, Jin-Hwa
    INFORMS JOURNAL ON COMPUTING, 2012, 24 (04) : 578 - 596
  • [34] Solving fixed-charge transportation problem using a modified particle swarm optimization algorithm
    Gurwinder Singh
    Amarinder Singh
    International Journal of System Assurance Engineering and Management, 2021, 12 : 1073 - 1086
  • [35] Commodity family extended formulations of uncapacitated fixed charge network flow problems
    Ng, PH
    Rardin, RL
    NETWORKS, 1997, 30 (01) : 57 - 71
  • [36] Heuristic algorithms for the fixed-charge transportation problem
    Veena Adlakha
    Krzysztof Kowalski
    R. R. Vemuganti
    OPSEARCH, 2006, 43 (2) : 132 - 151
  • [37] LOT SIZING AS A FIXED-CHARGE PROBLEM.
    Bahl, Harish C.
    Zionts, Stanley
    Production and inventory management Washington, D.C., 1986, 27 (01): : 1 - 11
  • [38] Solving fixed-charge transportation problem using a modified particle swarm optimization algorithm
    Singh, Gurwinder
    Singh, Amarinder
    INTERNATIONAL JOURNAL OF SYSTEM ASSURANCE ENGINEERING AND MANAGEMENT, 2021, 12 (06) : 1073 - 1086
  • [39] LP EXTREME-POINTS AND CUTS FOR THE FIXED-CHARGE NETWORK DESIGN PROBLEM
    BALAKRISHNAN, A
    MATHEMATICAL PROGRAMMING, 1987, 39 (03) : 263 - 284
  • [40] 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
12345