• Heuristics for Longest Edge Selection in Simplicial Branch and Bound 

      Herrera, Juan F.R.; Casado, Leocadio G.; Hendrix, Eligius Maria Theodorus; García-Fernández, Inmaculada (2015-07-06)
      Simplicial partitions are suitable to divide a bounded area in branch and bound. In the iterative re nement process, a popular strategy is to divide simplices by their longest edge, thus avoiding needle-shaped simplices. ...