Bounds for aggregating nodes in network problems

DOI10.1007/BF01581638MaRDI QIDQ3885553zbMATH OpenFDO

Authors Paul Zipkin

Publication date 1980

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01581638

zbMATH Keywords

error boundsa priori boundslarge scale networksa posteriori boundslinear minimum-cost network-flow problemsnodes aggregation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Error analysis and interval analysis (65G99)

Cites work

• scientific article; zbMATH DE number 3469876 (Why is no real title available?)
• Approximations of Dynamic Programs, I
• Fundamental Queries in Aggregation Theory
• Solution of Large-Scale Transportation Problems Through Aggregation

Cited in

(12)

• Assessing the demand vulnerability of equilibrium traffic networks via network aggregation
• Using error bounds to compare aggregated generalized transportation models
• An improved disaggregation method for transportation problems
• A procedure for optimizing tactical response in oil spill clean up operations
• A note on node aggregation and Benders' decomposition
• A survey of dynamic network flows
• The multicommodity assignment problem: A network aggregation heuristic
• Integrated ad delivery planning for targeted display advertising
• Strategic planning in forest industries
• Integrated facility location and production scheduling in multi-generation energy systems
• Error bounds for the aggregated convex programming problem
• A simulation study of some simplification strategies in the development of product-mix models

This page was built for publication: Bounds for aggregating nodes in network problems

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