<?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:2008005"/>
        <rdf:li resource="http://www.edpsciences.org/10.1051/ro:2008006"/>
        <rdf:li resource="http://www.edpsciences.org/10.1051/ro:2008007"/>
        <rdf:li resource="http://www.edpsciences.org/10.1051/ro:2008008"/>
        <rdf:li resource="http://www.edpsciences.org/10.1051/ro:2008009"/>
        <rdf:li resource="http://www.edpsciences.org/10.1051/ro:2008010"/>
        <rdf:li resource="http://www.edpsciences.org/10.1051/ro:2008011"/>
        <rdf:li resource="http://www.edpsciences.org/10.1051/ro:2008012"/>
        <rdf:li resource="http://www.edpsciences.org/10.1051/ro:2008013"/>
      </rdf:Seq>
    </items>
    <sy:updatePeriod>weekly</sy:updatePeriod>
    <sy:updateFrequency>1</sy:updateFrequency>
    <sy:updateBase>2008-05-16T13:53:06Z</sy:updateBase>
    <dc:publisher>EDP Sciences</dc:publisher>
    <dc:rights>Copyright (c) 2008 </dc:rights>
    <prism:copyright>Copyright (c) 2008 </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:2008005">
    <rss:title>A logarithm barrier method for semi-definite programming</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro:2008005</rss:link>
    <rss:description> Authors: Jean-Pierre Crouzeix and Bachir Merikhi &lt;br/&gt;RAIRO-Oper. Res. 42, 123 (2008) Received September 01, 2006. Accepted September 01, 2006&lt;br/&gt; Keywords: Linear semi-definite programming, barrier methods, line-search.</rss:description>
    <dc:title>A logarithm barrier method for semi-definite programming</dc:title>
    <dc:creator>Jean-Pierre Crouzeix</dc:creator>
    <dc:creator>Bachir Merikhi</dc:creator>
    <dc:subject>Linear semi-definite programming</dc:subject>
    <dc:subject>barrier methods</dc:subject>
    <dc:subject>line-search.</dc:subject>
    <dc:subject>90C22</dc:subject>
    <dc:subject>90C05</dc:subject>
    <dc:subject>90C51.</dc:subject>
    <dc:date>2008-05-16T13:53:06Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro:2008005</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 42, 123</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>2</prism:issueIdentifier>
    <prism:publicationDate>1210945986</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Article</prism:section>
    <prism:startingPage>123</prism:startingPage>
    <prism:volume>42</prism:volume>
  </rss:item>
  <rss:item rdf:about="http://www.edpsciences.org/10.1051/ro:2008006">
    <rss:title>Solution approaches to large shift scheduling problems</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro:2008006</rss:link>
    <rss:description> Authors: Monia Rekik, Jean-François Cordeau and François Soumis &lt;br/&gt;RAIRO-Oper. Res. 42, 229 (2008) Received May 31, 2007. Accepted November 28, 2007.&lt;br/&gt; Keywords: Shift scheduling, flexibility, fractionable breaks, work stretch restrictions, forward and backward constraints, local branching, heuristic.</rss:description>
    <dc:title>Solution approaches to large shift scheduling problems</dc:title>
    <dc:creator>Monia Rekik</dc:creator>
    <dc:creator>Jean-François Cordeau</dc:creator>
    <dc:creator>François Soumis</dc:creator>
    <dc:subject>Shift scheduling</dc:subject>
    <dc:subject>flexibility</dc:subject>
    <dc:subject>fractionable breaks</dc:subject>
    <dc:subject>work stretch restrictions</dc:subject>
    <dc:subject>forward and backward constraints</dc:subject>
    <dc:subject>local branching</dc:subject>
    <dc:subject>heuristic.</dc:subject>
    <dc:subject>90C10</dc:subject>
    <dc:subject>90C11</dc:subject>
    <dc:subject>90C29.</dc:subject>
    <dc:date>2008-05-16T13:53:06Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro:2008006</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 42, 229</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>2</prism:issueIdentifier>
    <prism:publicationDate>1210945986</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Article</prism:section>
    <prism:startingPage>229</prism:startingPage>
    <prism:volume>42</prism:volume>
  </rss:item>
  <rss:item rdf:about="http://www.edpsciences.org/10.1051/ro:2008007">
    <rss:title>La différentiation automatique et son utilisation en optimisation</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro:2008007</rss:link>
    <rss:description> Author: Jean-Pierre Dussault&lt;br/&gt;RAIRO-Oper. Res. 42, 141 (2008) Received May 31, 2007; accepted November 28, 2007&lt;br/&gt; Keywords: Différentiation automatique, algorithmes numériques d'optimisation.</rss:description>
    <dc:title>La différentiation automatique et son utilisation en optimisation</dc:title>
    <dc:creator>Jean-Pierre Dussault</dc:creator>
    <dc:subject>Différentiation automatique</dc:subject>
    <dc:subject>algorithmes numériques d'optimisation.</dc:subject>
    <dc:subject>90C.</dc:subject>
    <dc:date>2008-05-16T13:53:06Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro:2008007</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 42, 141</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>2</prism:issueIdentifier>
    <prism:publicationDate>1210945986</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Article</prism:section>
    <prism:startingPage>141</prism:startingPage>
    <prism:volume>42</prism:volume>
  </rss:item>
  <rss:item rdf:about="http://www.edpsciences.org/10.1051/ro:2008008">
    <rss:title>Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro:2008008</rss:link>
    <rss:description> Authors: A. El Afia, A. Benchakroun, J.-P. Dussault and K. El Yassini &lt;br/&gt;RAIRO-Oper. Res. 42, 157 (2008) Received October 16, 2006&lt;br/&gt; Keywords: Logarithmic barrier, Penalty algorithms.</rss:description>
    <dc:title>Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications</dc:title>
    <dc:creator>A. El Afia</dc:creator>
    <dc:creator>A. Benchakroun</dc:creator>
    <dc:creator>J.-P. Dussault</dc:creator>
    <dc:creator>K. El Yassini</dc:creator>
    <dc:subject>Logarithmic barrier</dc:subject>
    <dc:subject>Penalty algorithms.</dc:subject>
    <dc:subject>90C30.</dc:subject>
    <dc:date>2008-05-16T13:53:06Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro:2008008</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 42, 157</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>2</prism:issueIdentifier>
    <prism:publicationDate>1210945986</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Article</prism:section>
    <prism:startingPage>157</prism:startingPage>
    <prism:volume>42</prism:volume>
  </rss:item>
  <rss:item rdf:about="http://www.edpsciences.org/10.1051/ro:2008009">
    <rss:title>Generic Primal-dual Interior Point Methods Based on a New Kernel Function</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro:2008009</rss:link>
    <rss:description> Authors: M. EL Ghami and C. Roos &lt;br/&gt;RAIRO-Oper. Res. 42, 199 (2008) Received February 9, 2007. Accepted November 28, 2007&lt;br/&gt; Keywords: Linear optimization, primal-dual interior-point algorithm, large and small-update method.</rss:description>
    <dc:title>Generic Primal-dual Interior Point Methods Based on a New Kernel Function</dc:title>
    <dc:creator>M. EL Ghami</dc:creator>
    <dc:creator>C. Roos</dc:creator>
    <dc:subject>Linear optimization</dc:subject>
    <dc:subject>primal-dual interior-point algorithm</dc:subject>
    <dc:subject>large and small-update method.</dc:subject>
    <dc:subject>90C05</dc:subject>
    <dc:subject>90C31.</dc:subject>
    <dc:date>2008-05-16T13:53:06Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro:2008009</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 42, 199</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>2</prism:issueIdentifier>
    <prism:publicationDate>1210945986</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Article</prism:section>
    <prism:startingPage>199</prism:startingPage>
    <prism:volume>42</prism:volume>
  </rss:item>
  <rss:item rdf:about="http://www.edpsciences.org/10.1051/ro:2008010">
    <rss:title>New representation to reduce the search space for the resource-constrained project scheduling problem</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro:2008010</rss:link>
    <rss:description> Authors: Khaled Moumene and Jacques A. Ferland &lt;br/&gt;RAIRO-Oper. Res. 42, 215 (2008) Received June 01, 2005. Accepted November 28, 2007.&lt;br/&gt; Keywords: Project scheduling, Resource-constrained project scheduling, Activity list representation, Activity set list representation, Heuristics and metaheuristics.</rss:description>
    <dc:title>New representation to reduce the search space for the resource-constrained project scheduling problem</dc:title>
    <dc:creator>Khaled Moumene</dc:creator>
    <dc:creator>Jacques A. Ferland</dc:creator>
    <dc:subject>Project scheduling</dc:subject>
    <dc:subject>Resource-constrained project scheduling</dc:subject>
    <dc:subject>Activity list representation</dc:subject>
    <dc:subject>Activity set list representation</dc:subject>
    <dc:subject>Heuristics and metaheuristics.</dc:subject>
    <dc:subject>90B35.</dc:subject>
    <dc:date>2008-05-16T13:53:06Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro:2008010</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 42, 215</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>2</prism:issueIdentifier>
    <prism:publicationDate>1210945986</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Article</prism:section>
    <prism:startingPage>215</prism:startingPage>
    <prism:volume>42</prism:volume>
  </rss:item>
  <rss:item rdf:about="http://www.edpsciences.org/10.1051/ro:2008011">
    <rss:title>Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro:2008011</rss:link>
    <rss:description> Authors: Alain Billionnet, Sourour Elloumi and Marie-Christine Plateau &lt;br/&gt;RAIRO-Oper. Res. 42, 103 (2008) Received January 1, 2006. Accepted November 28, 2007&lt;br/&gt; Keywords: Combinatorial optimization, quadratic 0–1 programming, linear reformulation, quadratic convex reformulation.</rss:description>
    <dc:title>Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations</dc:title>
    <dc:creator>Alain Billionnet</dc:creator>
    <dc:creator>Sourour Elloumi</dc:creator>
    <dc:creator>Marie-Christine Plateau</dc:creator>
    <dc:subject>Combinatorial optimization</dc:subject>
    <dc:subject>quadratic 0–1 programming</dc:subject>
    <dc:subject>linear reformulation</dc:subject>
    <dc:subject>quadratic convex reformulation.</dc:subject>
    <dc:subject>90C10</dc:subject>
    <dc:subject>90C11</dc:subject>
    <dc:subject>90C20.</dc:subject>
    <dc:date>2008-05-16T13:53:06Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro:2008011</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 42, 103</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>2</prism:issueIdentifier>
    <prism:publicationDate>1210945986</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Article</prism:section>
    <prism:startingPage>103</prism:startingPage>
    <prism:volume>42</prism:volume>
  </rss:item>
  <rss:item rdf:about="http://www.edpsciences.org/10.1051/ro:2008012">
    <rss:title>Existence of solutions to weak nonlinear bilevel problems via MinSup and d.c. problems</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro:2008012</rss:link>
    <rss:description> Authors: Abdelmalek Aboussoror and Abdelatif Mansouri &lt;br/&gt;RAIRO-Oper. Res. 42, 87 (2008) Received September 1, 2006. Accepted November 11, 2007&lt;br/&gt; Keywords: \mathop{\rm Min}\mathop{\rm Sup} problems, variational convergence, bilevel programming, d.c. programming.</rss:description>
    <dc:title>Existence of solutions to weak nonlinear bilevel problems via MinSup and d.c. problems</dc:title>
    <dc:creator>Abdelmalek Aboussoror</dc:creator>
    <dc:creator>Abdelatif Mansouri</dc:creator>
    <dc:subject>\mathop{\rm Min}\mathop{\rm Sup} problems</dc:subject>
    <dc:subject>variational convergence</dc:subject>
    <dc:subject>bilevel programming</dc:subject>
    <dc:subject>d.c. programming.</dc:subject>
    <dc:subject>49K35</dc:subject>
    <dc:subject>90C47</dc:subject>
    <dc:subject>91A44</dc:subject>
    <dc:subject>46N10.</dc:subject>
    <dc:date>2008-05-16T13:53:06Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro:2008012</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 42, 87</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>2</prism:issueIdentifier>
    <prism:publicationDate>1210945986</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Article</prism:section>
    <prism:startingPage>87</prism:startingPage>
    <prism:volume>42</prism:volume>
  </rss:item>
  <rss:item rdf:about="http://www.edpsciences.org/10.1051/ro:2008013">
    <rss:title>Editorial: Éditorial</rss:title>
    <rss:link>http://www.edpsciences.org/10.1051/ro:2008013</rss:link>
    <rss:description> Authors: A. Benchakroun and A. Mansouri &lt;br/&gt;RAIRO-Oper. Res. 42, 85 (2008) &lt;br/&gt;</rss:description>
    <dc:title>Editorial: Éditorial</dc:title>
    <dc:creator>A. Benchakroun</dc:creator>
    <dc:creator>A. Mansouri</dc:creator>
    <dc:date>2008-05-16T13:53:06Z</dc:date>
    <dc:format>text/html</dc:format>
    <dc:identifier>doi:10.1051/ro:2008013</dc:identifier>
    <dc:source>RAIRO-Oper. Res. 42, 85</dc:source>
    <prism:category>abstract</prism:category>
    <prism:issueIdentifier>2</prism:issueIdentifier>
    <prism:publicationDate>1210945986</prism:publicationDate>
    <prism:publicationName>RAIRO - Operations Research</prism:publicationName>
    <prism:section>Editorial</prism:section>
    <prism:startingPage>85</prism:startingPage>
    <prism:volume>42</prism:volume>
  </rss:item>
</rdf:RDF>
