Hierarchical solution of network flow problems

DOI10.1002/NET.3230200604MaRDI QIDQ3211086zbMATH OpenOpenAlexFDO

Authors John J. Jarvis, H. Donald Ratliff, Ananth Iyer

Publication date 1990

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230200604

zbMATH Keywords

upper and lower boundslogistics planningaggregation-disaggregation procedureficticious play of a two-person gamehierarchical solution procedurenetwork flow subproblems

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06)

Recommendations

• The Solution of Multiperiod Network Models with Bundle Constraints by Aggregation
• scientific article; zbMATH DE number 556046
• A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems
• scientific article; zbMATH DE number 1552018
• A hybrid algorithm for solving network flow problems with side constraints.

Cites work

• A priori error bounds for procurement commodity aggregation in logistics planning models

Cited in

(6)

• Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
• Demand point aggregation for planar covering location models
• Balanced-flow algorithm for path network planning in hierarchical spaces
• The Solution of Multiperiod Network Models with Bundle Constraints by Aggregation
• Bush optimization method for high ranked stream networks
• The hierarchical network design problem with transshipment facilities

This page was built for publication: Hierarchical solution of network flow problems

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