The IPCO conference is held every year, except for those years in which the 'International Symposium on Mathematical Programming' takes place. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.
Authors are invited to submit extended abstracts of their recent work by November 15, 2010; see the submission page for more information. The program committee will select the papers to be presented on the basis of the submitted extended abstracts. Contributions are expected to be original, unpublished and not submitted to journals or conferences with proceedings before the notification date (January 31, 2011). Papers violating these requirements will not be considered by the Program Committee.
During the conference, approximately 30-35 papers will be presented in single-track sessions. Each lecture will be 30 minutes long. The proceedings will be published as Springer Lecture Notes in Computer Science. They will contain full texts of all presented papers. Each participant will receive a copy at the conference.