In the past few decades, there has been a large amount of work on algorithms for linear network flow problems, special classes of network problems such as assignment problems (linear and quadratic), Steiner tree problem, topology network design and nonconvex cost network flow pr…
Greedily solvable transportation networks and edge-guided vertex elimination / Ilan Adler and Ron Shamir -- Networks minimizing length plus the number of Steiner points / Thomas Colthurst [und weitere] -- Practical experiences using an interactive optimization procedure for vehi…
In the past few decades, there has been a large amount of work on algorithms for linear network flow problems, special classes of network problems such as assignment problems (linear and quadratic), Steiner tree problem, topology network design and nonconvex cost network flow pr…
