An improved disaggregation method for transportation problems

DOI10.1007/BF02592058zbMATH Open0515.90058OpenAlexW2058163317MaRDI QIDQ3662998FDOQ3662998

K. Raimer, Paul Zipkin

Publication date: 1983

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

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

zbMATH Keywords

aggregationfixed weight disaggregationlarge classical transportation problem

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• Bounds for aggregating nodes in network problems
• Solution of Large-Scale Transportation Problems Through Aggregation

Cited In (2)

• Heuristic methods and applications: A categorized survey
• A survey of dynamic network flows

This page was built for publication: An improved disaggregation method for transportation problems

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