Special Issues

Papers presenting original unpublished results in all areas of combinatorial optimization and its applications are welcome.

Accepted regular papers (with up to 12 pages) will be published by Springer-Verlag in the Lecture Notes in Computer Science (LNCS) series in a post-conference proceedings volume. For a paper to be included in this volume, it should be presented at the conference by one of the authors. The authors will have to prepare their camera-ready version before the 4th April of 2014.


A special issue of Discrete Optimization on "Combinatorial Optimization" will also be associated to ISCO2014

The deadline for submission is the 31st of July 2014.

Topics of interest include, but are not limited to:

                Approximation algorithms                                      Graph and network algorithms

                Branch-and-bound algorithms                               Interior point methods

                Branch-and-cut-and-price algorithms                   Linear and nonlinear integer programming

                Computational biology                                           Local search algorithms

                Computational complexity                                     Metaheuristics

                Computational geometry                                       On-line algorithms

                Constraint Programming                                       Polyhedral combinatorics

                Cutting plane algorithms                                        Randomized algorithms

                Exact and parameterized algorithms                    Scheduling algorithms