2018

Heure:	12:30 - 13:30
Lieu:	Salle B107, bâtiment B, Université de Villetaneuse
Résumé:	Decomposition methods for quadratic programming
Description:	Emiliano Traversi The purpose of this talk is to present two decomposition methods for quadratic problems. First, we propose a methodological analysis on a family of reformulations combining Dantzig-Wolfe decomposition and Quadratic Convex Reformulation principles for binary quadratic problems. As a representative case study, we apply them to a cardinality constrained quadratic knapsack problem. Secondly, we analyze a simplicial decomposition like algorithmic framework that handles convex quadratic programs in an effective way. In particular, we propose two tailored strategies for solving the master problem and we describe a few techniques for speeding up the solution of the pricing problem. We report extensive numerical experiments on both real-world and generic quadratic programs.

Heure:	12:30 - 13:30
Lieu:	Salle B107, bâtiment B, Université de Villetaneuse
Résumé:	On the Interplay between Simple Mixed Integer Programs and Lot-Sizing
Description:	Laurence A. Wolsey After introducing some of the most basic lot-sizing problems and their properties, we show how the study of tight MIP formulations for the convex hull of solutions of such problems has provided more general results for MIPs and vice versa. In particular we demonstrate the importance of compact extended formulations as well as the role of mixing sets, network dual MIPs and single node flow models.

Heure:	12:30 - 13:30
Lieu:	Salle B107, bâtiment B, Université de Villetaneuse
Résumé:	Complexity of the cluster deletion problem on cographs and subclasses of chordal graphs
Description:	Mario Valencia Pabon We consider the following vertex-partition problem on graphs, known as the CLUSTER DELETION (CD) problem: given a graph with real nonnegative edge weights, partition the vertices into clusters (in this case, cliques) to minimize the total weight of edges outside the clusters. The decision version of this optimization problem is known to be NP-complete even for unweighted graphs and has been studied extensively. In this talk, I will focus on the complexity of the decision CD problem for the family of chordal graphs, showing that it is NP-complete for weighted split graphs, weighted interval graphs and unweighted chordal graphs. We will also see that the problem is NP-complete for weighted cographs. Some polynomial-time solvable cases of the optimization problem will be identified, in particular CD for unweighted cographs, split graphs, unweighted proper interval graphs and weighted block graphs. This is a joint work with Flavia Bonomo and Guillermo Duràn (University of Buenos Aires).