A note on node aggregation and Benders' decomposition

DOI10.1007/BF02591733MaRDI QIDQ3316926zbMATH OpenOpenAlexFDO

Authors 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

442.90097485.90080approximating large scale transportation problemsBenders' decompositionlarge scale capacitated plant locationlogisticsNode aggregation

Mathematics Subject Classification ID

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

Recommendations

• Aggregation in hub location problems
• scientific article; zbMATH DE number 949665
• The Benders dual decomposition method
• scientific article; zbMATH DE number 4020811
• A Decomposition Algorithm for a Discrete Location-Allocation Problem

Cites work

• Aggregation and disaggregation in convex network problems
• Bounds for aggregating nodes in network problems
• Cross decomposition for mixed integer programming
• Exact and Approximate Cost Functions for Product Aggregates
• scientific article; zbMATH DE number 3791939 (Why is no real title available?)
• Inverse Optimization: An Application to the Capacitated Plant Location Problem

Cited in

(1)

• Robust critical node selection by Benders decomposition

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

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