Integer exact network synthesis problem

DOI10.1137/050641776MaRDI QIDQ5189504zbMATH OpenOpenAlexFDO

Authors Jin Yan, K. P. K. Nair, Santosh N. Kabadi, Donglei Du

Publication date 17 March 2010

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/050641776

zbMATH Keywords

combinatorial algorithmcut-treenetwork flowsstrongly polynomial algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

• Integer version of the multipath flow network synthesis problem
• Integer Solution to Synthesis of Communication Networks
• 2-commodity integer network synthesis problem
• Network synthesis with few edges
• The network synthesis problem in a cycle

Cited in

(3)

• Integer version of the multipath flow network synthesis problem
• On the robustness of potential-based flow networks
• Integer Solution to Synthesis of Communication Networks

This page was built for publication: Integer exact network synthesis problem

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