The Solution of Multiperiod Network Models with Bundle Constraints by Aggregation

DOI10.1287/MNSC.39.1.54zbMATH Open0776.90019OpenAlexW2079822628MaRDI QIDQ3134565FDOQ3134565

Authors: Rotimi S. Aderohunmu, Jay E. Aronson 

Publication date: 15 September 1993

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.39.1.54

Recommendations

• A forward network simplex algorithm for solving multiperiod network flow problems
• Network flow problems with one side constraint: A comparison of three solution methods
• A hybrid algorithm for solving network flow problems with side constraints.
• A fast algorithm for bounded generalized processing networks
• Hierarchical solution of network flow problems

zbMATH Keywords

disaggregationdistributionproduction planningnetwork aggregationsingle-commodity network flow

Mathematics Subject Classification ID

Linear programming (90C05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Inventory, storage, reservoirs (90B05) Production models (90B30)

Cited In (5)

• Decomposition and iterative aggregation in hierarchical and decentralised planning structures
• Resource downgrading
• Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
• A transportation type aggregate production model with bounds on inventory and backordering
• Hierarchical solution of network flow problems

This page was built for publication: The Solution of Multiperiod Network Models with Bundle Constraints by Aggregation

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