A Min Cost Flow Solution for Dynamic Assignment Problems in Networks with Storage Devices

DOI10.1287/MNSC.41.1.83zbMath0829.90054OpenAlexW2094191377MaRDI QIDQ4838076

No author found.

Publication date: 4 July 1995

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

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

zbMATH Keywords

dynamic assignmentminimum-cost flow approachstorage devices over time

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (1)

Optimisation modelling of industrial energy systems using MIND introducing the effect of material storage

This page was built for publication: A Min Cost Flow Solution for Dynamic Assignment Problems in Networks with Storage Devices