<?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-01126262</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-25T14:04:26+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Quadratic convex reformulation for graph partitionning problems</title>
            <author role="aut">
              <persName>
                <forename type="first">Sourour</forename>
                <surname>Elloumi</surname>
              </persName>
              <email type="md5">e5ba00d0790d533d384333bb0a643535</email>
              <email type="domain">ensta-paris.fr</email>
              <idno type="idhal" notation="string">sourour-elloumi</idno>
              <idno type="idhal" notation="numeric">9568</idno>
              <idno type="halauthorid" notation="string">24776-9568</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-6289-7958</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=DSjEWRQAAAAJ&amp;hl=fr</idno>
              <idno type="IDREF">https://www.idref.fr/118445103</idno>
              <affiliation ref="#struct-16574"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Amélie</forename>
                <surname>Lambert</surname>
              </persName>
              <email type="md5">850aa5cff372a203374100d4af1ac806</email>
              <email type="domain">cnam.fr</email>
              <idno type="idhal" notation="string">amelie-lambert</idno>
              <idno type="idhal" notation="numeric">181603</idno>
              <idno type="halauthorid" notation="string">24788-181603</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8305-2145</idno>
              <affiliation ref="#struct-16574"/>
              <affiliation ref="#struct-553460"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Laboratoire</forename>
                <surname>CEDRIC</surname>
              </persName>
              <email type="md5">34e509f884b6168d15336e5a2357ce4c</email>
              <email type="domain">cnam.fr.invalid</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2015-03-06 11:48:04</date>
              <date type="whenWritten">2013-09-08</date>
              <date type="whenModified">2025-07-09 15:06:18</date>
              <date type="whenReleased">2015-03-06 11:48:04</date>
              <date type="whenProduced">2013-09-09</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="308156">
                <persName>
                  <forename>Laboratoire</forename>
                  <surname>CEDRIC</surname>
                </persName>
                <email type="md5">34e509f884b6168d15336e5a2357ce4c</email>
                <email type="domain">cnam.fr.invalid</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01126262</idno>
            <idno type="halUri">https://hal.science/hal-01126262</idno>
            <idno type="halBibtex">elloumi:hal-01126262</idno>
            <idno type="halRefHtml">&lt;i&gt;IFIP TC 7 / 2013 System Modelling and Optimization&lt;/i&gt;, Sep 2013, Klagenfurt, Austria. pp.1</idno>
            <idno type="halRef">IFIP TC 7 / 2013 System Modelling and Optimization, Sep 2013, Klagenfurt, Austria. pp.1</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNAM">Conservatoire National des Arts et Métiers</idno>
            <idno type="stamp" n="CEDRIC-CNAM" corresp="CNAM">Centre d'études et de recherche en informatique et communications </idno>
            <idno type="stamp" n="HESAM-CNAM" corresp="HESAM">Conservatoire National des Arts et Métiers - Hesam</idno>
            <idno type="stamp" n="HESAM">Hesam</idno>
            <idno type="stamp" n="ENSIIE">ENSIIE</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="1">Not set</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">Quadratic convex reformulation for graph partitionning problems</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Sourour</forename>
                    <surname>Elloumi</surname>
                  </persName>
                  <email type="md5">e5ba00d0790d533d384333bb0a643535</email>
                  <email type="domain">ensta-paris.fr</email>
                  <idno type="idhal" notation="string">sourour-elloumi</idno>
                  <idno type="idhal" notation="numeric">9568</idno>
                  <idno type="halauthorid" notation="string">24776-9568</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-6289-7958</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=DSjEWRQAAAAJ&amp;hl=fr</idno>
                  <idno type="IDREF">https://www.idref.fr/118445103</idno>
                  <affiliation ref="#struct-16574"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Amélie</forename>
                    <surname>Lambert</surname>
                  </persName>
                  <email type="md5">850aa5cff372a203374100d4af1ac806</email>
                  <email type="domain">cnam.fr</email>
                  <idno type="idhal" notation="string">amelie-lambert</idno>
                  <idno type="idhal" notation="numeric">181603</idno>
                  <idno type="halauthorid" notation="string">24788-181603</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8305-2145</idno>
                  <affiliation ref="#struct-16574"/>
                  <affiliation ref="#struct-553460"/>
                </author>
              </analytic>
              <monogr>
                <idno type="localRef">EL13</idno>
                <meeting>
                  <title>IFIP TC 7  / 2013 System Modelling and Optimization</title>
                  <date type="start">2013-09-09</date>
                  <settlement>Klagenfurt</settlement>
                  <country key="AT">Austria</country>
                </meeting>
                <imprint>
                  <biblScope unit="pp">1</biblScope>
                  <date type="datePub">2013-09-09</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">integer programming</term>
                <term xml:lang="en">graph partitionning</term>
                <term xml:lang="en">Quadratic programming</term>
                <term xml:lang="fr">Programmation quadratique</term>
                <term xml:lang="fr">programmation en nombres entiers</term>
                <term xml:lang="fr">cloisonnement graphique</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halDomain" n="info.info-cc">Computer Science [cs]/Computational Complexity [cs.CC]</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>Many graph partitionning problems can be formulated by quadratic programs (QP) with binary variables and linear and quadratic constraints. We apply the general approach that consists in first reformulating the initial (QP) into an equivalent program (QP ). Problem (QP ) has the additional property that its continuous relaxation is a convex quadratic problem. It can then be solved by branch-and-bound based on quadratic convex relaxation. We show how variants of thisgeneral approach perform on many graph partitionning problems.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-16574" status="VALID">
          <idno type="IdRef">155463381</idno>
          <idno type="RNSR">201119480F</idno>
          <idno type="ROR">https://ror.org/044j5mm75</idno>
          <orgName>Centre d'études et de recherche en informatique et communications</orgName>
          <orgName type="acronym">CEDRIC</orgName>
          <desc>
            <address>
              <addrLine>292 rue Saint-Martin 75141 PARIS Cedex 03Case courrier 2D4P30</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://cedric.cnam.fr/</ref>
          </desc>
          <listRelation>
            <relation name="EA4629" active="#struct-179741" type="direct"/>
            <relation name="EA4629" active="#struct-300351" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-553460" status="VALID">
          <orgName>CEDRIC. Optimisation Combinatoire</orgName>
          <orgName type="acronym">CEDRIC - OC</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://cedric.cnam.fr/index.php/labo/OC</ref>
          </desc>
          <listRelation>
            <relation active="#struct-16574" type="direct"/>
            <relation name="EA4629" active="#struct-179741" type="indirect"/>
            <relation name="EA4629" active="#struct-300351" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-179741" status="VALID">
          <orgName>Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise</orgName>
          <orgName type="acronym">ENSIIE</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ensiie.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300351" status="VALID">
          <idno type="IdRef">027404978</idno>
          <idno type="ISNI">0000000121690459</idno>
          <idno type="ROR">https://ror.org/0175hh227</idno>
          <orgName>Conservatoire National des Arts et Métiers [Cnam]</orgName>
          <orgName type="acronym">Cnam</orgName>
          <desc>
            <address>
              <addrLine>292 Rue Saint-Martin, 75003 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.cnam.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>