posted by system || 2632 views || tracked by 9 users: [display]

IPCO 2010 : The 14th Conference on Integer Programming and Combinatorial Optimization


Conference Series : Integer Programming and Combinatorial Optimization
When Jun 9, 2010 - Jun 11, 2010
Where Lausanne, Switzerland
Submission Deadline Nov 20, 2009
Notification Due Jan 31, 2010
Categories    combinatorial optimization   algorithms

Call For Papers

Announcement and Call for Papers

for the Fourteenth Conference on Integer Programming and Combinatorial Optimization
June 9-11, 2010 EPFL Lausanne, Switzerland

The IPCO conference is held every year, except for those years in which the 'Symposium on Mathematical Programming' takes place. The conference is meant to be 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 in these areas. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in topics such as:

* algorithmic game theory
* approximation algorithms
* branch and bound algorithms
* branch and cut algorithms
* computational biology
* computational complexity
* computational geometry
* conic programing
* cutting plane algorithms
* diophantine equations
* geometry of numbers
* graph and network algorithms
* integer programming
* matroids and submodular functions
* mixed integer programming
* nonlinear integer programming
* on-line algorithms and competitive analysis
* polyhedral combinatorics
* randomized algorithms
* random graphs
* scheduling theory and scheduling algorithms
* semidefinite programs

In all these areas, IPCO welcomes structural and algorithmic results, revealing computational studies, and novel applications of these techniques to practical problems.
Contributions are expected to be original, unpublished and not submitted to journals or conferences before the notification date (January 31, 2010). Papers violating these requirements will not be considered by the Program Committee.
During the conference, approximately 30-35 papers will be presented in a series of non-parallel sessions. Each lecture will be 30 minutes long. The program committee will select the papers to be presented on the basis of the submitted extended abstracts. See the submission page for more information.
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.

Important Dates

Abstract submission:
Nov 20, 2009

Jan 31, 2010

June 9-11, 2010

Related Resources

CP 2018   Twenty-Fourth Conference on Principles and Practice of Constraint Programming
COLT 2018   Computational Learning Theory
ISMP 2018   The 23rd International Symposium on Mathematical Programming
COLT 2018   Conference on Learning Theory
CGDEIJ 2018   Computer Game Development and Education
CP 2018   24th International Conference on Principles and Practice of Constraint Programming
CTW 2018   16th Cologne-Twente Workshop (CTW18) on Graphs and Combinatorial Optimization
MathSJ 2018   Applied Mathematics and Sciences: An International Journal
IWCT 2018   7th International Workshop on Combinatorial Testing
DBDM 2018   6th International Conference on Database and Data Mining