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

Youcef Abdelsadek et al. (2015)

> Home

Details and statistics

DOI: 10.1016/J.CIE.2014.12.006

access: closed

type: Journal Article

metadata version: 2020-02-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/candie/AbdelsadekHKO15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/candie/AbdelsadekHKO15
Youcef Abdelsadek, Francine Herrmann, Imed Kacem, Benoît Otjacques:
Branch-and-bound algorithm for the maximum triangle packing problem. Comput. Ind. Eng. 81: 147-157 (2015)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.