A forward network simplex algorithm for solving multiperiod network flow problems

DOI10.1002/NAV.3800330310zbMATH Open0597.90032OpenAlexW2049270020MaRDI QIDQ3731347FDOQ3731347

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

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

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)

Cites Work

• Title not available (Why is that?)
• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
• Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
• Title not available (Why is that?)

Cited In (12)

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

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)