<?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-01768646</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-03T03:36:43+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation</title>
            <author role="aut">
              <persName>
                <forename type="first">Sara</forename>
                <surname>Mattia</surname>
              </persName>
              <email type="md5">2000eabd6cd145ec32be40b10e13d66a</email>
              <email type="domain">iasi.cnr.it</email>
              <idno type="idhal" notation="numeric">952622</idno>
              <idno type="halauthorid" notation="string">802982-952622</idno>
              <affiliation ref="#struct-88293"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Michael</forename>
                <surname>Poss</surname>
              </persName>
              <email type="md5">72e27cfcfe136fce3f5a53c76020e9d3</email>
              <email type="domain">hds.utc.fr</email>
              <idno type="idhal" notation="string">michael-poss</idno>
              <idno type="idhal" notation="numeric">170284</idno>
              <idno type="halauthorid" notation="string">27682-170284</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-9145-2525</idno>
              <idno type="IDREF">https://www.idref.fr/183981847</idno>
              <affiliation ref="#struct-388266"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Michaël</forename>
                <surname>Poss</surname>
              </persName>
              <email type="md5">9d945b340b22d5ff1b6c48aee70b2aff</email>
              <email type="domain">lirmm.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2018-04-17 13:30:16</date>
              <date type="whenModified">2025-02-08 03:12:35</date>
              <date type="whenReleased">2018-04-17 14:50:51</date>
              <date type="whenProduced">2018-04</date>
              <date type="whenEndEmbargoed">2018-04-17</date>
              <ref type="file" target="https://hal.science/hal-01768646v1/document">
                <date notBefore="2018-04-17"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01768646v1/file/RNLsvad_newrev.pdf" id="file-1768646-1799677">
                <date notBefore="2018-04-17"/>
              </ref>
              <ref type="externalLink" target="https://hal.archives-ouvertes.fr/hal-01520348/file/RNLsvad_rev.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="179383">
                <persName>
                  <forename>Michaël</forename>
                  <surname>Poss</surname>
                </persName>
                <email type="md5">9d945b340b22d5ff1b6c48aee70b2aff</email>
                <email type="domain">lirmm.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01768646</idno>
            <idno type="halUri">https://hal.science/hal-01768646</idno>
            <idno type="halBibtex">mattia:hal-01768646</idno>
            <idno type="halRefHtml">&lt;i&gt;Computational Optimization and Applications&lt;/i&gt;, 2018, 69 (3), pp.753 - 800. &lt;a target="_blank" href="https://dx.doi.org/10.1007/s10589-017-9956-z"&gt;&amp;#x27E8;10.1007/s10589-017-9956-z&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Computational Optimization and Applications, 2018, 69 (3), pp.753 - 800. &amp;#x27E8;10.1007/s10589-017-9956-z&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1768646-1799677"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="MAORE" corresp="LIRMM">Méthodes Algorithmes pour l'Ordonnancement et les Réseaux</idno>
            <idno type="stamp" n="LIRMM">Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier</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="MIPS">Mathématiques, Informatique, Physique et Systèmes</idno>
            <idno type="stamp" n="UNIV-MONTPELLIER">Université de Montpellier</idno>
            <idno type="stamp" n="POSS">Michael Poss</idno>
            <idno type="stamp" n="UM-2015-2021" corresp="UNIV-MONTPELLIER">Université de Montpellier (2015-2021)</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Sara</forename>
                    <surname>Mattia</surname>
                  </persName>
                  <email type="md5">2000eabd6cd145ec32be40b10e13d66a</email>
                  <email type="domain">iasi.cnr.it</email>
                  <idno type="idhal" notation="numeric">952622</idno>
                  <idno type="halauthorid" notation="string">802982-952622</idno>
                  <affiliation ref="#struct-88293"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Michael</forename>
                    <surname>Poss</surname>
                  </persName>
                  <email type="md5">72e27cfcfe136fce3f5a53c76020e9d3</email>
                  <email type="domain">hds.utc.fr</email>
                  <idno type="idhal" notation="string">michael-poss</idno>
                  <idno type="idhal" notation="numeric">170284</idno>
                  <idno type="halauthorid" notation="string">27682-170284</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-9145-2525</idno>
                  <idno type="IDREF">https://www.idref.fr/183981847</idno>
                  <affiliation ref="#struct-388266"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">12008</idno>
                <idno type="issn">0926-6003</idno>
                <idno type="eissn">1573-2894</idno>
                <title level="j">Computational Optimization and Applications</title>
                <imprint>
                  <publisher>Springer Verlag</publisher>
                  <biblScope unit="volume">69</biblScope>
                  <biblScope unit="issue">3</biblScope>
                  <biblScope unit="pp">753 - 800</biblScope>
                  <date type="datePub">2018-04</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/s10589-017-9956-z</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">dynamic routing</term>
                <term xml:lang="en">affine routing</term>
                <term xml:lang="en">volume routing</term>
                <term xml:lang="en">static rout- ing</term>
                <term xml:lang="en">Benders decomposition</term>
                <term xml:lang="en">budgeted uncertainty</term>
                <term xml:lang="en">robust network loading</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [math.OC]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We consider the capacity formulation of the Robust Network Loading Problem. The aim of the paper is to study what happens from the theoretical and from the computational point of view when the routing policy (or scheme) changes. The theoretical results consider static, volume, affine and dynamic routing, along with splittable and unsplittable flows. Our polyhedral study provides evidence that some well-known valid inequalities (the robust cutset inequalities) are facets for all the considered routing/flows policies under the same assumptions. We also introduce a new class of valid inequalities, the robust 3-partition inequalities, showing that, instead, they are facets in some settings, but not in others. A branch-and-cut algorithm is also proposed and tested. The computational experiments refer to the problem with splittable flows and the budgeted uncertainty set. We report results on several instances coming from real-life networks, also including historical traffic data, as well as on randomly generated instances. Our results show that the problem with static and volume routing can be solved quite efficiently in practice and that, in many cases, volume routing is cheaper than static routing, thus possibly representing the best compromise between cost and computing time. Moreover, unlikely from what one may expect, the problem with dynamic routing is easier to solve than the one with affine routing, which is hardly tractable, even using decomposition methods.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-88293" status="VALID">
          <orgName>Istituto di Analisi dei Sistemi ed Informatica “Antonio Ruberti”</orgName>
          <orgName type="acronym">IASI</orgName>
          <desc>
            <address>
              <addrLine>Viale Manzoni 30 00185 Roma</addrLine>
              <country key="IT"/>
            </address>
            <ref type="url">http://www.iasi.cnr.it/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-254021" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-388266" status="OLD">
          <orgName>Methods, Algorithms for Operations REsearch</orgName>
          <orgName type="acronym">MAORE</orgName>
          <date type="end">2021-12-31</date>
          <desc>
            <address>
              <addrLine>LIRMM, 161 rue Ada, 34000 Montpellier</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lirmm.fr/equipes/MAORE/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-181" type="direct"/>
            <relation name="UMR5506" active="#struct-410122" type="indirect"/>
            <relation name="UMR5506" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-254021" status="VALID">
          <idno type="ISNI">0000 0001 2159 6200</idno>
          <idno type="ROR">https://ror.org/04zaypm56</idno>
          <orgName>National Research Council of Italy | Consiglio Nazionale delle Ricerche</orgName>
          <orgName type="acronym">CNR</orgName>
          <date type="start">1923-01-01</date>
          <desc>
            <address>
              <addrLine>Piazzale Aldo Moro, 7 - 00185 Roma</addrLine>
              <country key="IT"/>
            </address>
            <ref type="url">https://www.cnr.it/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-181" status="OLD">
          <idno type="IdRef">139590827</idno>
          <idno type="ISNI">0000000405990488</idno>
          <idno type="RNSR">199111950H</idno>
          <idno type="ROR">https://ror.org/013yean28</idno>
          <orgName>Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier</orgName>
          <orgName type="acronym">LIRMM</orgName>
          <date type="start">1995-01-01</date>
          <date type="end">2021-12-31</date>
          <desc>
            <address>
              <addrLine>161 rue Ada - 34095 Montpellier</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lirmm.fr</ref>
          </desc>
          <listRelation>
            <relation name="UMR5506" active="#struct-410122" type="direct"/>
            <relation name="UMR5506" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-410122" status="OLD">
          <idno type="ISNI">0000000120970141</idno>
          <idno type="ROR">https://ror.org/051escj72</idno>
          <orgName>Université de Montpellier</orgName>
          <orgName type="acronym">UM</orgName>
          <date type="end">2021-12-31</date>
          <desc>
            <address>
              <addrLine>163 rue Auguste Broussonnet - 34090 Montpellier</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.umontpellier.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>