<?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-01417867</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-21T20:20:14+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">New reformulations of distributionally robust shortest path problem.</title>
            <author role="aut">
              <persName>
                <forename type="first">Jianqiang</forename>
                <surname>Cheng</surname>
              </persName>
              <idno type="idhal" notation="numeric">1665732</idno>
              <idno type="halauthorid" notation="string">809921-1665732</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-3358-9176</idno>
              <idno type="IDREF">https://www.idref.fr/174945477</idno>
              <affiliation ref="#struct-2544"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Janny</forename>
                <surname>Leung</surname>
              </persName>
              <idno type="halauthorid">981834-0</idno>
              <affiliation ref="#struct-93116"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Abdel</forename>
                <surname>Lisser</surname>
              </persName>
              <email type="md5">f9048af9dc25411e07ac0b6eb88e7b49</email>
              <email type="domain">l2s.centralesupelec.fr</email>
              <idno type="idhal" notation="string">abdel-lisser</idno>
              <idno type="idhal" notation="numeric">11208</idno>
              <idno type="halauthorid" notation="string">20724-11208</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-1318-6679</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=X05CPd0AAAAJ&amp;hl=fr</idno>
              <idno type="IDREF">https://www.idref.fr/032881983</idno>
              <affiliation ref="#struct-2544"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Abdel</forename>
                <surname>Lisser</surname>
              </persName>
              <email type="md5">f9048af9dc25411e07ac0b6eb88e7b49</email>
              <email type="domain">l2s.centralesupelec.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2016-12-16 10:17:07</date>
              <date type="whenWritten">2016</date>
              <date type="whenModified">2026-04-03 10:01:42</date>
              <date type="whenReleased">2016-12-16 10:17:07</date>
              <date type="whenProduced">2016</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="475588">
                <persName>
                  <forename>Abdel</forename>
                  <surname>Lisser</surname>
                </persName>
                <email type="md5">f9048af9dc25411e07ac0b6eb88e7b49</email>
                <email type="domain">l2s.centralesupelec.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01417867</idno>
            <idno type="halUri">https://hal.science/hal-01417867</idno>
            <idno type="halBibtex">cheng:hal-01417867</idno>
            <idno type="halRefHtml">&lt;i&gt;Computers and Operations Research&lt;/i&gt;, 2016, 74, pp.196-204</idno>
            <idno type="halRef">Computers and Operations Research, 2016, 74, pp.196-204</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-PSUD">Université Paris Sud - Paris XI</idno>
            <idno type="stamp" n="UMR8623">Laboratoire de Recherche en Informatique</idno>
            <idno type="stamp" n="LRI-ROCS" corresp="UMR8623">Laboratoire de recherche en informatique. Équipe: Réseaux et Optimisation Combinatoire Stochastique</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="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="UNIV-PSUD-SACLAY" corresp="UNIV-PARIS-SACLAY">Université Paris Sud pour Paris Saclay</idno>
            <idno type="stamp" n="CENTRALESUPELEC-SACLAY" corresp="UNIV-PARIS-SACLAY">CENTRALESUPELEC-SACLAY</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">New reformulations of distributionally robust shortest path problem.</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Jianqiang</forename>
                    <surname>Cheng</surname>
                  </persName>
                  <idno type="idhal" notation="numeric">1665732</idno>
                  <idno type="halauthorid" notation="string">809921-1665732</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-3358-9176</idno>
                  <idno type="IDREF">https://www.idref.fr/174945477</idno>
                  <affiliation ref="#struct-2544"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Janny</forename>
                    <surname>Leung</surname>
                  </persName>
                  <idno type="halauthorid">981834-0</idno>
                  <affiliation ref="#struct-93116"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Abdel</forename>
                    <surname>Lisser</surname>
                  </persName>
                  <email type="md5">f9048af9dc25411e07ac0b6eb88e7b49</email>
                  <email type="domain">l2s.centralesupelec.fr</email>
                  <idno type="idhal" notation="string">abdel-lisser</idno>
                  <idno type="idhal" notation="numeric">11208</idno>
                  <idno type="halauthorid" notation="string">20724-11208</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-1318-6679</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=X05CPd0AAAAJ&amp;hl=fr</idno>
                  <idno type="IDREF">https://www.idref.fr/032881983</idno>
                  <affiliation ref="#struct-2544"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">12050</idno>
                <idno type="issn">0305-0548</idno>
                <idno type="eissn">1873-765X</idno>
                <title level="j">Computers and Operations Research</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">74</biblScope>
                  <biblScope unit="pp">196-204</biblScope>
                  <date type="datePub">2016</date>
                </imprint>
              </monogr>
              <ref type="publisher">http://www.journals.elsevier.com/computers-and-operations-research</ref>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en"> Distributionally robust</term>
                <term xml:lang="en"> Shortest path</term>
                <term xml:lang="en">Stochastic programming</term>
                <term xml:lang="en"> Semidefinite programming</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>This paper considers a stochastic version of the shortest path problem, namely Distributionally Robust Stochastic Shortest Path Problem(DRSSPP) on directed graphs. In this model, each arc has a deterministic cost and a random delay. The mean vector and the second-moment matrix of the uncertain data are assumed to be known, but the exact information of the distribution is unknown. A penalty occurs when the given delay constraint is not satisfied. The objective is to minimize the sum of the path cost and the expected path delay penalty. As this problem is NP-hard, we propose new reformulations and approximations using a sequence of semidefinite programming problems which provide tight lower bounds. Finally, numerical tests are conducted to illustrate the tightness of the bounds and the value of the proposed distributionally robust approach.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-2544" status="OLD">
          <idno type="RNSR">199812948M</idno>
          <orgName>Laboratoire de Recherche en Informatique</orgName>
          <orgName type="acronym">LRI</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>LRI - Bâtiments 650-660 Université Paris-Sud 91405 Orsay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lri.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-92966" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation name="UMR8623" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-93116" status="VALID">
          <idno type="ROR">https://ror.org/00t33hh48</idno>
          <orgName>The Chinese University of Hong Kong</orgName>
          <orgName type="acronym">CUHK</orgName>
          <desc>
            <address>
              <addrLine>Shatin, NT, Hong Kong SAR</addrLine>
              <country key="CN"/>
            </address>
            <ref type="url">https://www.cuhk.edu.hk/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-92966" status="OLD">
          <idno type="ROR">https://ror.org/028rypz17</idno>
          <orgName>Université Paris-Sud - Paris 11</orgName>
          <orgName type="acronym">UP11</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Bâtiment 300 - 91405 Orsay cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-psud.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.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>