A note on the minimum interval cost flow problem

DOI10.1016/J.AMC.2011.02.019zbMath1216.65069OpenAlexW2054760826MaRDI QIDQ531612

Mohsen Alimomeni, Hamed Daneshpajouh

Publication date: 19 April 2011

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.02.019

zbMATH Keywords

combinatorial algorithmscomplete orderingminimum interval cost flow problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Cites Work

• Combinatorial algorithms for the minimum interval cost flow problem
• Unnamed Item

This page was built for publication: A note on the minimum interval cost flow problem