References of "Simeone, Bruno"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailThe Mathematics of Peter L. Hammer (1936-2006): Graphs, Optimization, and Boolean Models
Boros, Endre; Crama, Yves ULg; de Werra, Dominique et al

in Annals of Operations Research (2011), 188

This volume contains a collection of papers published in memory of Peter L. Hammer (1936-2006). Peter Hammer made substantial contributions to several areas of operations research and discrete mathematics ... [more ▼]

This volume contains a collection of papers published in memory of Peter L. Hammer (1936-2006). Peter Hammer made substantial contributions to several areas of operations research and discrete mathematics, including, in particular, mathematical programming (linear and quadratic 0--1 programming, pseudo-Boolean optimization, knapsack problems, etc.), combinatorial optimization (transportation problems, network flows, MAXSAT, simple plant location, etc.), graph theory (special classes of graphs, stability problems, and their applications), data mining and classification (Logical Analysis of Data), and, last but not least, Boolean theory (satisfiability, duality, Horn functions, threshold functions, and their applications). The volume contains 23 contributed papers along these lines. [less ▲]

Detailed reference viewed: 51 (9 ULg)
Full Text
See detailPeter Ladislaw Hammer (1936-2006)
Boros, Endre; Crama, Yves ULg; Simeone, Bruno

in 4OR : Quarterly Journal of the Belgian, French and Italian Operations Research Societies (2007), 5(1), 1-4

Detailed reference viewed: 40 (8 ULg)
Full Text
Peer Reviewed
See detailConsensus algorithms for the generation of all maximal bicliques
Alexe, Gabriela; Alexe, Sorin; Crama, Yves ULg et al

in Discrete Applied Mathematics (2004), 145(1 Sp. Iss. SI), 11-21

We describe a new algorithm for generating all maximal bicliques (i.e. complete bipartite. not necessarily induced subgraphs) of a graph. The algorithm is inspired by, and is quite similar to. the ... [more ▼]

We describe a new algorithm for generating all maximal bicliques (i.e. complete bipartite. not necessarily induced subgraphs) of a graph. The algorithm is inspired by, and is quite similar to. the consensus method used in propositional logic. We show that some variants of the algorithm are totally polynomial, and even incrementally polynomial. The total complexity of the most efficient variant of the algorithms presented here is polynomial in the input size. and only linear in the output size. Computational experiments demonstrate its high efficiency on randomly generated graphs with up to 2000 vertices and 20,000 edges. (C) 2003 Elsevier B.V. All rights reserved. [less ▲]

Detailed reference viewed: 54 (6 ULg)