The submission deadline is Thursday December 8, 2011, 11:59 UTC -11 time.
Paper submission will be handled via Easy Chair.
Papers presenting original unpublished results in all areas of combinatorial optimization and its applications are welcome.
Topics of interest include, but are not limited to:
- Approximation algorithms
- Branch-and-bound algorithms
- Branch-and-cut-and-price algorithms
- Computational biology
- Computational complexity
- Computational geometry
- Constraint Programming
- Cutting plane algorithms
- Exact and parameterized algorithms
- Graph and network algorithms
- Interior point methods
- Linear and nonlinear integer programming
- Local search algorithms
- Metaheuristics
- On-line algorithms
- Polyhedral combinatorics
- Randomized algorithms
- Scheduling algorithms
There will be two types of submissions:
a) Regular papers
They should be of at most 12 pages, including front matter and bibliography, in LNCS style. 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 submissions to other conferences with published proceedings or journals are 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. The authors will have to prepare their camera-ready version two weeks after the end of ISCO 2012.
b) Short papers
They should be of at most 4 pages (including front matter and bibliography) with no optional appendix. Accepted short papers will be included in a volume of local proceedings.