@prefix dcat: <http://www.w3.org/ns/dcat#> .
@prefix dct: <http://purl.org/dc/terms/> .
@prefix foaf: <http://xmlns.com/foaf/0.1/> .
@prefix vcard: <http://www.w3.org/2006/vcard/ns#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00874354v1> a dcat:Dataset ;
    dct:description """
              Given a weighted undirected graph G with a set of pairs of terminals {si, ti}, i = 1, ..., d, and an integer L ≥ 2, the two node-disjoint hop-constrained survivable network design problem (TNHNDP) is to find a minimum weight subgraph of G such that between every si and ti there exist at least two node-disjoint paths of length at most L. This problem has applications to the design of survivable telecommunications networks with QoS-constraints. We discuss this problem from a polyhedral point of view. We present several classes of valid inequalities along with necessary and/or sufficient conditions for these inequalities to be facet defining. We also discuss separation routines for these classes of inequalities. Using this, we propose a Branch-and-Cut algorithm for the problem when L = 3, and present some computational results.
            """ ;
    dct:identifier "hal-00874354" ;
    dct:issued "2026-05-09T08:08:11.981233"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-05-09T08:08:11.981238"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "Two Node-Disjoint Hop-Constrained Survivable Network Design and Polyhedra" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00874354v1/resource/1cd9d647-4cb2-45b6-8d41-6a58583766f6> ;
    dcat:keyword "branch-and-cut",
        "facet",
        "hop-constraint",
        "infoeu-reposemanticspreprint",
        "infoinfo-cecomputer-science-cscomputational-engineering-finance-and-science-csce",
        "infoinfo-rocomputer-science-csoperations-research-mathoc",
        "node-disjoint-paths",
        "polyhedron",
        "preprints-working-papers-",
        "survivable-network" ;
    dcat:landingPage <https://hal.science/hal-00874354> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00874354v1/resource/1cd9d647-4cb2-45b6-8d41-6a58583766f6> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-09T08:08:11.997806"^^xsd:dateTime ;
    dct:modified "2026-05-09T08:08:11.968480"^^xsd:dateTime ;
    dct:title "Two Node-Disjoint Hop-Constrained Survivable Network Design and Polyhedra" ;
    dcat:accessURL <https://hal.science/hal-00874354> .

<https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> a foaf:Agent ;
    foaf:name "test_moissonnage_selune" .

<https://hal.science/hal-00874354> a foaf:Document .