Semi‐labeled unrooted binary tree optimization subject to nonnegativity

DOI10.1002/net.22090OpenAlexW4210566354MaRDI QIDQ6066249

Unnamed Author, Nicholas C. Wormald

Publication date: 12 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22090

zbMATH Keywords

neighborhood searchiterated local searchresidual sum of squaresnonnegativity constraintoptimal weighted treeunrooted binary tree optimization

Mathematics Subject Classification ID

Statistical methods; risk measures (91G70) Trees (05C05) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Portfolio theory (91G10) Signed and weighted graphs (05C22)

Cites Work

• Cluster analysis for portfolio optimization
• Combinatorics of least-squares trees
• Analyzing Crisis in Global Financial Indices
• Tree Spanners

This page was built for publication: Semi‐labeled unrooted binary tree optimization subject to nonnegativity