CALL FOR PAPERS / SUBMISSION
Important Dates
Submissions deadline: December 22, 2013
Notification of authors: February 6, 2014
Early registration deadline: February 15, 2014
Early Registration deadline for Spring School: February 15, 2014
Spring School: March 3 - 4, 2014
Conference: March 5 - 7, 2014
Camera ready version: April 4, 2014
Papers presenting original unpublished results in all areas of combinatorial optimization and its applications are welcome. There will be two types of submissions:
- Regular papers
Regular papers should have at most 12 pages, including front matter and bibliography, in LNCS style (see http://www.springer.de/comp/lncs/authors.html). Proofs omitted due to space constraints should be included in a clearly marked appendix which will be taken into account by the program committee members and the reviewers, but it will not be published in the proceedings. Simultaneous submission to other conferences with published proceedings or journals is not allowed.
Accepted regular papers 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 two weeks after the end of ISCO 2014.
Regular papers must also contain an abstract of one page to be included in the abstract booklet.
Papers will be submitted in Easy Chair using the following link
When submitting in Easy Chair, the abstract must be filled in a field called "abstract" (only text)
- Abstracts
They should be 1 page (including front matter) with no optional appendix. Accepted abstracts will appear in the abstract booklet.
Abstracts will be submitted in Easy Chair using the following link
When submitting in Easy Chair, the abstract must be filled in a field called "abstract" (only text)
Special issues
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