Optimum Network Partitioning

DOI10.1287/OPRE.19.4.916MaRDI QIDQ5624997zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(6)

• 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
• Approximations to clustering and subgraph problems on trees
• An effective structured approach to finding optimal partitions of networks
• Tree partitioning under constraints. -- Clustering for vehicle routing problems
• Decomposition algorithms for locating minimal cuts in a network

This page was built for publication: Optimum Network Partitioning

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