Partitioning of biweighted trees

DOI10.1002/NAV.10003MaRDI QIDQ4533449zbMATH OpenOpenAlexFDO

Authors Andrea Pacifici, Alessandro Agnetis, Pitu B. Mirchandani

Publication date 11 June 2002

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2108/34725

zbMATH Keywords

facility locationbicriteria optimizationnetwork partitioningbalanced p-cover

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Recommendations

• On finding connected balanced partitions of trees
• Partitioning a Weighted Tree to Subtrees of Almost Uniform Size
• A shifting algorithm for continuous tree partitioning
• Balanced partitions of trees and applications
• Partitioning a weighted tree into subtrees with weights in a given range

Cited in

(7)

• Partitioning a weighted tree into subtrees with weights in a given range
• Partitioning a Weighted Tree to Subtrees of Almost Uniform Size
• Partitioning technique for transforming perfect binary trees into single-row networks
• Balanced partitions of trees and applications
• Continuous bottleneck tree partitioning problems
• A shifting algorithm for continuous tree partitioning
• Constrained domatic bipartition on trees

This page was built for publication: Partitioning of biweighted trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4533449)