The matching relaxation for a class of generalized set partitioning problems

This paper introduces a discrete relaxation for the class of combinatorial optimization problems which can be described by a set partitioning formulation under packing constraints. We present two combinatorial relaxations based on computing maximum weighted matchings in suitable graphs. Besides providing dual bounds, the relaxations are also used on a variable reduction technique and a matheuristic. We show how that general method can be tailored to sample applications, and also perform a successful computational evaluation with benchmark instances of a problem in maritime logistics.Comment: 33 pages. A preliminary (4-page) version of this paper was presented at CTW 2016 (Cologne-Twente Workshop on Graphs and Combinatorial Optimization), with proceedings on Electronic Notes in Discrete Mathematic

Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007

The 6th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2007) was held at the University of Twente, The Netherlands, 29-31 May, 2007. The CTW started as a series of biennial meetings at the Universities of Cologne in Germany and Twente in the Netherlands. Ever increasing interest has turned the CTW into a now annual event with the Politecnico di Milano, the University of Duisburg-Essen, the Universit degli Studi di Milano, and Ecole Polytechnique in Paris as additional partners. The scope of the workshop comprises the theory and applications of discrete algorithms, graphs, and combinatorial structures in the wide sense. After the workshop, the participants and the research community at large were invited to submit research articles relating to the themes of the workshop. As guest editors, we are pleased to present a collection of articles that were selected from the submissions by the refereeing process. We thank all the contributors for making it so easy to document the workshop and the state-of-the-art with interesting articles and we hope that you, the reader, will find these contributions stimulating as well

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization

International audienceThe Cologne-Twente Workshop (CTW) on Graphs and Combinatorial Optimization started off as a series of workshops organized bi-annually by either Köln University or Twente University. As its importance grew over time, it re-centered its geographical focus by including northern Italy (CTW04 in Menaggio, on the lake Como and CTW08 in Gargnano, on the Garda lake). This year, CTW (in its eighth edition) will be staged in France for the first time: more precisely in the heart of Paris, at the Conservatoire National d’Arts et Métiers (CNAM), between 2nd and 4th June 2009, by a mixed organizing committee with members from LIX, Ecole Polytechnique and CEDRIC, CNAM