1 paper · 2 filters
Gustavo Angulo, Mathieu Van Vyve
We consider a class of fixed-charge transportation problems over graphs. We show that this problem is strongly NP-hard, but solvable in pseudo-polynomial time over trees using dyna…