Sensitivity analysis on the all pairs q‐route flows in a network
Identifieur interne : 000987 ( Main/Exploration ); précédent : 000986; suivant : 000988Sensitivity analysis on the all pairs q‐route flows in a network
Auteurs : Madiagne Diallo [Brésil] ; Serigne Gueye [France] ; Pascal BerthoméSource :
- International Transactions in Operational Research [ 0969-6016 ] ; 2010-01.
English descriptors
- KwdEn :
Abstract
Given an undirected edge‐weighted network in which one edge capacity is allowed to vary, we propose in this paper a polynomial algorithm that needs only two 2‐cut‐trees computations to provide the all pairs maximum 2‐route flow values. Moreover, we provide an extension to the case where k edge capacities may vary, and show that 2k 2‐cut‐trees computations are necessary in order to determine the all pairs maximum 2‐route‐flow values. This makes our algorithm polynomial whenever .
Url:
DOI: 10.1111/j.1475-3995.2009.00698.x
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000F68
- to stream Istex, to step Curation: 000F68
- to stream Istex, to step Checkpoint: 000171
- to stream Main, to step Merge: 000988
- to stream Main, to step Curation: 000987
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Sensitivity analysis on the all pairs q‐route flows in a network</title>
<author><name sortKey="Diallo, Madiagne" sort="Diallo, Madiagne" uniqKey="Diallo M" first="Madiagne" last="Diallo">Madiagne Diallo</name>
</author>
<author><name sortKey="Gueye, Serigne" sort="Gueye, Serigne" uniqKey="Gueye S" first="Serigne" last="Gueye">Serigne Gueye</name>
</author>
<author><name sortKey="Berthome, Pascal" sort="Berthome, Pascal" uniqKey="Berthome P" first="Pascal" last="Berthomé">Pascal Berthomé</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:80A6892824F731173CAAE60C5571960A45301297</idno>
<date when="2010" year="2010">2010</date>
<idno type="doi">10.1111/j.1475-3995.2009.00698.x</idno>
<idno type="url">https://api.istex.fr/document/80A6892824F731173CAAE60C5571960A45301297/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000F68</idno>
<idno type="wicri:Area/Istex/Curation">000F68</idno>
<idno type="wicri:Area/Istex/Checkpoint">000171</idno>
<idno type="wicri:doubleKey">0969-6016:2010:Diallo M:sensitivity:analysis:on</idno>
<idno type="wicri:Area/Main/Merge">000988</idno>
<idno type="wicri:Area/Main/Curation">000987</idno>
<idno type="wicri:Area/Main/Exploration">000987</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Sensitivity analysis on the all pairs q‐route flows in a network</title>
<author><name sortKey="Diallo, Madiagne" sort="Diallo, Madiagne" uniqKey="Diallo M" first="Madiagne" last="Diallo">Madiagne Diallo</name>
<affiliation wicri:level="1"><country xml:lang="fr">Brésil</country>
<wicri:regionArea>Engenharia Industrial, Pontifícia Universidade Católica (PUC‐Rio), Rua Marquês de São Vicente, Gávea Rio de Janeiro, RJ 22453‐900</wicri:regionArea>
<wicri:noRegion>RJ 22453‐900</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Gueye, Serigne" sort="Gueye, Serigne" uniqKey="Gueye S" first="Serigne" last="Gueye">Serigne Gueye</name>
<affiliation wicri:level="4"><country xml:lang="fr">France</country>
<wicri:regionArea>Université du Havre, Laboratoire de Mathématiques Appliquées du Havre, 25 rue Philippe Lebon, BP 540, 76058 Le Havre cedex</wicri:regionArea>
<placeName><region type="region" nuts="2">Région Normandie</region>
<region type="old region" nuts="2">Haute-Normandie</region>
<settlement type="city">Le Havre</settlement>
</placeName>
<orgName type="university">Université du Havre</orgName>
</affiliation>
</author>
<author><name sortKey="Berthome, Pascal" sort="Berthome, Pascal" uniqKey="Berthome P" first="Pascal" last="Berthomé">Pascal Berthomé</name>
<affiliation><wicri:noCountry code="subField">[Berthomé]</wicri:noCountry>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j">International Transactions in Operational Research</title>
<idno type="ISSN">0969-6016</idno>
<idno type="eISSN">1475-3995</idno>
<imprint><publisher>Blackwell Publishing Ltd</publisher>
<pubPlace>Oxford, UK</pubPlace>
<date type="published" when="2010-01">2010-01</date>
<biblScope unit="volume">17</biblScope>
<biblScope unit="issue">1</biblScope>
<biblScope unit="page" from="103">103</biblScope>
<biblScope unit="page" to="117">117</biblScope>
</imprint>
<idno type="ISSN">0969-6016</idno>
</series>
<idno type="istex">80A6892824F731173CAAE60C5571960A45301297</idno>
<idno type="DOI">10.1111/j.1475-3995.2009.00698.x</idno>
<idno type="ArticleID">ITOR698</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0969-6016</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>2‐cut‐tree</term>
<term>cut‐tree</term>
<term>multiroute flows</term>
<term>parametric flows</term>
<term>q‐route flows</term>
<term>sensitivity analysis</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Given an undirected edge‐weighted network in which one edge capacity is allowed to vary, we propose in this paper a polynomial algorithm that needs only two 2‐cut‐trees computations to provide the all pairs maximum 2‐route flow values. Moreover, we provide an extension to the case where k edge capacities may vary, and show that 2k 2‐cut‐trees computations are necessary in order to determine the all pairs maximum 2‐route‐flow values. This makes our algorithm polynomial whenever .</div>
</front>
</TEI>
<affiliations><list><country><li>Brésil</li>
<li>France</li>
</country>
<region><li>Haute-Normandie</li>
<li>Région Normandie</li>
</region>
<settlement><li>Le Havre</li>
</settlement>
<orgName><li>Université du Havre</li>
</orgName>
</list>
<tree><noCountry><name sortKey="Berthome, Pascal" sort="Berthome, Pascal" uniqKey="Berthome P" first="Pascal" last="Berthomé">Pascal Berthomé</name>
</noCountry>
<country name="Brésil"><noRegion><name sortKey="Diallo, Madiagne" sort="Diallo, Madiagne" uniqKey="Diallo M" first="Madiagne" last="Diallo">Madiagne Diallo</name>
</noRegion>
</country>
<country name="France"><region name="Région Normandie"><name sortKey="Gueye, Serigne" sort="Gueye, Serigne" uniqKey="Gueye S" first="Serigne" last="Gueye">Serigne Gueye</name>
</region>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/France/explor/LeHavreV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000987 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000987 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/France |area= LeHavreV1 |flux= Main |étape= Exploration |type= RBID |clé= ISTEX:80A6892824F731173CAAE60C5571960A45301297 |texte= Sensitivity analysis on the all pairs q‐route flows in a network }}
This area was generated with Dilib version V0.6.25. |