Optimum Network Partitioning

DOI10.1287/opre.19.4.916zbMath0219.90048OpenAlexW2011837828MaRDI QIDQ5624997

Paul A. Jensen

Publication date: 1971

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.19.4.916

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Related Items (6)

An effective structured approach to finding optimal partitions of networks ⋮ Tree partitioning under constraints. -- Clustering for vehicle routing problems ⋮ Balancing modular transfer lines with serial-parallel activation of spindle heads at stations ⋮ Branch and bound algorithm for a transfer line design problem: stations with sequentially activated multi-spindle heads ⋮ Decomposition algorithms for locating minimal cuts in a network ⋮ Approximations to clustering and subgraph problems on trees

This page was built for publication: Optimum Network Partitioning