IPCO: Integer Programming and Combinatorial Optimization

FacebookTwitterLinkedInGoogle

 

Past:   Proceedings on DBLP

Future:  Post a CFP for 2015 or later   |   Invite the Organizers Email

 
 

All CFPs on WikiCFP

Event When Where Deadline
IPCO 2014 Integer Programming and Combinatorial Optimization
Jun 23, 2014 - Jun 25, 2014 Bonn, Germany Nov 15, 2013
IPCO 2013 The 16th Conference on Integer Programming and Combinatorial Optimization
Mar 18, 2013 - Mar 20, 2013 Valparaíso - Chile Oct 24, 2012
IPCO 2010 The 14th Conference on Integer Programming and Combinatorial Optimization
Jun 9, 2010 - Jun 11, 2010 Lausanne, Switzerland Nov 20, 2009
 
 

Present CFP : 2014

Call for Papers for the
17th Conference on
Integer Programming and Combinatorial Optimization
(IPCO XVII)
to be held at
Bonn, Germany,
June 23-25, 2014


Conference website for additional details and paper submission:
http://www.or.uni-bonn.de/ipco/


The IPCO 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, 2013; see the submission guidelines 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, 2014). Papers violating these requirements will not be considered by the Program Committee.

During the conference, approximately 33 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 extended abstracts of all accepted submissions. It is expected that revised and extended versions will subsequently be submitted for publication in appropriate journals. Each participant will receive a copy of the proceedings at the conference.


Important Dates:
Submission deadline: November 15, 2013 (23:59 CET).
Notification date: January 31, 2014
Conference: June 23-25, 2014


Program Committee:

Flavia Bonomo (Universidad de Buenos Aires)
Sam Burer (University of Iowa)
Gérard Cornuéjols (Carnegie Mellon University)
Satoru Fujishige (Kyoto University)
Michael Jünger (Universität zu Köln)
Matthias Köppe (University of California, Davis)
Jon Lee, chair (University of Michigan)
Jeff Linderoth (University of Wisconsin)
Jean-Philippe Richard (University of Florida)
András Sebő (CNRS, Laboratoire G-SCOP, Grenoble)
Maxim Sviridenko (University of Warwick)
Chaitanya Swamy (University of Waterloo)
Jens Vygen (Universität Bonn)
David P. Williamson (Cornell University)
Laurence Wolsey (Université catholique de Louvain)
 

Related Resources

IWOCA 2017   28th International Workshop on Combinatorial Algorithms
CGO 2018   2018 IEEE/ACM International Symposium on Code Generation and Optimization
SI: COMPUTERS & OR 2017   SI: COMPUTERS & OR 2017 : Special issue on DATA ANALYTICS and OPTIMIZATION at COMPUTERS & OPERATIONS RESEARCH (Elsevier)
COCOA 2017   International Conference on Combinatorial Optimization and Applications
LOPAL 2018   International Conference on Learning and Optimization Algorithms: Theory and Applications
PaSeO 2017   Parallel Search and Optimisation
ECSO 2017   2nd European Conference on Stochastic Optimization
CSPA 2018   14th IEEE Colloquium on Signal Processing and its Applications (CSPA 2018)
ASPLOS 2018   23rd International Conference on Architectural Support for Programming Languages and Operating Systems
Optim 2017   Call for Book Chapters: Optimization Techniques for Problem Solving in Uncertainty