A forward network simplex algorithm for solving multiperiod network flow problems

DOI10.1002/NAV.3800330310MaRDI QIDQ3731347zbMATH OpenOpenAlexFDO

Authors Jay E. Aronson, B. D. Chen

Publication date 1986

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800330310

zbMATH Keywords

implementationdecision-making problems over timecomputational testingforward network simplex methodminimum cost multiperiod network flow

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Recommendations

• Solving a class of network models for dynamic flow control
• scientific article; zbMATH DE number 3887432
• scientific article; zbMATH DE number 3916016
• A continuous-time network simplex algorithm
• scientific article; zbMATH DE number 4174642

Cites work

• scientific article; zbMATH DE number 3916016 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm

Cited in

(12)

• A simplex algorithm for network flow problems with piecewise linear fractional objective function
• A survey of dynamic network flows
• A specialized network simplex algorithm for the constrained maximum flow problem
• scientific article; zbMATH DE number 3887432 (Why is no real title available?)
• A general dynamic spatial price equilibrium model: Formulation, solution, and computational results
• The Solution of Multiperiod Network Models with Bundle Constraints by Aggregation
• Minimum cost dynamic flows: the series-parallel case
• A model-based approach and analysis for multi-period networks
• Time-varying minimum cost flow problems
• The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
• Network simplex algorithm for the general equal flow problem.
• scientific article; zbMATH DE number 3916016 (Why is no real title available?)

This page was built for publication: A forward network simplex algorithm for solving multiperiod network flow problems

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