An international Symposium on Combinatorial Optimization will be held in Hammamet,
Tunisia, March 24-26, 2010. The symposium aims to bring together
researchers from combinatorial optimization, and from related fields of
operations research and linear and integer programming. It
is intended to be a forum for the exchange of recent scientific
developments and for the discussion of new trends. The scope of the
conference includes all aspects of combinatorial optimization from
fundamental research to numerical applications. Topics Topics include, but are not limited to: - Applications of combinatorial optimization
- Approximation algorithms
- Branch-and-bound algorithms
- Branch-and-cut-and-price algorithms
- Local search algorithms
- Computational complexity
- Computational biology
- Computational geometry
- Constraint Programming
- Cutting plane algorithms
- Graph and network algorithms
- Linear and integer programming
- Metaheuristics
- Interior point methods
- On-line algorithms and competitive analysis
- Polyhedral combinatorics
- Randomized algorithms
- Scheduling theory & algorithms
You can download, print and broadcast the ISCO conference poster (A2) or the Call-To-Paper (A4). | 
