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 2020 that was held on May 4–6, 2020. Originally, the conference was to be held at HEC Montreal and the University of Montreal, Canada, but due to the COVID-19 pandemic the conference was held online. This special issue is open to papers that were not presented at the conference. Contributions arising from papers given at the symposium should be substantially extended and should cite the conference paper.
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 submissions will be thoroughly refereed according to the high standards of Discrete Applied Mathematics.
Full papers must be submitted through the Elsevier Editorial Manager 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 2020, 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 special issue article type ISCO 2020.
The deadline for submission is September 30, 2021.
Accepted papers will be published online individually, before print publication.
Additional information about the special issue can be obtained from the Guest Editors.