We show that the Balanced Minimum Evolution Problem (BMEP) is a cross-entropy minimization problem. This new perspective both extends the previous interpretations of the BMEP length function described in the literature and enables the identification of an efficiently computable family of lower bounds on the value of the optimal solution to the problem.
We show that the Balanced Minimum Evolution Problem (BMEP) is a cross-entropy minimization problem. This new perspective both extends the previous interpretations of the BMEP length function described in the literature and enables the identification of an efficiently computable family of lower bounds on the value of the optimal solution to the problem. (C) 2020 Elsevier B.V. All rights reserved.
Autori: | ||
Data di pubblicazione: | 2020 | |
Titolo: | An Information Theory Perspective on the Balanced Minimum Evolution Problem | |
Rivista: | OPERATIONS RESEARCH LETTERS | |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1016/j.orl.2020.04.010 | |
Volume: | 48 | |
Appare nelle tipologie: | 2.1 Articolo su rivista |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
ORL200212DC.pdf | post-print | Documento in Post-print | Accesso chiuso-personale | Riservato |