Partitioning of biweighted trees

DOI10.1002/nav.10003zbMath0996.90051OpenAlexW2119483253MaRDI QIDQ4533449

Andrea Pacifici, Pitu B. Mirchandani, Alessandro Agnetis

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 locationnetwork partitioningbicriteria optimizationbalanced p-cover

Mathematics Subject Classification ID

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

Related Items (1)

Continuous bottleneck tree partitioning problems

This page was built for publication: Partitioning of biweighted trees