Cut Generation Algorithm for the Discrete Competitive Facility Location Problem

被引：0
|
作者：
V. L. Beresnev
A. A. Melnikov
机构：
[1] Russian Academy of Sciences,Sobolev Institute of Mathematics, Siberian Branch
[2] Novosibirsk State University,undefined
来源：
Doklady Mathematics | 2018年 / 97卷
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A competitive facility location model formulated as a bilevel programming problem is considered. A new approach to the construction of estimating problems for bilevel competitive location models is proposed. An iterative algorithm for solving a series of mixed integer programming problems to obtain a pessimistic optimal solution of the model under consideration is suggested.
引用
收藏
页码：254 / 257
页数：3
相关论文
共 50 条
  • [1] Cut Generation Algorithm for the Discrete Competitive Facility Location Problem
    Beresnev, V. L.
    Melnikov, A. A.
    [J]. DOKLADY MATHEMATICS, 2018, 97 (03) : 254 - 257
  • [2] Computational complexity of the discrete competitive facility location problem
    Mel’nikov A.A.
    [J]. Journal of Applied and Industrial Mathematics, 2014, 8 (04) : 557 - 567
  • [3] Randomized local search for the discrete competitive facility location problem
    Mel'nikov, A. A.
    [J]. AUTOMATION AND REMOTE CONTROL, 2014, 75 (04) : 700 - 714
  • [4] Solution of Discrete Competitive Facility Location Problem for Firm Expansion
    Lancinskas, Algirdas
    Fernandez, Pascual
    Pelegrin, Blas
    Zilinskas, Julius
    [J]. INFORMATICA, 2016, 27 (02) : 451 - 462
  • [5] Randomized local search for the discrete competitive facility location problem
    A. A. Mel’nikov
    [J]. Automation and Remote Control, 2014, 75 : 700 - 714
  • [6] Sensitivity Analysis of a Genetic Algorithm for a Competitive Facility Location Problem
    Pangilinan, Jose Maria A.
    Janssens, Gerrit K.
    Caris, An
    [J]. INNOVATIONS AND ADVANCED TECHNIQUES IN SYSTEMS, COMPUTING SCIENCES AND SOFTWARE ENGINEERING, 2008, : 266 - +
  • [7] Branch-and-bound algorithm for a competitive facility location problem
    Beresnev, Vladimir
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (08) : 2062 - 2070
  • [8] A Randomized -Competitive Algorithm for the Online Connected Facility Location Problem
    San Felice, Mario Cesar
    Williamson, David P.
    Lee, Orlando
    [J]. ALGORITHMICA, 2016, 76 (04) : 1139 - 1157
  • [9] An approximation algorithm for a competitive facility location problem with network effects
    Kung, Ling-Chieh
    Liao, Wei-Hung
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 267 (01) : 176 - 186
  • [10] Combined Simulated Annealing Algorithm for the Discrete Facility Location Problem
    Qin, Jin
    Ni, Ling-lin
    Shi, Feng
    [J]. SCIENTIFIC WORLD JOURNAL, 2012,
12345