ISCO (Integer Symposium on Combinatorial Optimization) is a biennial symposium with its first issue held in Hammamet, Tunisia in March 2010, its second one in Athens, Greece in April 2012, its third one in Lisbon, Portugal in March 2014, and its fourth one is Vietri, Italy in May 2016. The symposium aims to bring together researchers from all the communities related to combinatorial optimization, including algorithms and complexity, mathematical programming and operations research. It is intended to be a forum for presenting original research in these areas and especially in their intersections. Quality papers on all aspects of combinatorial optimization, from mathematical foundations and theory of algorithms to computational studies and practical applications, are solicited.

Previous editions: ISCO2010 in Hammamet, Tunisia, ISCO2012 in Athens, Greece, ISCO2014 in Lisboa, Portugal, ISCO2016 in Vietri-sul-Mare (Salerno), Italy. See the ISCO webpage.

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 algorithm
  • Metaheuristic
  • Multiobjective optimization
  • On-line algorithms
  • Polyhedral combinatorics
  • Randomized algorithms
  • Scheduling algorithms