A branch and bound algorithm to compute a median permutation - Archive ouverte HAL Access content directly
Conference Papers Year : 2012
Not file

Dates and versions

hal-02286697 , version 1 (13-09-2019)

Identifiers

  • HAL Id : hal-02286697 , version 1

Cite

Olivier Hudry. A branch and bound algorithm to compute a median permutation. Algorithms & Permutations 2012, Feb 2012, Paris, France. ⟨hal-02286697⟩
29 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More