11 search results - page 3 / 3 » Enhancements of Branch and Bound Methods for the Maximal Con... |
COMGEO
2012
ACM
12 years 20 days ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...