Synthesis of a transportation network with a minimum number of edges, given an upper bound on the flow.
From MaRDI portal
Publication:2756443
zbMATH Open1097.90507MaRDI QIDQ2756443
Author name not available (Why is that?)
Publication date: 12 November 2001
Published in: (Search for Journal in Brave)
No records found.
This page was built for publication: Synthesis of a transportation network with a minimum number of edges, given an upper bound on the flow.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2756443)