Special issue: Robust Combinatorial Optimisation

Guest Editors: Arie Koster, Michael Poss

 

  • Deadline for submission: July 15, 2017

 

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:

  • valid inequalities for robust MILPs
  • decomposition algorithms for robust MILPs
  • constraint programming approaches to robust combinatorial optimization
  • heuristic and meta-heuristic algorithms for hard robust combinatorial problems
  • ad-hoc combinatorial algorithms
  • novel applications of robust combinatorial optimization
  • multi-stage integer robust optimization
  • recoverable robust optimization
  • alternative robust combinatorial frameworks (min-max regret, light robustness, ...)

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 using the Author Login 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.



Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License and the GNU Free Documentation License (unversioned, with no invariant sections, front-cover texts, or back-cover texts).

EURO-Online login

 

Sign Up for e-Newsletter

 

EURO Publications