scientific article; zbMATH DE number 3934807

MaRDI QIDQ3706871zbMATH OpenFDO

Authors A. B. Philpott

Publication date 1985

zbMATH Keywords

infinite-dimensional linear program with a network structureminimum-cost network flow problemnetwork simplex algorithmstorage

Mathematics Subject Classification ID

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

Recommendations

• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• The network as a storage device: dynamic routing with bounded buffers
• Network flow with intermediate storage: models and algorithms
• Reconfigurable distributed storage for dynamic networks
• Network Coding for Distributed Storage Systems
• Efficient continuous-time dynamic network flow algorithms

Cited in

(13)

• Network flows with age dependent decay rates
• Solving a class of network models for dynamic flow control
• Flows over time in time-varying networks: optimality conditions and strong duality
• scientific article; zbMATH DE number 4176802 (Why is no real title available?)
• A model-based approach and analysis for multi-period networks
• A simplex algorithm for minimum-cost network-flow problems in infinite networks
• A continuous-time network simplex algorithm
• Extreme Points for Continuous Network Programs with Arc Delays
• On solving continuous-time dynamic network flows
• A Min Cost Flow Solution for Dynamic Assignment Problems in Networks with Storage Devices
• An adaptive discretization algorithm for a class of continuous network programs
• Continuous-time quadratic cost flow problems with applications to water distribution networks
• Optimal control on a graph with application to train scheduling problems

This page was built for publication:

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