Miguel F. Anjos, PhD

Kyoto-Montreal research collaboration on discrete optimization and its applications

Project Leaders:

David Avis and Kazuo Iwama

Principal members:

Objectives:

• To combine the research efforts of two major research groups in discrete optimization, one in Kyoto and one in Montreal.
• To solve concrete problems, contributing to the training of young researchers in computer science and optimization

Events:

• April-July 2012: Project start-up in Kyoto: Working group on evacuation models, polyhedral computation and machine learning

  Lieu : Kyoto University
  Organizers: M. F. Anjos and D. Avis

• January-April 2012: Project start-up: Working group on computing a Nash equilibrium and on evacuation models

  Location: GERAD
  Organizers: M. F. Anjos and D. Avis

Related Events:

• August 27-September 7 2012: MLSS '12 Kyoto: 21st Machine Learning Summer School

Project summary:

Discrete optimization is a branch of computer science and applied mathematics which has shown remarkable theoretical and practical development in recent years. It combines the techniques of combinatorial analysis, linear programming and the theory of algorithms with the goal of solving optimization problems with discrete decision variables. We will consider the five subprojects below:

1. Evacuation models
2. Efficient generation of molecules in biology and chemistry
3. Generation of a Nash equilibrium by the primal-dual interior point method
4. Application of polyhedral computation to machine learning
5. Discrete muliflows in networks