Bounds for aggregating nodes in network problems
From MaRDI portal
Publication:3885553
DOI10.1007/BF01581638zbMath0442.90097MaRDI QIDQ3885553
Publication date: 1980
Published in: Mathematical Programming (Search for Journal in Brave)
a priori boundserror boundslarge scale networksa posteriori boundslinear minimum-cost network-flow problemsnodes aggregation
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Error analysis and interval analysis (65G99)
Related Items
Integrated Ad Delivery Planning for Targeted Display Advertising ⋮ Assessing the demand vulnerability of equilibrium traffic networks via network aggregation ⋮ Using error bounds to compare aggregated generalized transportation models ⋮ Integrated facility location and production scheduling in multi-generation energy systems ⋮ The multicommodity assignment problem: A network aggregation heuristic ⋮ A survey of dynamic network flows ⋮ A simulation study of some simplification strategies in the development of product-mix models ⋮ A note on node aggregation and Benders' decomposition ⋮ A procedure for optimizing tactical response in oil spill clean up operations ⋮ An improved disaggregation method for transportation problems ⋮ Error bounds for the aggregated convex programming problem ⋮ Strategic planning in forest industries
Cites Work
