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 条
  • [21] An Exact Approach for the Combined Cell Layout Problem
    Hungerlaender, Philipp
    Anjos, Miguel F.
    OPERATIONS RESEARCH PROCEEDINGS 2012, 2014, : 275 - 281
  • [22] An Approach to the Exact Packed String Matching Problem
    Olson, Michael
    Davis, Daniel
    Lee, Jae Woong
    2020 4TH INTERNATIONAL CONFERENCE ON NATURAL LANGUAGE PROCESSING AND INFORMATION RETRIEVAL, NLPIR 2020, 2020, : 173 - 178
  • [23] A Comprehensive Approach to Extracting Coupling Matrix From Filtenna Measurements
    Javadi, Sara
    Rezaee, Behrooz
    Stadler, Manfred
    Leitner, Michael
    Boesch, Wolfgang
    2024 IEEE 24TH TOPICAL MEETING ON SILICON MONOLITHIC INTEGRATED CIRCUITS IN RF SYSTEMS, SIRF, 2024, : 102 - 105
  • [24] An Approach for Extracting Exact Answers to Question Answering (QA) System for English Sentences
    Barskar, Raju
    Ahmed, Gulfishan Firdose
    Barskar, Nepal
    INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY AND SYSTEM DESIGN 2011, 2012, 30 : 1187 - 1194
  • [25] The minimum Manhattan network problem: Approximations and exact solutions
    Benkert, Marc
    Wolff, Alexander
    Widmann, Florian
    Shirabe, Takeshi
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2006, 35 (03): : 188 - 208
  • [26] AN EXACT TENSOR NETWORK FOR THE 3SAT PROBLEM
    Garcia-Saez, Artur
    Latorre, Jose I.
    QUANTUM INFORMATION & COMPUTATION, 2012, 12 (3-4) : 283 - 292
  • [27] Exact approaches for the directed network design problem with relays
    Leitner, Markus
    Ljubic, Ivana
    Riedler, Martin
    Ruthmair, Mario
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2020, 91
  • [28] Network congestion games with player failures for charging problem of EVs via matrix approach
    Liu, Shuqi
    Ma, Lijun
    Wang, Jinhuan
    ASIAN JOURNAL OF CONTROL, 2025,
  • [29] An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing
    Pinto, Leizer L.
    Fernandes, Katia C. C.
    Cardoso, Kleber V.
    Maculan, Nelson
    COMPUTERS & OPERATIONS RESEARCH, 2019, 106 : 28 - 35
  • [30] An Exact and Near-Exact Distribution Approach to the Behrens-Fisher Problem
    Hong, Serim
    Coelho, Carlos A.
    Park, Junyong
    MATHEMATICS, 2022, 10 (16)
12345