Improved approaches to solve the One-To-One SkewGraM problem

被引:0
|
作者
Sidi, Mohamed Lemine Ahmed [1 ,2 ,3 ,4 ]
Bocquillon, Ronan [1 ]
Babou, Hafedh Mohamed [2 ,4 ]
Dhib, Cheikh [2 ,3 ]
Neron, Emmanuel [1 ]
Soukhal, Ameur [1 ]
Nanne, Mohamedade Farouk [2 ]
机构
[1] Polytech Tours, Lab Informat Fondamentale & Appl Tours, LIFAT EA 6300, Root ERL CNRS 7002, 64 Ave Jean Port, F-37200 Tours, France
[2] Univ Nouakchott Al Asriya, Unite Rech Calcul Sci Informat & Data Sci, Nouakchott, Mauritania
[3] Inst Super Comptabilite & Adm Entreprises, Unite Rech Pluridisciplinaire Informat & Math App, Nouakchott, Mauritania
[4] Ecole Super Polytech Nouakchott, Unite Rech Intelligence Artificielle, Nouakchott, Mauritania
关键词
Operational research; Bioinformatics; Comparison of biological networks; Linear programming; Branch-and-bound; LONGEST COMMON SUBSEQUENCE; ALGORITHM;
D O I
10.1016/j.cor.2021.105584
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Network comparison is an essential issue in the analysis of biological, social, and communication networks, and recent network comparisons have required the simultaneous mining of several networks on a similar vertex set. In this work, we study the case where the input consists of a directed acyclic graph D and an undirected graph G on the same vertex set. The goal is then to find the longest path P in D whose vertices induce a connected subgraph of G. This problem is known to be NP-hard and has immediate applications in the analysis of biological networks and foreseeable applications in the analysis of social, information, and communication networks. We propose hereinafter improvements to an existing branch-and-bound method and different resolution approaches based on Integer Linear Programming. We also experimentally evaluate both simulated and real data.
引用
收藏
页数:8
相关论文
共 50 条
  • [1] One-to-one
    Anon
    Cargo Systems, 2001, 28 (05):
  • [2] One-to-one
    Wang, F.
    Cargo Systems, 2001, 28 (07):
  • [3] One-to-one
    Anon
    Cargo Systems, 2001, 28 (04):
  • [4] ONE-TO-ONE
    de Arce, Rodrigo Perez
    ARQ, 2016, (93): : 80 - 83
  • [5] One-to-one
    Reinhold, M.
    Cargo Systems, 2001, 28 (09):
  • [6] ONE-TO-ONE
    LEVY, G
    PHI DELTA KAPPAN, 1981, 62 (06) : 422 - 423
  • [7] The Generalized One-to-One Pickup and Delivery Vehicle Routing Problem
    Yilmaz, Nurah
    Karaoglan, Ismail
    ADVANCES IN PRODUCTION MANAGEMENT SYSTEMS-PRODUCTION MANAGEMENT SYSTEMS FOR VOLATILE, UNCERTAIN, COMPLEX, AND AMBIGUOUS ENVIRONMENTS, APMS 2024, PT VI, 2024, 733 : 291 - 306
  • [8] Going one-to-one
    Warschauer, M
    EDUCATIONAL LEADERSHIP, 2005, 63 (04) : 34 - 38
  • [9] Combining VNS with Genetic Algorithm to solve the one-to-one routing issue in road networks
    Dib, Omar
    Manier, Marie-Ange
    Moalic, Laurent
    Caminada, Alexandre
    COMPUTERS & OPERATIONS RESEARCH, 2017, 78 : 420 - 430
  • [10] ONE-TO-ONE MAPPINGS
    PETTEY, DH
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1970, 17 (03): : 579 - &