Some network enlargement problems

zbMATH Open0900.90286MaRDI QIDQ674646FDOQ674646

Authors: Xiaoguang Yang 

Publication date: 22 December 1997

Published in: Chinese Science Bulletin (Search for Journal in Brave)

zbMATH Keywords

minimum cost flowNP-hard problemstrongly polynomial algorithmnetwork enlargement

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Mixed integer programming (90C11)

This page was built for publication: Some network enlargement problems

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