-
The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut
International audience -
Geometrical Method Using Simplicial Cones for Overdetermined Nonnegative Blin...
International audience -
Growth and micromagnetism of self-assembled epitaxial fcc(111) cobalt dots
International audience -
Two Node-Disjoint Hop-Constrained Survivable Network Design and Polyhedra
Given a weighted undirected graph G with a set of pairs of terminals {si, ti}, i = 1, ..., d, and an integer L ≥ 2, the two node-disjoint hop-constrained survivable... -
A Way to Model Relevance in Information Retrieval
International audience -
Using Conceptual Graphs in a Multifaceted Logical Model for Information Retri...
International audience -
A branch-and-cut algorithm for the k-edge connected subgraph problem
International audience
