Nos tutelles

CNRS Dauphine PSL *

Rechercher





Accueil > SEMINAIRES

Séminaires du Pôle 2 : "Optimisation combinatoire, algorithmique"

publié le , mis à jour le

Organisation.

Fabio Furini et Florian Sikora

Liste de diffusion.

Possibilité de s’inscrire à la liste de diffusion en envoyant un email à :
florian . sikora @ dauphine . fr

Les séminaires ont lieu en général le lundi à 14h.

Prochains séminaires.

lundi 2 octobre 2017, 14h, P303 : Giuseppe F. Italiano (Universita’ di Roma "Tor Vergata") :
2-Connectivity in Directed Graphs

We survey some recent results on 2-edge and 2-vertex
connectivity in directed graphs. Despite being complete analogs of the
corresponding notions on undirected graphs, in digraphs 2-connectivity
has a much richer and more complicated structure. For undirected
graphs it has been known for over 40 years how to compute all bridges,
articulation points, 2-edge- and 2-vertex-connected components in
linear time, by simply using depth first search. In the case of
digraphs, however, the very same problems have been much more
challenging and have been tackled only very recently.

Séminaires précédents.

Exposés de 2016-2017.
Exposés de 2015-2016.
Exposés de 2014-2015.

Pour les exposés antérieurs, voir cette page.

Agenda

séminaire

  • Lundi 27 mars 14:00-16:00 - Valia Mitsou

    On the complexity of defective coloring

    Notes de dernières minutes : B203 : (LIRIS, Lyon1) :


  • Lundi 3 avril 14:00-15:00 - Valentin Garnero - (INRIA COATI)

    Seminaire de Valentin Garnero : On augmenting matchings via bounded-length augmentations

    Lieu : P 301


  • Jeudi 20 avril 13:30-14:30 - Aurélie Lagoutte - G-SCOP

    Séminaire d’Aurélie Lagoutte

    Lieu : C110


  • Vendredi 28 avril 14:15-15:30 - Edouard Bonnet

    Séminaire d’Edouard Bonnet

    Lieu : D120


  • Jeudi 11 mai 14:00-15:00 - Giorgio Lucarelli - Grenoble

    Séminaire pole 2 de Giorgio Lucarelli

  • Lundi 12 juin 14:00-15:00 - Emily Speakman

    Séminaire pole 2 Emily Speakman

    Résumé : Title : Quantifying Double McCormick : Some Geometric Insight for Global Optimization Algorithms
    When using the standard McCormick inequalities twice to convexify trilinear monomials, as is often the practice in modeling and software, there is a choice of which variables to group first. For the important case in which the domain is a nonnegative box, we calculate the volume of the resulting relaxation, as a function of the bounds defining the box. In this manner, we precisely quantify the strength of the different possible relaxations defined by all three groupings, in addition to the trilinear hull itself. As a by product, we characterize the best double McCormick relaxation.


  • Lundi 26 juin 14:00-15:00 - Stéphane Canu - LITIS - INSA de Rouen

    Séminaire de Stéphane Canu - Variable selection and outlier detection as a MIP

    Résumé : Title : Variable selection and outlier detection as a MIP
    Abstract : Dimension reduction or feature selection is an effective strategy to handle contaminated data and to deal with high dimensionality while providing better prediction. To deal with outlier proneness and spurious variables, we propose a method performing the outright rejection of discordant observations together with the selection of relevant variables. To solve this problem, it is recasted as a mixed integer program which allows the use of efficient commercial solver. Also we propose an alternate projected gradient algorithm (proximal) so get a nice appoximated solution.

    Lieu : A304

    Notes de dernières minutes : Séminaire commun Pole 2 / Pole 3


  • Lundi 3 juillet 14:00-15:00 - Roland Grappe - LIPN

    Séminaire pole 2 : Roland Grappe

    Lieu : D 102


  • Lundi 10 juillet 14:00-15:00 - Jon Lee

    Séminaire pole 2 : Jon Lee

  • 1 | 2

Ajouter un événement iCal