<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-00678058</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-03T09:47:59+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut</title>
            <author role="aut">
              <persName>
                <forename type="first">Fatiha</forename>
                <surname>Bendali</surname>
              </persName>
              <email type="md5">20c8740a821690a4bfae2a2891f9bcda</email>
              <email type="domain">isima.fr</email>
              <idno type="idhal" notation="string">fatiha-bendali</idno>
              <idno type="idhal" notation="numeric">172499</idno>
              <idno type="halauthorid" notation="string">14981-172499</idno>
              <idno type="IDREF">https://www.idref.fr/161965954</idno>
              <affiliation ref="#struct-857"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Ibrahima</forename>
                <surname>Diarrassouba</surname>
              </persName>
              <email type="md5">8bd0a772beb7c72386aa43e8ce11e914</email>
              <email type="domain">univ-lehavre.fr</email>
              <idno type="idhal" notation="string">ibrahima-diarrassouba</idno>
              <idno type="idhal" notation="numeric">745402</idno>
              <idno type="halauthorid" notation="string">14680-745402</idno>
              <idno type="IDREF">https://www.idref.fr/142386359</idno>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Mohamed</forename>
                <surname>Didi Biha</surname>
              </persName>
              <email type="md5">92b3a693d9be8828b655dbde67283662</email>
              <email type="domain">unicaen.fr</email>
              <idno type="idhal" notation="string">mohamed-didi-biha</idno>
              <idno type="idhal" notation="numeric">175567</idno>
              <idno type="halauthorid" notation="string">180905-175567</idno>
              <idno type="IDREF">https://www.idref.fr/11067250X</idno>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Ali Ridha</forename>
                <surname>Mahjoub</surname>
              </persName>
              <email type="md5">680e852d52109642a4d14353247a5c56</email>
              <email type="domain">math.univ-bpclermont.fr</email>
              <idno type="idhal" notation="numeric">922139</idno>
              <idno type="halauthorid" notation="string">314649-922139</idno>
              <affiliation ref="#struct-857"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jean</forename>
                <surname>Mailfert</surname>
              </persName>
              <email type="md5">bf23ed80b2530fdd0cae2c7af07c2eab</email>
              <email type="domain">uca.fr</email>
              <idno type="idhal" notation="string">jean-mailfert</idno>
              <idno type="idhal" notation="numeric">20286</idno>
              <idno type="halauthorid" notation="string">3260-20286</idno>
              <idno type="IDREF">https://www.idref.fr/184190053</idno>
              <idno type="ORCID">https://orcid.org/0009-0000-1137-935X</idno>
              <affiliation ref="#struct-857"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Bastien</forename>
                <surname>DOREAU</surname>
              </persName>
              <email type="md5">209201e43fe204bc49f2e72efa688459</email>
              <email type="domain">isima.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2012-03-12 09:53:35</date>
              <date type="whenWritten">2007-04-16</date>
              <date type="whenModified">2025-08-12 15:44:26</date>
              <date type="whenReleased">2012-03-12 14:20:21</date>
              <date type="whenProduced">2007-10-07</date>
              <date type="whenEndEmbargoed">2012-03-12</date>
              <ref type="file" target="https://hal.science/hal-00678058v1/document">
                <date notBefore="2012-03-12"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-00678058v1/file/RR-07-01b.pdf" id="file-678058-711090">
                <date notBefore="2012-03-12"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="533750">
                <persName>
                  <forename>Bastien</forename>
                  <surname>DOREAU</surname>
                </persName>
                <email type="md5">209201e43fe204bc49f2e72efa688459</email>
                <email type="domain">isima.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00678058</idno>
            <idno type="halUri">https://hal.science/hal-00678058</idno>
            <idno type="halBibtex">bendali:hal-00678058</idno>
            <idno type="halRefHtml">&lt;i&gt;International Workshop on Design of Reliable Communication Networks (DRCN)&lt;/i&gt;, Oct 2007, La Rochelle, France. pp.Pages 1 - 8, &lt;a target="_blank" href="https://dx.doi.org/10.1109/DRCN.2007.4762290"&gt;&amp;#x27E8;10.1109/DRCN.2007.4762290&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">International Workshop on Design of Reliable Communication Networks (DRCN), Oct 2007, La Rochelle, France. pp.Pages 1 - 8, &amp;#x27E8;10.1109/DRCN.2007.4762290&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-678058-711090"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="PRES_CLERMONT">Université de Clermont</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-CLERMONT1" corresp="PRES_CLERMONT">Université d'Auvergne - Clermont-Ferrand I</idno>
            <idno type="stamp" n="UNIV-BPCLERMONT" corresp="PRES_CLERMONT">Université Blaise Pascal - Clermont-Ferrand II</idno>
            <idno type="stamp" n="LIMOS" corresp="PRES_CLERMONT">Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
            <idno type="stamp" n="CLERMONT-AUVERGNE-INP">Clermont Auvergne INP</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Fatiha</forename>
                    <surname>Bendali</surname>
                  </persName>
                  <email type="md5">20c8740a821690a4bfae2a2891f9bcda</email>
                  <email type="domain">isima.fr</email>
                  <idno type="idhal" notation="string">fatiha-bendali</idno>
                  <idno type="idhal" notation="numeric">172499</idno>
                  <idno type="halauthorid" notation="string">14981-172499</idno>
                  <idno type="IDREF">https://www.idref.fr/161965954</idno>
                  <affiliation ref="#struct-857"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Ibrahima</forename>
                    <surname>Diarrassouba</surname>
                  </persName>
                  <email type="md5">8bd0a772beb7c72386aa43e8ce11e914</email>
                  <email type="domain">univ-lehavre.fr</email>
                  <idno type="idhal" notation="string">ibrahima-diarrassouba</idno>
                  <idno type="idhal" notation="numeric">745402</idno>
                  <idno type="halauthorid" notation="string">14680-745402</idno>
                  <idno type="IDREF">https://www.idref.fr/142386359</idno>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Mohamed</forename>
                    <surname>Didi Biha</surname>
                  </persName>
                  <email type="md5">92b3a693d9be8828b655dbde67283662</email>
                  <email type="domain">unicaen.fr</email>
                  <idno type="idhal" notation="string">mohamed-didi-biha</idno>
                  <idno type="idhal" notation="numeric">175567</idno>
                  <idno type="halauthorid" notation="string">180905-175567</idno>
                  <idno type="IDREF">https://www.idref.fr/11067250X</idno>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Ali Ridha</forename>
                    <surname>Mahjoub</surname>
                  </persName>
                  <email type="md5">680e852d52109642a4d14353247a5c56</email>
                  <email type="domain">math.univ-bpclermont.fr</email>
                  <idno type="idhal" notation="numeric">922139</idno>
                  <idno type="halauthorid" notation="string">314649-922139</idno>
                  <affiliation ref="#struct-857"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jean</forename>
                    <surname>Mailfert</surname>
                  </persName>
                  <email type="md5">bf23ed80b2530fdd0cae2c7af07c2eab</email>
                  <email type="domain">uca.fr</email>
                  <idno type="idhal" notation="string">jean-mailfert</idno>
                  <idno type="idhal" notation="numeric">20286</idno>
                  <idno type="halauthorid" notation="string">3260-20286</idno>
                  <idno type="IDREF">https://www.idref.fr/184190053</idno>
                  <idno type="ORCID">https://orcid.org/0009-0000-1137-935X</idno>
                  <affiliation ref="#struct-857"/>
                </author>
              </analytic>
              <monogr>
                <idno type="localRef">RR-07-01</idno>
                <title level="m">Design and Reliable Communication Networks, 2007. DRCN 2007. 6th International Workshop on</title>
                <meeting>
                  <title>International Workshop on Design of Reliable Communication Networks (DRCN)</title>
                  <date type="start">2007-10-07</date>
                  <date type="end">2007-10-10</date>
                  <settlement>La Rochelle</settlement>
                  <country key="FR">France</country>
                </meeting>
                <imprint>
                  <biblScope unit="pp">Pages 1 - 8</biblScope>
                  <date type="datePub">2007-10</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1109/DRCN.2007.4762290</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Branch-and-Cut</term>
                <term xml:lang="en">k-edge connected subgraph</term>
                <term xml:lang="en">polytope</term>
                <term xml:lang="en">facet</term>
                <term xml:lang="en">separation</term>
                <term xml:lang="en">reduction operations</term>
                <term xml:lang="en">Branch-and-Cut.</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [math.OC]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>In this paper we consider the k-edge connected subgraph problem from a polyhedral point of view. We introduce further classes of valid inequalities for the associated polytope, and describe sufficient conditions for these inequalities to be facet defining. We also devise separation routines for these inequalities, and discuss some reduction operations that can be used in a preprocessing phase for the separation. Using these results, we develop a Branch-and-Cut algorithm and present some computational results.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-857" status="OLD">
          <idno type="IdRef">155645919</idno>
          <idno type="RNSR">200212221E</idno>
          <orgName>Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes</orgName>
          <orgName type="acronym">LIMOS</orgName>
          <date type="start">2000-01-01</date>
          <date type="end">2016-12-31</date>
          <desc>
            <address>
              <addrLine>Bât ISIMA Campus des Cézeaux BP 10025 63173 AUBIERE cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.isima.fr/limos/</ref>
          </desc>
          <listRelation>
            <relation name="UMR6158 / FRE2239" active="#struct-205618" type="direct"/>
            <relation active="#struct-300267" type="direct"/>
            <relation active="#struct-322672" type="direct"/>
            <relation name="UMR6158" active="#struct-359750" type="direct"/>
            <relation name="UMR6158" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-205618" status="OLD">
          <orgName>Université Blaise Pascal - Clermont-Ferrand 2</orgName>
          <orgName type="acronym">UBP</orgName>
          <date type="end">2016-12-31</date>
          <desc>
            <address>
              <addrLine>34, avenue Carnot - BP 185 / 63006 Clermont-Ferrand cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-bpclermont.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300267" status="OLD">
          <orgName>Université d'Auvergne - Clermont-Ferrand I</orgName>
          <orgName type="acronym">UdA</orgName>
          <date type="end">2016-12-31</date>
          <desc>
            <address>
              <addrLine>49, Boulevard François-Mitterrand / CS 60032 / 63001 Clermont-Ferrand Cedex 1</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-clermont1.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-322672" status="OLD">
          <orgName>SIGMA Clermont</orgName>
          <orgName type="acronym">SIGMA Clermont</orgName>
          <date type="start">2016-01-01</date>
          <date type="end">2020-12-31</date>
          <desc>
            <address>
              <addrLine>SIGMA Clermont / Campus des Cézeaux  / CS 20265 / 63178 Aubière Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sigma-clermont.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-359750" status="VALID">
          <idno type="IdRef">028028694</idno>
          <orgName>Ecole Nationale Supérieure des Mines de St Etienne</orgName>
          <orgName type="acronym">ENSM ST-ETIENNE</orgName>
          <date type="start">1816-01-01</date>
          <desc>
            <address>
              <addrLine>158 Cour Fauriel, 42100 Saint-Étienne</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.mines-stetienne.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>