Aggregation and disaggregation in convex network problems

DOI10.1002/NET.3230120203MaRDI QIDQ3945964zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(1)

• A note on node aggregation and Benders' decomposition

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

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