An improved branch and bound algorithm for minimum concave cost network flow problems

From MaRDI portal







Cites work









This page was built for publication: An improved branch and bound algorithm for minimum concave cost network flow problems

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