<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://purl.org/atom/ns#" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:sy="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="0.3">
  <title>RAIRO - Operations Research - Current Issue</title>
  <link rel="alternate" href="http://journals.cambridge.org/action/displayJournal?jid=ROE" />
  <info />
  <entry>
    <title>Volume 47 Issue 03</title>
    <link rel="alternate" href="http://journals.cambridge.org/action/displayIssue?jid=ROE&amp;volumeId=47&amp;issueId=03&amp;seriesId=0" />
    <modified>2013-06-30T23:00:00Z</modified>
    <summary type="html" mode="xml">RAIRO - Operations Research, Volume 47 Issue 03&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;table border='0'&gt;&lt;tr&gt;&lt;td&gt;  RAIRO-Operations Research  is an international journal publishing high-level pure and applied research papers on all aspects of Operations Research. The papers submitted to the journal must be original, well written and make a significant contribution. All papers published in RAIRO-Operations Research are critically refereed according to international standards.   Every effort is made by the Editorial Board to ensure a quick review and give a first answer concerning a submitted paper within three months, and a final decision in a period of time not exceeding six months.    RAIRO-Operations Research  is concerned with the following types of papers:        theory and methodology papers;      case studies describing the solution to an actual problem arising, for example, in Transports, Telecommunications, Production Systems, Financial Planning, Computational Biology, Energy or Computer Science;      state-of-the art surveys that provide a synthesis and comprehensive review of one particular area of interest. Prospective authors of surveys are requested to contact first the Editor-in Chief or an Area Editor;      short communications permitting quick publication, within three months, of short and concise papers limited to 10 journal pages.    RAIRO-Operations Research  also publishes special issues on topics of interest related to Operations Research. An issue may be a collection of original articles, a single research monograph or a selection of papers from a conference. Each issue has one or more guest editors, who do not need to be members of the editorial board. Prospective guest editors are encouraged to contact the Editor-in-Chief.    RAIRO-Operations Research  is published under the under the scientific responsibility of ROADEF (French Society of Operations Research and Decision Aid) and SMAI (French Society of Industrial and Applied Mathematics) by the publisher EDP Sciences, and distributed by Cambridge University Press.   Marketed and distributed on behalf of    EDP Sciences  &lt;/td&gt;&lt;td&gt;&lt;a href='http://journals.cambridge.org/jid_ROE'&gt;&lt;img src='http://journals.cambridge.org/cover_images/ROE/ROE.jpg' align='right' border='1' alt='RAIRO - Operations Research'/&gt;&lt;/a&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;br/&gt;&lt;a href='http://api.addthis.com/oexchange/0.8/forward/facebook/offer?pco=tbx32nj-1.0&amp;url=http%3A%2F%2Fjournals.cambridge.org%2Faction%2FdisplayIssue%3Fjid%3DROE%26volumeId%3D47%26issueId%3D03%26seriesId%3D0&amp;pubid=xa-502df628072bfd96' target='_blank' &gt;&lt;img src='http://cache.addthiscdn.com/icons/v1/thumbs/32x32/facebook.png' border='0' alt='Facebook' width='25' height='25' /&gt;&lt;/a&gt;&lt;a href='http://api.addthis.com/oexchange/0.8/forward/twitter/offer?pco=tbx32nj-1.0&amp;url=http%3A%2F%2Fjournals.cambridge.org%2Faction%2FdisplayIssue%3Fjid%3DROE%26volumeId%3D47%26issueId%3D03%26seriesId%3D0&amp;pubid=xa-502df628072bfd96' target='_blank' &gt;&lt;img src='http://cache.addthiscdn.com/icons/v1/thumbs/32x32/twitter.png' border='0' alt='Twitter' width='25' height='25' /&gt;&lt;/a&gt;&lt;a href='http://api.addthis.com/oexchange/0.8/forward/mendeley/offer?pco=tbx32nj-1.0&amp;url=http%3A%2F%2Fjournals.cambridge.org%2Faction%2FdisplayIssue%3Fjid%3DROE%26volumeId%3D47%26issueId%3D03%26seriesId%3D0&amp;pubid=xa-502df628072bfd96' target='_blank' &gt;&lt;img src='http://cache.addthiscdn.com/icons/v1/thumbs/32x32/mendeley.png' border='0' alt='Mendeley' width='25' height='25' /&gt;&lt;/a&gt;&lt;a href='http://api.addthis.com/oexchange/0.8/forward/email/offer?pco=tbx32nj-1.0&amp;url=http%3A%2F%2Fjournals.cambridge.org%2Faction%2FdisplayIssue%3Fjid%3DROE%26volumeId%3D47%26issueId%3D03%26seriesId%3D0&amp;pubid=xa-502df628072bfd96' target='_blank' &gt;&lt;img src='http://cache.addthiscdn.com/icons/v1/thumbs/32x32/email.png' border='0' alt='Email' width='25' height='25' /&gt;&lt;/a&gt;&lt;a href='http://www.addthis.com/bookmark.php?source=tbx32nj-1.0&amp;=250&amp;pubid=xa-502df628072bfd96&amp;url=http%3A%2F%2Fjournals.cambridge.org%2Faction%2FdisplayIssue%3Fjid%3DROE%26volumeId%3D47%26issueId%3D03%26seriesId%3D0' target='_blank'  &gt;&lt;img src='http://cache.addthiscdn.com/icons/v1/thumbs/32x32/more.png' border='0' alt='More...' width='25' height='25' /&gt;&lt;/a&gt;</summary>
    <dc:date>2013-06-30T23:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Solving the Minimum Independent Domination Set Problem in           Graphs by Exact Algorithm and Greedy Heuristic</title>
    <link rel="alternate" href="http://journals.cambridge.org/action/displayAbstract?fromPage=online&amp;aid=8910037" />
    <summary type="html" mode="xml">Research Articles &lt;br /&gt;Christian Laforest, Raksmey Phan,  &lt;br /&gt;&lt;a href='http://journals.cambridge.org/jid_ROE'&gt;RAIRO - Operations Research&lt;/a&gt;, &lt;a href='http://journals.cambridge.org/action/displayIssue?jid=ROE&amp;volumeId=47&amp;issueId=03&amp;seriesId=0'&gt;Volume 47 Issue 03&lt;/a&gt;, pp 199-221&lt;br /&gt;&lt;br /&gt;&lt;a href='http://journals.cambridge.org/action/displayAbstract?fromPage=online&amp;aid=8910037'&gt;Abstract&lt;/a&gt;&lt;br/&gt;&lt;a href='http://api.addthis.com/oexchange/0.8/forward/facebook/offer?pco=tbx32nj-1.0&amp;url=http%3A%2F%2Fjournals.cambridge.org%2Faction%2FdisplayAbstract%3FfromPage%3Donline%26aid%3D8910037&amp;pubid=xa-502df628072bfd96' target='_blank' &gt;&lt;img src='http://cache.addthiscdn.com/icons/v1/thumbs/32x32/facebook.png' border='0' alt='Facebook' width='25' height='25'/&gt;&lt;/a&gt;&lt;a href='http://api.addthis.com/oexchange/0.8/forward/twitter/offer?pco=tbx32nj-1.0&amp;url=http%3A%2F%2Fjournals.cambridge.org%2Faction%2FdisplayAbstract%3FfromPage%3Donline%26aid%3D8910037&amp;pubid=xa-502df628072bfd96' target='_blank' &gt;&lt;img src='http://cache.addthiscdn.com/icons/v1/thumbs/32x32/twitter.png' border='0' alt='Twitter' width='25' height='25'/&gt;&lt;/a&gt;&lt;a href='http://api.addthis.com/oexchange/0.8/forward/mendeley/offer?pco=tbx32nj-1.0&amp;url=http%3A%2F%2Fjournals.cambridge.org%2Faction%2FdisplayAbstract%3FfromPage%3Donline%26aid%3D8910037&amp;pubid=xa-502df628072bfd96' target='_blank' &gt;&lt;img src='http://cache.addthiscdn.com/icons/v1/thumbs/32x32/mendeley.png' border='0' alt='Mendeley' width='25' height='25'/&gt;&lt;/a&gt;&lt;a href='http://api.addthis.com/oexchange/0.8/forward/email/offer?pco=tbx32nj-1.0&amp;url=http%3A%2F%2Fjournals.cambridge.org%2Faction%2FdisplayAbstract%3FfromPage%3Donline%26aid%3D8910037&amp;pubid=xa-502df628072bfd96' target='_blank' &gt;&lt;img src='http://cache.addthiscdn.com/icons/v1/thumbs/32x32/email.png' border='0' alt='Email' width='25' height='25'/&gt;&lt;/a&gt;&lt;a href='http://www.addthis.com/bookmark.php?source=tbx32nj-1.0&amp;=250&amp;pubid=xa-502df628072bfd96&amp;url=http%3A%2F%2Fjournals.cambridge.org%2Faction%2FdisplayAbstract%3FfromPage%3Donline%26aid%3D8910037' target='_blank'  &gt;&lt;img src='http://cache.addthiscdn.com/icons/v1/thumbs/32x32/more.png' border='0' alt='More...' width='25' height='25'/&gt;&lt;/a&gt;</summary>
  </entry>
</feed>

