Gilles Caporossi

Back

Cahiers du GERAD

86 results — page 5 of 5

and

Given a set of <i>m</i> observations on <i>n</i> variables, an 0(<i>mn</i><sup>2</sup>) algorithm is proposed to find a basis of all affine relations betwee...

BibTeX reference
, , , and

The recently developed Variable Neighborhood Search (VNS) meta-heuristic for combinatorial and global optimization is outlined together with its specializat...

BibTeX reference
, , , and

The chemical trees on <i>n</i> vertices (= molecular graphs representing alkanes with <i>n</i> carbon atoms) with minimal, second-minimal, third-minimal, ma...

BibTeX reference
, , , and

Let <i>G</i> be a connected graph and let <i>D</i> be its diameter. Denote by <i>d</i>(<i>G,k</i>) the number of pairs of vertices in <i>G</i> that are at d...

BibTeX reference
and

An algorithm based upon the boundary-edges code and the reverse search method is proposed for enumerating non-isomorphic planar simply connected polyhexes. ...

BibTeX reference
and

Finding extremal graphs for expressions involving one or more invariants is viewed as a problem of combinatorial optimization. The recent Variable Neighborh...

BibTeX reference