CfP: ISCO 2022 – International Symposium on Combinatorial Optimization

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.

ISCO 2022 will be held online (May 18-20, 2022) and will be preceded by a Spring School (May 16-17, 2022) given by Giacomo Nannicini on „Mathematical Optimization and Quantum Algorithms“ which is dedicated to PhD students but the lectures are also open to other colleagues.

Conference website:

There are two types of submissions:
– Regular papers up to 12 pages. The post-conference proceedings will be published by Springer (LNCS series). For an accepted paper to be included in the proceedings, it should be presented at the conference by one of the authors. The authors of accepted papers will have to prepare their camera-ready version two weeks after the end of the conference. More information about the submission procedure will be available in the web site of the conference in due time.
– Extended abstracts up to 3 pages. Accepted abstracts will be published online on the conference website (and will not be included in the post-conference proceedings).


– Submission deadline: February 15, 2022 (regular papers) and March 31, 2022 (extended abstracts)
– Notifications: April 20, 2022
– Registration deadline: May 10, 2022
– Spring school: May 16-17, 2022
– Online conference: May 18-20, 2022

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

    Jon Lee, University of Michigan, USA
    Petra Mutzel, Bonn University, Germany
    Rekha R. Thomas, University of Washington, USA
    Rico Zenklusen, ETH Zurich, Switzerland

    Ivana Ljubic, conference chair (ESSEC Business School of Paris, France)
    Francisco Barahona, co-chair  (IBM, J. Watson, New York, USA)
    Santanu Dey, co-chair (Georgia Institute of Technology, USA)
    A. Ridha Mahjoub, co-chair (Paris Dauphine University, France)


    P. Fouilhoux (Université Sorbonne Paris Nord, France)
    I. Ljubic (ESSEC Business School of Paris, France)
    A. Ridha Majhoub (Paris Dauphine University, France)

    M. Baïou (CNRS, Clermont-Auvergne University, France)
    P. Fouilhoux (Université Sorbonne Paris Nord, France)
    L. Gouveia (University of Lisbon, Portugal)
    N. Maculan (Federal University of Rio de Janeiro, Brasil)
    A. R. Mahjoub (Paris Dauphine University, France)
    V. Paschos (Paris Dauphine University, France)
    G. Rinaldi (IASI, Roma, Italy)

Kommentar verfassen

Trage deine Daten unten ein oder klicke ein Icon um dich einzuloggen:

Du kommentierst mit Deinem Abmelden /  Ändern )


Du kommentierst mit Deinem Twitter-Konto. Abmelden /  Ändern )


Du kommentierst mit Deinem Facebook-Konto. Abmelden /  Ändern )

Verbinde mit %s