SCHOOL ON INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION
June 4-7 2001, Coimbra, Portugal


The school will consist of informal morning lectures and goal-oriented afternoon discussion sessions. Professor
Gerard Cornuéjols plans to lecture during the mornings introducing cutting-edge research topics in integer programming and combinatorial optimization. The afternoons will be devoted to present and discuss open problems and research directions at a variety of levels that could be of primary interest to doctoral students and post-docs. The theme of the school will be polyhedral aspects of integer programming and combinatorial optimization.

The school will be held at the historical Hotel Quinta das Lágrimas, located within walking distance of downtown
Coimbra, offering a unique environment for research discussion. The four days of the school will also include visits to the old part of the University of Coimbra and to the roman ruins of Conimbriga.

Professor Gerard Cornuéjols (recent papers here) is a leading researcher in the study of polyhedral and graph-theoretic methods for combinatorial-optimization problems. He is the author of some fundamental and difficult contributions to the study of balanced matrices, balanced 0,+1,-1 matrices, perfect 0,+1,-1 matrices, ideal 0,1 matrices, and balanced hypergraphs. He was co-winner of the Lanchester Prize in 1977 (Operations Research Society of America) and the Fulkerson Prize in 2000 (Mathematical Programming Society and American Mathematical Society). He has held a CORE Fellowship (1981-82), a Von Humboldt Fellowship (1982), a CNRS Fellowship (1985-86) and a DIMACS Fellowship (1993). Professor Cornuéjols is Editor of Mathematics of Operations Research and an Associate Editor of Operations Research Letters.


Last updated: January 31st, 2001 by João Soares