Guest Editors: Arie Koster, Michael Poss
Robust optimization has become a central framework to handle the uncertainty that arises in the parameters of optimization problems. While classical RO results can efficiently handle linear programs for a large variety of uncertainty sets, the situation is more complex for optimization problems involving discrete decisions. Efficient exact or approximate solution algorithms for such problems must exploit the combinatorial structure of the problems at hand. The aim of the special issue is to invite high-quality manuscripts addressing robust combinatorial optimization problems and presenting convincing numerical results.
A special interest shall be devoted to papers considering extensions of well-known uncertainty sets. Possible topics include, but are not restricted to:
Following the journal high standards, we expect high-quality contributions that will undergo the strict reviewing process of EJCO. Submission deadline is July 15, 2017.
Submissions must have some computational aspect (as per the journal name).
All articles will be thoroughly refereed according to the high standards of the EURO Journal on Computational Optimization.
To submit your paper to this special issue,
1. Log on the editorial manager of the journal using the via the website https://www.editorialmanager.com/ejco/
2. Select Submit New Manuscript in the main menu
3. In the drop down list associated with Choose Article Type, select ("SI: Robust Combinatorial Optimisation").
Accepted papers will be published online individually, before print publication.
This work is licensed under a Creative Commons Attribution-ShareAlike 3.0 International License and the GNU Free Documentation License (unversioned, with no invariant sections, front-cover texts, or back-cover texts).