<div dir="ltr"><span style="font-size:12.8px">Dear Colleague</span><br style="font-size:12.8px"><br style="font-size:12.8px"><span style="font-size:12.8px">We are pleased to announce the Call for Papers for the Special Issue </span><span style="font-size:12.8px">of the EURO </span><span style="font-size:12.8px">Journal on Computational </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">Optimization</span><span style="font-size:12.8px">, dedicated to </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">Robust</span><span style="font-size:12.8px"> </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">Combinatorial </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">Optimi<wbr>zation</span><span style="font-size:12.8px">. </span><div><span class="m_-619590635644373987gmail-il" style="font-size:12.8px"><br></span></div><div><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">Robust</span><span style="font-size:12.8px"> </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">optimization</span><span style="font-size:12.8px"> has become a central framework to handle the uncertainty </span><span style="font-size:12.8px">that arises in the parameters of </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">optimization</span><span style="font-size:12.8px"> problems. While classical RO </span><span style="font-size:12.8px">results can efficiently handle linear programs for a large variety of </span><span style="font-size:12.8px">uncertainty sets, the situation is more complex for </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">optimization </span><span style="font-size:12.8px">problems involving discrete decisions. Efficient exact or approximate solution </span><span style="font-size:12.8px">algorithms for such problems must exploit the </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">combinatorial</span><span style="font-size:12.8px"> structure of </span><span style="font-size:12.8px">the problems at hand. The aim of the special issue is to invite </span><span style="font-size:12.8px">high-quality manuscripts addressing </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">robust</span><span style="font-size:12.8px"> </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">combinatoria<wbr>l</span><span style="font-size:12.8px"> </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">optimization </span><span style="font-size:12.8px">problems and presenting convincing numerical results. A special interest </span><span style="font-size:12.8px">shall be devoted to papers considering extensions of well-known uncertainty </span><span style="font-size:12.8px">sets. Possible topics include, but are not restricted to:</span><br style="font-size:12.8px"><span style="font-size:12.8px">* valid inequalities for </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">robust</span><span style="font-size:12.8px"> MILPs,</span><br style="font-size:12.8px"><span style="font-size:12.8px">* decomposition algorithms for </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">robust</span><span style="font-size:12.8px"> MILPs,</span><br style="font-size:12.8px"><span style="font-size:12.8px">* constraint programming approaches to </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">robust</span><span style="font-size:12.8px"> </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">combinatorial</span><span style="font-size:12.8px"> </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">optimi<wbr>zation</span><span style="font-size:12.8px">,</span><br style="font-size:12.8px"><span style="font-size:12.8px">* heuristic and meta-heuristic algorithms for hard </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">robust</span><span style="font-size:12.8px"> </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">combinatorial </span><span style="font-size:12.8px">prob<wbr>lems,</span><br style="font-size:12.8px"><span style="font-size:12.8px">* ad-hoc </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">combinatorial</span><span style="font-size:12.8px"> <wbr>algorithms,</span><br style="font-size:12.8px"><span style="font-size:12.8px">* novel applications of </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">robust</span><span style="font-size:12.8px"> </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">combinatorial</span><span style="font-size:12.8px"> </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">optimi<wbr>zation</span><span style="font-size:12.8px">,</span><br style="font-size:12.8px"><span style="font-size:12.8px">* multi-stage integer </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">robust</span><span style="font-size:12.8px"> </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">optimization</span><span style="font-size:12.8px">,</span><br style="font-size:12.8px"><span style="font-size:12.8px">* recoverable </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">robust</span><span style="font-size:12.8px"> </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">optimizatio<wbr>n</span><span style="font-size:12.8px">,</span><br style="font-size:12.8px"><span style="font-size:12.8px">* alternative </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">robust</span><span style="font-size:12.8px"> </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">combinatori<wbr>al</span><span style="font-size:12.8px"> frameworks (min-max regret, light</span><br style="font-size:12.8px"><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">robustness</span><span style="font-size:12.8px">, ...).</span></div><div><br style="font-size:12.8px"><span style="font-size:12.8px">Following the journal high standards, we expect high-quality contributions that </span><span style="font-size:12.8px">will undergo the strict reviewing process of EJCO. Submission deadline is </span><span style="font-size:12.8px">July 15 2017.</span><br style="font-size:12.8px"><br style="font-size:12.8px"><span style="font-size:12.8px">In order to submit a paper for the special issue,</span><br style="font-size:12.8px"><span style="font-size:12.8px">1. Log on the editorial manager using the <Author Login> via the website</span><br style="font-size:12.8px"><a href="https://www.editorialmanager.com/ejco/" rel="noreferrer" style="font-size:12.8px" target="_blank">https://www.editorialmanager.c<wbr>om/ejco/</a><br style="font-size:12.8px"><span style="font-size:12.8px">2. Select <Submit New Manuscript> in the main menu.</span><br style="font-size:12.8px"><span style="font-size:12.8px">3. In the drop down list associated with <Choose Article Type> select </span><span style="font-size:12.8px">the desired </span><span style="font-size:12.8px">special issue </span><span style="font-size:12.8px">(</span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">SI</span><span style="font-size:12.8px">: </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">Robust</span><span style="font-size:12.8px"> </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">Combinatoria<wbr>l</span><span style="font-size:12.8px"> Optimisation). Note that all entries </span><span style="font-size:12.8px">corresponding </span><span style="font-size:12.8px">to the special </span><span style="font-size:12.8px">issues start with </span><span class="m_-619590635644373987gmail-il" style="font-size:12.8px">SI</span><span style="font-size:12.8px">.</span><br style="font-size:12.8px"><br style="font-size:12.8px"><span style="font-size:12.8px">We are looking forward to receiving your contributions.</span><br style="font-size:12.8px"><br style="font-size:12.8px"><span style="font-size:12.8px">The Guest Editors</span><br style="font-size:12.8px"><span style="font-size:12.8px">Arie Koster, RWTH Aachen University, Germany,</span><br style="font-size:12.8px"><span style="font-size:12.8px">Michael Poss, LIRMM, CNRS, France</span></div></div>