<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:sy="http://purl.org/rss/1.0/modules/syndication/" xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rss="http://purl.org/rss/1.0/">
  <channel rdf:about="http://www.edpsciences.org/articles/ro/rss/TOCRSS/rss.xml">
    <title>Recent articles in RAIRO - Operations Research</title>
    <link>http://www.edpsciences.org/ro</link>
    <description>Contents of the last issue of RAIRO - Operations Research</description>
    <items>
      <rdf:Seq>
        <rdf:li resource="http://www.edpsciences.org/10.1051/ro/2009008"/>
        <rdf:li resource="http://www.edpsciences.org/10.1051/ro/2009009"/>
        <rdf:li resource="http://www.edpsciences.org/10.1051/ro/2009010"/>
        <rdf:li resource="http://www.edpsciences.org/10.1051/ro/2009011"/>
        <rdf:li resource="http://www.edpsciences.org/10.1051/ro/2009012"/>
        <rdf:li resource="http://www.edpsciences.org/10.1051/ro/2009013"/>
        <rdf:li resource="http://www.edpsciences.org/10.1051/ro:2008025"/>
        <rdf:li resource="http://www.edpsciences.org/10.1051/ro:2008026"/>
        <rdf:li resource="http://www.edpsciences.org/10.1051/ro:2008027"/>
        <rdf:li resource="http://www.edpsciences.org/10.1051/ro:2008028"/>
        <rdf:li resource="http://www.edpsciences.org/10.1051/ro:2008029"/>
        <rdf:li resource="http://www.edpsciences.org/10.1051/ro:2008030"/>
      </rdf:Seq>
    </items>
    <sy:updatePeriod>weekly</sy:updatePeriod>
    <sy:updateFrequency>1</sy:updateFrequency>
    <sy:updateBase>2009-04-27T10:13:07Z</sy:updateBase>
    <dc:publisher>EDP Sciences</dc:publisher>
    <dc:rights>Copyright (c) 2009 </dc:rights>
    <prism:copyright>Copyright (c) 2009 </prism:copyright>
    <prism:issn>1290-3868</prism:issn>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
  </channel>
  <rss:item rdf:about="http://www.edpsciences.org/10.1051/ro/2009008">
    <rss:title>A continuous optimization model for a joint problem of pricing and resource allocation</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro/2009008</rss:link>
    <rss:description> Authors: Mustapha Bouhtou and Guillaume Erbs &lt;br/&gt;RAIRO-Oper. Res. 43, 115 (2009) Received April 2, 2007. Accepted March 27, 2008&lt;br/&gt; Keywords: Optimization, bilevel programming, revenue management, pricing, resource allocation, telecommunications.</rss:description>
    <dc:title>A continuous optimization model for a joint problem of pricing and resource allocation</dc:title>
    <dc:creator>Mustapha Bouhtou</dc:creator>
    <dc:creator>Guillaume Erbs</dc:creator>
    <dc:subject>Optimization</dc:subject>
    <dc:subject>bilevel programming</dc:subject>
    <dc:subject>revenue management</dc:subject>
    <dc:subject>pricing</dc:subject>
    <dc:subject>resource allocation</dc:subject>
    <dc:subject>telecommunications.</dc:subject>
    <dc:subject>90C90.</dc:subject>
    <dc:date>2009-04-27T10:13:07Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro/2009008</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 43, 115</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>2</prism:issueIdentifier>
    <prism:publicationDate>1240827187</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Article</prism:section>
    <prism:startingPage>115</prism:startingPage>
    <prism:volume>43</prism:volume>
  </rss:item>
  <rss:item rdf:about="http://www.edpsciences.org/10.1051/ro/2009009">
    <rss:title>A polynomial algorithm for minDSC on a subclass of series Parallel graphs</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro/2009009</rss:link>
    <rss:description> Authors: Salim Achouri, Timothée Bossart and Alix Munier-Kordon &lt;br/&gt;RAIRO-Oper. Res. 43, 145 (2009) Received June 30, 2007. Accepted July 3, 2008&lt;br/&gt; Keywords: Minimum directed sumcut, series parallel graph, polynomial algorithm.</rss:description>
    <dc:title>A polynomial algorithm for minDSC on a subclass of series Parallel graphs</dc:title>
    <dc:creator>Salim Achouri</dc:creator>
    <dc:creator>Timothée Bossart</dc:creator>
    <dc:creator>Alix Munier-Kordon</dc:creator>
    <dc:subject>Minimum directed sumcut</dc:subject>
    <dc:subject>series parallel graph</dc:subject>
    <dc:subject>polynomial algorithm.</dc:subject>
    <dc:subject>05C78</dc:subject>
    <dc:subject>05C85</dc:subject>
    <dc:subject>90B35.</dc:subject>
    <dc:date>2009-04-27T10:13:07Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro/2009009</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 43, 145</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>2</prism:issueIdentifier>
    <prism:publicationDate>1240827187</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Article</prism:section>
    <prism:startingPage>145</prism:startingPage>
    <prism:volume>43</prism:volume>
  </rss:item>
  <rss:item rdf:about="http://www.edpsciences.org/10.1051/ro/2009010">
    <rss:title>Tractable algorithms for chance-constrained combinatorial problems</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro/2009010</rss:link>
    <rss:description> Author: Olivier Klopfenstein&lt;br/&gt;RAIRO-Oper. Res. 43, 157 (2009) Received April 17, 2007. Accepted July 15, 2008&lt;br/&gt; Keywords: Integer linear programming, chance constraints, robust optimization, heuristic.</rss:description>
    <dc:title>Tractable algorithms for chance-constrained combinatorial problems</dc:title>
    <dc:creator>Olivier Klopfenstein</dc:creator>
    <dc:subject>Integer linear programming</dc:subject>
    <dc:subject>chance constraints</dc:subject>
    <dc:subject>robust optimization</dc:subject>
    <dc:subject>heuristic.</dc:subject>
    <dc:subject>90C10</dc:subject>
    <dc:subject>90C15.</dc:subject>
    <dc:date>2009-04-27T10:13:07Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro/2009010</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 43, 157</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>2</prism:issueIdentifier>
    <prism:publicationDate>1240827187</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Article</prism:section>
    <prism:startingPage>157</prism:startingPage>
    <prism:volume>43</prism:volume>
  </rss:item>
  <rss:item rdf:about="http://www.edpsciences.org/10.1051/ro/2009011">
    <rss:title>Kernel-function Based Algorithms for Semidefinite Optimization</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro/2009011</rss:link>
    <rss:description> Authors: M. EL Ghami, Y.Q. Bai and C. roos &lt;br/&gt;RAIRO-Oper. Res. 43, 189 (2009) Received October 10, 2007. Accepted January 27, 2009&lt;br/&gt; Keywords: Semidefinite optimization, interior-point methods, primal-dual method, complexity.</rss:description>
    <dc:title>Kernel-function Based Algorithms for Semidefinite Optimization</dc:title>
    <dc:creator>M. EL Ghami</dc:creator>
    <dc:creator>Y.Q. Bai</dc:creator>
    <dc:creator>C. roos</dc:creator>
    <dc:subject>Semidefinite optimization</dc:subject>
    <dc:subject>interior-point methods</dc:subject>
    <dc:subject>primal-dual method</dc:subject>
    <dc:subject>complexity.</dc:subject>
    <dc:subject>90C22</dc:subject>
    <dc:subject>90C31.</dc:subject>
    <dc:date>2009-04-27T10:13:07Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro/2009011</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 43, 189</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>2</prism:issueIdentifier>
    <prism:publicationDate>1240827187</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Article</prism:section>
    <prism:startingPage>189</prism:startingPage>
    <prism:volume>43</prism:volume>
  </rss:item>
  <rss:item rdf:about="http://www.edpsciences.org/10.1051/ro/2009012">
    <rss:title>Nonconvex Duality and Semicontinuous Proximal Solutions of HJB Equation in Optimal Control</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro/2009012</rss:link>
    <rss:description> Authors: Mustapha Serhani and Nadia Raïssi &lt;br/&gt;RAIRO-Oper. Res. 43, 201 (2009) Received January 30, 2006. Accepted February 2, 2009.&lt;br/&gt; Keywords: Optimal control, duality, HJB equation, proximal supersolution, proximal subdifferential.</rss:description>
    <dc:title>Nonconvex Duality and Semicontinuous Proximal Solutions of HJB Equation in Optimal Control</dc:title>
    <dc:creator>Mustapha Serhani</dc:creator>
    <dc:creator>Nadia Raïssi</dc:creator>
    <dc:subject>Optimal control</dc:subject>
    <dc:subject>duality</dc:subject>
    <dc:subject>HJB equation</dc:subject>
    <dc:subject>proximal supersolution</dc:subject>
    <dc:subject>proximal subdifferential.</dc:subject>
    <dc:subject>49J24</dc:subject>
    <dc:subject>49K24</dc:subject>
    <dc:subject>49N15</dc:subject>
    <dc:subject>49L99</dc:subject>
    <dc:subject>49J52.</dc:subject>
    <dc:date>2009-04-27T10:13:07Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro/2009012</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 43, 201</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>2</prism:issueIdentifier>
    <prism:publicationDate>1240827187</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Article</prism:section>
    <prism:startingPage>201</prism:startingPage>
    <prism:volume>43</prism:volume>
  </rss:item>
  <rss:item rdf:about="http://www.edpsciences.org/10.1051/ro/2009013">
    <rss:title>Separability by semivalues modified for games with coalition structure</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro/2009013</rss:link>
    <rss:description> Authors: Rafael Amer and José Miguel Giménez &lt;br/&gt;RAIRO-Oper. Res. 43, 215 (2009) Received February 14, 2008. Accepted March 6, 2009.&lt;br/&gt; Keywords: Cooperative games, semivalue, semivalue modified for games with coalition structure, separability, multilinear extension.</rss:description>
    <dc:title>Separability by semivalues modified for games with coalition structure</dc:title>
    <dc:creator>Rafael Amer</dc:creator>
    <dc:creator>José Miguel Giménez</dc:creator>
    <dc:subject>Cooperative games</dc:subject>
    <dc:subject>semivalue</dc:subject>
    <dc:subject>semivalue modified for games with coalition structure</dc:subject>
    <dc:subject>separability</dc:subject>
    <dc:subject>multilinear extension.</dc:subject>
    <dc:subject>91A12</dc:subject>
    <dc:subject>91A70.</dc:subject>
    <dc:date>2009-04-27T10:13:07Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro/2009013</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 43, 215</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>2</prism:issueIdentifier>
    <prism:publicationDate>1240827187</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Article</prism:section>
    <prism:startingPage>215</prism:startingPage>
    <prism:volume>43</prism:volume>
  </rss:item>
  <rss:item rdf:about="http://www.edpsciences.org/10.1051/ro:2008025">
    <rss:title>Editorial: ALIO/EURO V Conference on Combinatorial Optimization (ENST, Paris, 26–28 October 2005)</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro:2008025</rss:link>
    <rss:description> Authors: I. Charon and O. Hudry &lt;br/&gt;RAIRO-Oper. Res. 42, 433 (2009) &lt;br/&gt;</rss:description>
    <dc:title>Editorial: ALIO/EURO V Conference on Combinatorial Optimization (ENST, Paris, 26–28 October 2005)</dc:title>
    <dc:creator>I. Charon</dc:creator>
    <dc:creator>O. Hudry</dc:creator>
    <dc:date>2009-04-03T14:30:24Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro:2008025</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 42, 433</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>4</prism:issueIdentifier>
    <prism:publicationDate>1238769024</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Editorial</prism:section>
    <prism:startingPage>433</prism:startingPage>
    <prism:volume>42</prism:volume>
  </rss:item>
  <rss:item rdf:about="http://www.edpsciences.org/10.1051/ro:2008026">
    <rss:title>Three tabu search methods for the MI-FAP applied to 802.11 networks</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro:2008026</rss:link>
    <rss:description> Authors: Sacha Varone and Nicolas Zufferey &lt;br/&gt;RAIRO-Oper. Res. 42, 501 (2009) Received October 28, 2007. Accepted January 09, 2008.&lt;br/&gt; Keywords: WLAN, channel assignment, coloring, tabu search.</rss:description>
    <dc:title>Three tabu search methods for the MI-FAP applied to 802.11 networks</dc:title>
    <dc:creator>Sacha Varone</dc:creator>
    <dc:creator>Nicolas Zufferey</dc:creator>
    <dc:subject>WLAN</dc:subject>
    <dc:subject>channel assignment</dc:subject>
    <dc:subject>coloring</dc:subject>
    <dc:subject>tabu search.</dc:subject>
    <dc:subject>65K10</dc:subject>
    <dc:subject>68T20</dc:subject>
    <dc:subject>90B80.</dc:subject>
    <dc:date>2009-04-03T14:30:24Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro:2008026</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 42, 501</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>4</prism:issueIdentifier>
    <prism:publicationDate>1238769024</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Article</prism:section>
    <prism:startingPage>501</prism:startingPage>
    <prism:volume>42</prism:volume>
  </rss:item>
  <rss:item rdf:about="http://www.edpsciences.org/10.1051/ro:2008027">
    <rss:title>A branch-and-price-and-cut algorithm for the pattern minimization problem</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro:2008027</rss:link>
    <rss:description> Authors: Cláudio Alves and J.M. Valério de Carvalho &lt;br/&gt;RAIRO-Oper. Res. 42, 435 (2009) Received October 24, 2005; Accepted January 9, 2008.&lt;br/&gt; Keywords: Pattern Minimization Problem, column generation, cutting planes, branch-and-bound, dual feasible functions.</rss:description>
    <dc:title>A branch-and-price-and-cut algorithm for the pattern minimization problem</dc:title>
    <dc:creator>Cláudio Alves</dc:creator>
    <dc:creator>J.M. Valério de Carvalho</dc:creator>
    <dc:subject>Pattern Minimization Problem</dc:subject>
    <dc:subject>column generation</dc:subject>
    <dc:subject>cutting planes</dc:subject>
    <dc:subject>branch-and-bound</dc:subject>
    <dc:subject>dual feasible functions.</dc:subject>
    <dc:subject>90C10</dc:subject>
    <dc:subject>90C57.</dc:subject>
    <dc:date>2009-04-03T14:30:24Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro:2008027</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 42, 435</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>4</prism:issueIdentifier>
    <prism:publicationDate>1238769024</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Article</prism:section>
    <prism:startingPage>435</prism:startingPage>
    <prism:volume>42</prism:volume>
  </rss:item>
  <rss:item rdf:about="http://www.edpsciences.org/10.1051/ro:2008028">
    <rss:title>Acyclic Orientations with Path Constraints</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro:2008028</rss:link>
    <rss:description> Authors: Rosa M. V. Figueiredo, Valmir C. Barbosa, Nelson Maculan and Cid C. de Souza &lt;br/&gt;RAIRO-Oper. Res. 42, 455 (2009) Received May 11, 2005. Accepted January 9, 2008.&lt;br/&gt; Keywords: Acyclic orientations, path constraints, combinatorial optimization problems, facets of polyhedra.</rss:description>
    <dc:title>Acyclic Orientations with Path Constraints</dc:title>
    <dc:creator>Rosa M. V. Figueiredo</dc:creator>
    <dc:creator>Valmir C. Barbosa</dc:creator>
    <dc:creator>Nelson Maculan</dc:creator>
    <dc:creator>Cid C. de Souza</dc:creator>
    <dc:subject>Acyclic orientations</dc:subject>
    <dc:subject>path constraints</dc:subject>
    <dc:subject>combinatorial optimization problems</dc:subject>
    <dc:subject>facets of polyhedra.</dc:subject>
    <dc:subject>90C27</dc:subject>
    <dc:subject>90C57.</dc:subject>
    <dc:date>2009-04-03T14:30:24Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro:2008028</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 42, 455</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>4</prism:issueIdentifier>
    <prism:publicationDate>1238769024</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Article</prism:section>
    <prism:startingPage>455</prism:startingPage>
    <prism:volume>42</prism:volume>
  </rss:item>
  <rss:item rdf:about="http://www.edpsciences.org/10.1051/ro:2008029">
    <rss:title>Comparison of algorithms in graph partitioning</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro:2008029</rss:link>
    <rss:description> Author: Alain Guénoche&lt;br/&gt;RAIRO-Oper. Res. 42, 469 (2009) Received December 31, 2006. Accepted January 09, 2008&lt;br/&gt; Keywords: Graph partitioning, partition comparison, simulation.</rss:description>
    <dc:title>Comparison of algorithms in graph partitioning</dc:title>
    <dc:creator>Alain Guénoche</dc:creator>
    <dc:subject>Graph partitioning</dc:subject>
    <dc:subject>partition comparison</dc:subject>
    <dc:subject>simulation.</dc:subject>
    <dc:subject>05C85</dc:subject>
    <dc:subject>90C35</dc:subject>
    <dc:subject>90C59.</dc:subject>
    <dc:date>2009-04-03T14:30:24Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro:2008029</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 42, 469</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>4</prism:issueIdentifier>
    <prism:publicationDate>1238769024</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Article</prism:section>
    <prism:startingPage>469</prism:startingPage>
    <prism:volume>42</prism:volume>
  </rss:item>
  <rss:item rdf:about="http://www.edpsciences.org/10.1051/ro:2008030">
    <rss:title>Comparing Imperfection Ratio and Imperfection Index for Graph Classes</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro:2008030</rss:link>
    <rss:description> Authors: Arie M.C.A. Koster and Annegret K. Wagler &lt;br/&gt;RAIRO-Oper. Res. 42, 485 (2009) Received May 24, 2007. Accepted January 09, 2008&lt;br/&gt; Keywords: Perfect graphs, imperfection ratio, imperfection index.</rss:description>
    <dc:title>Comparing Imperfection Ratio and Imperfection Index for Graph Classes</dc:title>
    <dc:creator>Arie M.C.A. Koster</dc:creator>
    <dc:creator>Annegret K. Wagler</dc:creator>
    <dc:subject>Perfect graphs</dc:subject>
    <dc:subject>imperfection ratio</dc:subject>
    <dc:subject>imperfection index.</dc:subject>
    <dc:subject>05C17</dc:subject>
    <dc:subject>90C57.</dc:subject>
    <dc:date>2009-04-03T14:30:24Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro:2008030</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 42, 485</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>4</prism:issueIdentifier>
    <prism:publicationDate>1238769024</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Article</prism:section>
    <prism:startingPage>485</prism:startingPage>
    <prism:volume>42</prism:volume>
  </rss:item>
</rdf:RDF>
