Book of abstracts

Call for paper for the DAM special issue dedicated to ISCO 2022

ISCO (International Symposium on Combinatorial Optimization) is a biennial symposium whose aim is to bring together researchers from all the communities related to combinatorial optimization, including algorithms and complexity, mathematical programming, operations research, optimization under uncertainty, graphs and combinatorics. 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.

The first issue of ISCO was 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, its  fourth one in Vietri, Italy in May 2016, its fifth one in Marrakesh, Morocco in April 2018. Originally, the sixth ISCO conference was to be held at HEC Montreal and the University of Montreal, Canada, but due to the COVID-19 pandemic the conference was held online focusing on long papers.

This seventh issue will be held online.

ISCO 2022 conference will be preceded by a Spring School  which is dedicated to PhD students but the lectures are also open to other colleagues.
Lecturer: Giacomo Nannicini, Thomas J. Watson Research Center, Yorktown Heights, NY USA
Topic: Mathematical Optimization and Quantum Algorithms

Important dates:

- Submission deadline: February 15  March 6 2022 (regular papers) and March 31, 2022 (extended abstracts)

- Notifications: April 20, 2022 

- Registration deadline: May 16, 2022

- Spring school: May 16-17, 2022

- Online conference: May 18-20, 2022

--------------------------------

Plenaries and opening sessions: https://us02web.zoom.us/j/81100173104?pwd=HTAZbKF9g2xEHgWl3y68G3v4oSyj9L.1

Room A: https://us02web.zoom.us/j/87648241056?pwd=WRN3X1G8cfkMeuYj-zKWYPCR82jQv0.1

Room B: https://us06web.zoom.us/j/82457905136?pwd=bU0vWkRKc0tXQWxiSFl5a2dFbHJWdz09

Social gathering and coffee breaks: https://isco2022.sciencesconf.org/resource/page/id/11

--------------------------------

CALL FOR PAPERS

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

ISCO website