Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004

Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey
2005 Mathematical programming  
The present issue contains selected papers presented at the 2004 Aussois Workshop on Combinatorial Optimization. This workshop has become a well-known institution: that brings together senior and younger researchers who share their enthusiasm for the field. It is an occasion for fruitful encounters, exciting presentations and quiet work in ad-hoc groups leading to lasting partnerships. This is why this workshop has been integrated into the activities of the network ADONET gathering members from
more » ... ten countries and sponsored by the 6th Frame Program of the European Union. Thus Aussois has indeed become an important and highly appreciated contact surface for the young researchers from that network, a fact reflected by several of the present papers. Furthermore, the papers collected in this issue nicely illustrate that the year 2004 brought many exciting new developments to combinatorial optimization. The papers were grouped into the two categories theory and computation. The first includes contributions to the advancement of the theory of combinatorial optimization and related fields, in particular polyhedral combinatorics, optimization on graphs and other finite structures, as well as complexity issues. The second group contains contributions addressing issues in modeling and computation, an area of immediate practical impact. In particular several papers describe advances in mixed integer programming, others include novel applications in biology and finance as well as the more traditional but in no-way easier ones stemming from logistics in particular. However, it is worth noting that most papers in both groups propose or are motivated by models approaching real life problems. Indeed, such problems are an important, if not the most important, driving force of the discipline. This certainly doesn't mean that the reader will not find beautiful mathematics in the following pages, indeed the opposite is true. Here is a quick overview of the contents: Theory -Recognizing Balanceable Matrices by M. Conforti and G. Zambelli This paper deals with recognizing balanceable 0/1 matrices, that can be signed such that they become balanced. A polynomial time algorithm is proposed that explicitly T.M. Liebling: EPFL
doi:10.1007/s10107-005-0646-8 fatcat:4bz5pe2l6befdcciyr4szet6oe