Aggregation and disaggregation in convex network problems

DOI10.1002/NET.3230120203zbMath0485.90080OpenAlexW2038518451MaRDI QIDQ3945964

Paul Zipkin

Publication date: 1982

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

disaggregationerror boundslarge convex-cost networkmode aggregation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05)

Related Items (1)

A note on node aggregation and Benders' decomposition

This page was built for publication: Aggregation and disaggregation in convex network problems