Branch-and-bound algorithm for the maximum triangle packing problem

Youcef Abdelsadek, Francine Herrmann, Imed Kacem, Benoît Otjacques. Branch-and-bound algorithm for the maximum triangle packing problem. Computers & Industrial Engineering, 81:147-157, 2015. [doi]

@article{AbdelsadekHKO15,
  title = {Branch-and-bound algorithm for the maximum triangle packing problem},
  author = {Youcef Abdelsadek and Francine Herrmann and Imed Kacem and Benoît Otjacques},
  year = {2015},
  doi = {10.1016/j.cie.2014.12.006},
  url = {http://dx.doi.org/10.1016/j.cie.2014.12.006},
  researchr = {https://researchr.org/publication/AbdelsadekHKO15},
  cites = {0},
  citedby = {0},
  journal = {Computers & Industrial Engineering},
  volume = {81},
  pages = {147-157},
}