An exact algorithm for a multicommodity min-cost flow over time problem

DOI10.1016/j.endm.2018.01.014zbMath1392.90024OpenAlexW2789228271MaRDI QIDQ1742211

Gaia Nicosia, Vincenzo Roselli, Enrico Grande, Andrea Pacifici

Publication date: 11 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.01.014

zbMATH Keywords

linear programmingcolumn generationexact algorithmmulticommodity flowflows over time

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Deterministic network models in operations research (90B10)

Related Items (2)

A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs ⋮ Cost minimizing planning of container inspection and repair in multiple facilities

Uses Software

• RelaxIV
• NETGEN

Cites Work

• Unnamed Item
• Minimum cost paths over dynamic networks
• Multicommodity flows over time: Efficient algorithms and complexity
• An Introduction to Network Flows over Time
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Minimum-cost dynamic flows: The series-parallel case
• Cheapest paths in dynamic networks
• Constructing Maximal Dynamic Flows from Static Flows
• Quickest Flows Over Time

This page was built for publication: An exact algorithm for a multicommodity min-cost flow over time problem