An exact approach to the problem of extracting an embedded network matrix

被引：8
|
作者：
Figueiredo, Rosa M. V. [1 ,2 ]
Labbe, Martine [3 ]
de Souza, Cid C. [4 ]
机构：
[1] Univ Aveiro, Dept Math, P-3810193 Aveiro, Portugal
[2] Univ Estado Rio De Janeiro, Inst Math & Stat, BR-20550900 Rio De Janeiro, Brazil
[3] Univ Libre Bruxelles, Dept Comp Sci, B-1050 Brussels, Belgium
[4] Univ Estadual Campinas, Inst Comp, BR-13083852 Campinas, SP, Brazil
来源：
COMPUTERS & OPERATIONS RESEARCH | 2011年 / 38卷 / 11期
关键词：
Network matrix; Signed graph; Facets of polyhedra; Branch-and-cut; LINEAR-PROGRAMS; SIGNED GRAPHS; ALGORITHM; POLYTOPE; PACKING; ROWS;
D O I：
10.1016/j.cor.2011.01.003
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
We study the problem of detecting a maximum embedded network submatrix in a (-1,0,+1)-matrix. Our aim is to solve the problem to optimality. We introduce a 0-1 integer linear programming formulation for this problem based on its representation over a signed graph. A polyhedral study is presented and a branch-and-cut algorithm is described for finding an optimal solution to the problem. Some computational experiments are carried out over a set of instances available in the literature as well as over a set of random instances. (C) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码：1483 / 1492
页数：10
相关论文
共 50 条
  • [1] Enhanced Exact Approach for the Network Loading Problem
    Mejri, Imen
    Layeb, Safa Bhar
    Mansour, Farah Zeghal
    2019 6TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT 2019), 2019, : 970 - 975
  • [2] An exact approach for the service network design problem with heterogeneous resource constraints
    Li, Xiangyong
    Wei, Kai
    Guo, Zhaoxia
    Wang, Wei
    Aneja, Y. P.
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2021, 102
  • [3] An exact approach for the multicommodity network optimization problem with a step cost function
    Mejri, Imen
    Haouari, Mohamed
    Layeb, Safa Bhar
    Mansour, Farah Zeghal
    RAIRO-OPERATIONS RESEARCH, 2019, 53 (04) : 1279 - 1295
  • [4] Extracting a polynomial embedded in a pair of polynomials, with application to an inverse problem
    Kulkarni, Raghavendra G.
    INVERSE PROBLEMS IN SCIENCE AND ENGINEERING, 2015, 23 (04) : 590 - 600
  • [5] An exact algorithm for the network pricing problem
    Brotcorne, L.
    Cirinei, F.
    Marcotte, P.
    Savard, G.
    DISCRETE OPTIMIZATION, 2011, 8 (02) : 246 - 258
  • [6] INTEGER EXACT NETWORK SYNTHESIS PROBLEM
    Kabadi, S. N.
    Yan, J.
    Du, D.
    Nair, K. P. K.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2008, 23 (01) : 136 - 154
  • [7] An Exact Algorithm for the Network Synthesis Problem
    Han, Jun
    Lei, Ming
    Wei, Xin
    Huang, Yaling
    2009 2ND IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY, VOL 2, 2009, : 302 - +
  • [8] Exact stiffness matrix for nonlocal bars embedded in elastic foundation media: the virtual-force approach
    Limkatanyu, Suchart
    Prachasaree, Woraphot
    Damrongwiriyanupap, Nattapong
    Kwon, Minho
    JOURNAL OF ENGINEERING MATHEMATICS, 2014, 89 (01) : 163 - 176
  • [9] Exact stiffness matrix for nonlocal bars embedded in elastic foundation media: the virtual-force approach
    Suchart Limkatanyu
    Woraphot Prachasaree
    Nattapong Damrongwiriyanupap
    Minho Kwon
    Journal of Engineering Mathematics, 2014, 89 : 163 - 176
  • [10] An exact approach for the Blocks Relocation Problem
    Exposito-Izquierdo, Christopher
    Melian-Batista, Belen
    Marcos Moreno-Vega, J.
    EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (17-18) : 6408 - 6422
12345