On the Langberg-Médard multiple unicast conjecture

DOI10.1007/s10878-017-0132-2zbMath1408.90293OpenAlexW2609828883WikidataQ123203894 ScholiaQ123203894MaRDI QIDQ1679506

Guangyue Han, Kai Cai

Publication date: 9 November 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0132-2

zbMATH Keywords

nonsmooth optimizationmultiple commodity flowmultiple unicast conjecture

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

An optimization approach to the Langberg-Médard multiple unicast conjecture

Cites Work

• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Network information flow

This page was built for publication: On the Langberg-Médard multiple unicast conjecture