Call for paper – Special Issue of Discrete Applied Mathematics on Combinatorial Optimization
Call for Papers
Special Issue of Discrete Applied Mathematics on Combinatorial Optimization
We invite submissions of novel research articles for a forthcoming issue of Discrete Applied Mathematics on Combinatorial Optimization.
This special issue will be dedicated to the International Symposium on Combinatorial Optimization ISCO 2018 that was held in Marrakesh, Morocco, April 11-13, 2018. However it is also open to papers that have not been presented at the conference. Contributions arising from papers given at the symposium should be substantially extended, and should cite the conference paper where appropriate.
High quality research papers are solicited to address theoretical as well as practical issues of Combinatorial Optimization. Topics of interest include, but are not limited to:
-
approximation algorithms
-
cutting planes algorithms
-
polyhedral combinatorics
-
local search algorithms
-
computational complexity
-
graph and network algorithms
-
linear and nonlinear (mixed-) integer programming
All articles will be thoroughly refereed according to the high standards of Discrete Applied Mathematics.
The full papers must be submitted through the Elsevier Editorial System (http://ees.elsevier.com/dam). When submitting your paper, be sure to specify that the paper is a contribution for the Special Issue of ISCO 2018, so that your paper is assigned to the guest editors. Please see the Author Instructions on the site if you have not yet submitted a paper through this web-based system. Be sure to select the article type S.I.: Combinatorial Optimization 2018.
The deadline for submission is November 30, 2018.
Accepted papers will be published online individually, before print publication.
Additional information about the special issue can be obtained from the Guest Editors.
We are looking forward to receiving your contribution.
Guest Editors:
Jon Lee, jonxlee_at_umich.edu
A. Ridha Mahjoub, ridha.mahjoub_at_lamsade.dauphine.fr
Giovanni Rinaldi, rinaldi_at_iasi.cnr.it