A note on node aggregation and Benders' decomposition

DOI10.1007/BF02591733zbMath0533.90031OpenAlexW2063230070MaRDI QIDQ3316926

Jeremy F. Shapiro

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

logisticsBenders' decomposition442.90097485.90080approximating large scale transportation problemslarge scale capacitated plant locationNode aggregation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05)

Cites Work

• Unnamed Item
• Bounds for aggregating nodes in network problems
• Inverse Optimization: An Application to the Capacitated Plant Location Problem
• Aggregation and disaggregation in convex network problems
• Exact and Approximate Cost Functions for Product Aggregates
• Cross decomposition for mixed integer programming

This page was built for publication: A note on node aggregation and Benders' decomposition